The generalized singular value decomposition(GSVD)of two matrices with the same number of columns is a very useful tool in many practical applications.However,the GSVD may suffer from heavy computational time and memo...The generalized singular value decomposition(GSVD)of two matrices with the same number of columns is a very useful tool in many practical applications.However,the GSVD may suffer from heavy computational time and memory requirement when the scale of the matrices is quite large.In this paper,we use random projections to capture the most of the action of the matrices and propose randomized algorithms for computing a low-rank approximation of the GSVD.Serval error bounds of the approximation are also presented for the proposed randomized algorithms.Finally,some experimental results show that the proposed randomized algorithms can achieve a good accuracy with less computational cost and storage requirement.展开更多
As the development of smart grid and energy internet, this leads to a significantincrease in the amount of data transmitted in real time. Due to the mismatch withcommunication networks that were not designed to carry ...As the development of smart grid and energy internet, this leads to a significantincrease in the amount of data transmitted in real time. Due to the mismatch withcommunication networks that were not designed to carry high-speed and real time data,data losses and data quality degradation may happen constantly. For this problem,according to the strong spatial and temporal correlation of electricity data which isgenerated by human’s actions and feelings, we build a low-rank electricity data matrixwhere the row is time and the column is user. Inspired by matrix decomposition, we dividethe low-rank electricity data matrix into the multiply of two small matrices and use theknown data to approximate the low-rank electricity data matrix and recover the missedelectrical data. Based on the real electricity data, we analyze the low-rankness of theelectricity data matrix and perform the Matrix Decomposition-based method on the realdata. The experimental results verify the efficiency and efficiency of the proposed scheme.展开更多
Tensor robust principal component analysis has received a substantial amount of attention in various fields.Most existing methods,normally relying on tensor nuclear norm minimization,need to pay an expensive computati...Tensor robust principal component analysis has received a substantial amount of attention in various fields.Most existing methods,normally relying on tensor nuclear norm minimization,need to pay an expensive computational cost due to multiple singular value decompositions at each iteration.To overcome the drawback,we propose a scalable and efficient method,named parallel active subspace decomposition,which divides the unfolding along each mode of the tensor into a columnwise orthonormal matrix(active subspace)and another small-size matrix in parallel.Such a transformation leads to a nonconvex optimization problem in which the scale of nuclear norm minimization is generally much smaller than that in the original problem.We solve the optimization problem by an alternating direction method of multipliers and show that the iterates can be convergent within the given stopping criterion and the convergent solution is close to the global optimum solution within the prescribed bound.Experimental results are given to demonstrate that the performance of the proposed model is better than the state-of-the-art methods.展开更多
Forward modeling of seismic wave propagation is crucial for the realization of reverse time migration(RTM) and full waveform inversion(FWI) in attenuating transversely isotropic media. To describe the attenuation and ...Forward modeling of seismic wave propagation is crucial for the realization of reverse time migration(RTM) and full waveform inversion(FWI) in attenuating transversely isotropic media. To describe the attenuation and anisotropy properties of subsurface media, the pure-viscoacoustic anisotropic wave equations are established for wavefield simulations, because they can provide clear and stable wavefields. However, due to the use of several approximations in deriving the wave equation and the introduction of a fractional Laplacian approximation in solving the derived equation, the wavefields simulated by the previous pure-viscoacoustic tilted transversely isotropic(TTI) wave equations has low accuracy. To accurately simulate wavefields in media with velocity anisotropy and attenuation anisotropy, we first derive a new pure-viscoacoustic TTI wave equation from the exact complex-valued dispersion formula in viscoelastic vertical transversely isotropic(VTI) media. Then, we present the hybrid finite-difference and low-rank decomposition(HFDLRD) method to accurately solve our proposed pure-viscoacoustic TTI wave equation. Theoretical analysis and numerical examples suggest that our pure-viscoacoustic TTI wave equation has higher accuracy than previous pure-viscoacoustic TTI wave equations in describing q P-wave kinematic and attenuation characteristics. Additionally, the numerical experiment in a simple two-layer model shows that the HFDLRD technique outperforms the hybrid finite-difference and pseudo-spectral(HFDPS) method in terms of accuracy of wavefield modeling.展开更多
Nonnegative tensor ring(NTR) decomposition is a powerful tool for capturing the significant features of tensor objects while preserving the multi-linear structure of tensor data. The existing algorithms rely on freque...Nonnegative tensor ring(NTR) decomposition is a powerful tool for capturing the significant features of tensor objects while preserving the multi-linear structure of tensor data. The existing algorithms rely on frequent reshaping and permutation operations in the optimization process and use a shrinking step size or projection techniques to ensure core tensor nonnegativity, which leads to a slow convergence rate, especially for large-scale problems. In this paper, we first propose an NTR algorithm based on the modulus method(NTR-MM), which constrains core tensor nonnegativity by modulus transformation. Second, a low-rank approximation(LRA) is introduced to NTR-MM(named LRA-NTR-MM), which not only reduces the computational complexity of NTR-MM significantly but also suppresses the noise. The simulation results demonstrate that the proposed LRA-NTR-MM algorithm achieves higher computational efficiency than the state-of-the-art algorithms while preserving the effectiveness of feature extraction.展开更多
Higher-order singular value decomposition （HOSVD） is an efficient way for data reduction and also eliciting intrinsic structure of multi-dimensional array data. It has been used in many applications, and some of the...Higher-order singular value decomposition （HOSVD） is an efficient way for data reduction and also eliciting intrinsic structure of multi-dimensional array data. It has been used in many applications, and some of them involve incomplete data. To obtain HOSVD of the data with missing values, one can first impute the missing entries through a certain tensor completion method and then perform HOSVD to the reconstructed data. However, the two-step procedure can be inefficient and does not make reliable decomposition. In this paper, we formulate an incomplete HOSVD problem and combine the two steps into solving a single optimization problem, which simultaneously achieves imputation of missing values and also tensor decomposition. We also present one algorithm for solving the problem based on block coordinate update （BCU）. Global convergence of the algorithm is shown under mild assumptions and implies that of the popular higher-order orthogonality iteration （HOOI） method, and thus we, for the first time, give global convergence of HOOI. In addition, we compare the proposed method to state-of-the-art ones for solving incom- plete HOSVD and also low-rank tensor completion problems and demonstrate the superior performance of our method over other compared ones. Furthermore, we apply it to face recognition and MRI image reconstruction to show its practical performance.展开更多
We present our recent work on both linear and nonlinear data reduction methods and algorithms: for the linear case we discuss results on structure analysis of SVD of columnpartitioned matrices and sparse low-rank appr...We present our recent work on both linear and nonlinear data reduction methods and algorithms: for the linear case we discuss results on structure analysis of SVD of columnpartitioned matrices and sparse low-rank approximation; for the nonlinear case we investigate methods for nonlinear dimensionality reduction and manifold learning. The problems we address have attracted great deal of interest in data mining and machine learning.展开更多
Knowledge graph embedding, which maps the entities and relations into low-dimensional vector spaces, has demonstrated its effectiveness in many tasks such as link prediction and relation extraction. Typical methods in...Knowledge graph embedding, which maps the entities and relations into low-dimensional vector spaces, has demonstrated its effectiveness in many tasks such as link prediction and relation extraction. Typical methods include TransE, TransH, and TransR. All these methods map different relations into the vector space separately and the intrinsic correlations of these relations are ignored. It is obvious that there exist some correlations among relations because different relations may connect to a common entity. For example, the triples （Steve Jobs, PlaceOfBrith, California） and （Apple Inc., Location, California） share the same entity California as their tail entity. We analyze the embedded relation matrices learned by TransE/TransH/TransR, and find that the correlations of relations do exist and they are showed as low-rank structure over the embedded relation matrix. It is natural to ask whether we can leverage these correlations to learn better embeddings for the entities and relations in a knowledge graph. In this paper, we propose to learn the embedded relation matrix by decomposing it as a product of two low-dimensional matrices, for characterizing the low-rank structure. The proposed method, called TransCoRe （Translation-Based Method via Modeling the Correlations of Relations）, learns the embeddings of entities and relations with translation-based framework. Experimental results based on the benchmark datasets of WordNet and Freebase demonstrate that our method outperforms the typical baselines on link prediction and triple classification tasks.展开更多
Model recognition of second-hand mobile phones has been considered as an essential process to improve the efficiency of phone recycling. However, due to the diversity of mobile phone appearances, it is difficult to re...Model recognition of second-hand mobile phones has been considered as an essential process to improve the efficiency of phone recycling. However, due to the diversity of mobile phone appearances, it is difficult to realize accurate recognition. To solve this problem, a mobile phone recognition method based on bilinear-convolutional neural network(B-CNN) is proposed in this paper.First, a feature extraction model, based on B-CNN, is designed to adaptively extract local features from the images of secondhand mobile phones. Second, a joint loss function, constructed by center distance and softmax, is developed to reduce the interclass feature distance during the training process. Third, a parameter downscaling method, derived from the kernel discriminant analysis algorithm, is introduced to eliminate redundant features in B-CNN. Finally, the experimental results demonstrate that the B-CNN method can achieve higher accuracy than some existing methods.展开更多
基金The research is supported by the National Natural Science Foundation of China under Grant nos.11701409 and 11571171the Natural Science Foundation of Jiangsu Province of China under Grant BK20170591the Natural Science Foundation of Jiangsu Higher Education Institutions of China under Grant 17KJB110018.
文摘The generalized singular value decomposition(GSVD)of two matrices with the same number of columns is a very useful tool in many practical applications.However,the GSVD may suffer from heavy computational time and memory requirement when the scale of the matrices is quite large.In this paper,we use random projections to capture the most of the action of the matrices and propose randomized algorithms for computing a low-rank approximation of the GSVD.Serval error bounds of the approximation are also presented for the proposed randomized algorithms.Finally,some experimental results show that the proposed randomized algorithms can achieve a good accuracy with less computational cost and storage requirement.
文摘As the development of smart grid and energy internet, this leads to a significantincrease in the amount of data transmitted in real time. Due to the mismatch withcommunication networks that were not designed to carry high-speed and real time data,data losses and data quality degradation may happen constantly. For this problem,according to the strong spatial and temporal correlation of electricity data which isgenerated by human’s actions and feelings, we build a low-rank electricity data matrixwhere the row is time and the column is user. Inspired by matrix decomposition, we dividethe low-rank electricity data matrix into the multiply of two small matrices and use theknown data to approximate the low-rank electricity data matrix and recover the missedelectrical data. Based on the real electricity data, we analyze the low-rankness of theelectricity data matrix and perform the Matrix Decomposition-based method on the realdata. The experimental results verify the efficiency and efficiency of the proposed scheme.
基金the HKRGC GRF 12306616,12200317,12300218 and 12300519,and HKU Grant 104005583.
文摘Tensor robust principal component analysis has received a substantial amount of attention in various fields.Most existing methods,normally relying on tensor nuclear norm minimization,need to pay an expensive computational cost due to multiple singular value decompositions at each iteration.To overcome the drawback,we propose a scalable and efficient method,named parallel active subspace decomposition,which divides the unfolding along each mode of the tensor into a columnwise orthonormal matrix(active subspace)and another small-size matrix in parallel.Such a transformation leads to a nonconvex optimization problem in which the scale of nuclear norm minimization is generally much smaller than that in the original problem.We solve the optimization problem by an alternating direction method of multipliers and show that the iterates can be convergent within the given stopping criterion and the convergent solution is close to the global optimum solution within the prescribed bound.Experimental results are given to demonstrate that the performance of the proposed model is better than the state-of-the-art methods.
基金supported by the Marine S&T Fund of Shandong Province for Pilot National Laboratory for Marine Science and Technology(Qingdao)(No.2021QNLM020001)the Major Scientific and Technological Projects of Shandong Energy Group(No.SNKJ2022A06-R23)+1 种基金the Funds of Creative Research Groups of China(No.41821002)National Natural Science Foundation of China Outstanding Youth Science Fund Project(Overseas)(No.ZX20230152)。
文摘Forward modeling of seismic wave propagation is crucial for the realization of reverse time migration(RTM) and full waveform inversion(FWI) in attenuating transversely isotropic media. To describe the attenuation and anisotropy properties of subsurface media, the pure-viscoacoustic anisotropic wave equations are established for wavefield simulations, because they can provide clear and stable wavefields. However, due to the use of several approximations in deriving the wave equation and the introduction of a fractional Laplacian approximation in solving the derived equation, the wavefields simulated by the previous pure-viscoacoustic tilted transversely isotropic(TTI) wave equations has low accuracy. To accurately simulate wavefields in media with velocity anisotropy and attenuation anisotropy, we first derive a new pure-viscoacoustic TTI wave equation from the exact complex-valued dispersion formula in viscoelastic vertical transversely isotropic(VTI) media. Then, we present the hybrid finite-difference and low-rank decomposition(HFDLRD) method to accurately solve our proposed pure-viscoacoustic TTI wave equation. Theoretical analysis and numerical examples suggest that our pure-viscoacoustic TTI wave equation has higher accuracy than previous pure-viscoacoustic TTI wave equations in describing q P-wave kinematic and attenuation characteristics. Additionally, the numerical experiment in a simple two-layer model shows that the HFDLRD technique outperforms the hybrid finite-difference and pseudo-spectral(HFDPS) method in terms of accuracy of wavefield modeling.
基金This work was supported by the National Natural Science Foundation of China(Grant Nos.62073087,61973087 and 61973090)the Key-Area Research and Development Program of Guangdong Province(Grant No.2019B010154002)。
文摘Nonnegative tensor ring(NTR) decomposition is a powerful tool for capturing the significant features of tensor objects while preserving the multi-linear structure of tensor data. The existing algorithms rely on frequent reshaping and permutation operations in the optimization process and use a shrinking step size or projection techniques to ensure core tensor nonnegativity, which leads to a slow convergence rate, especially for large-scale problems. In this paper, we first propose an NTR algorithm based on the modulus method(NTR-MM), which constrains core tensor nonnegativity by modulus transformation. Second, a low-rank approximation(LRA) is introduced to NTR-MM(named LRA-NTR-MM), which not only reduces the computational complexity of NTR-MM significantly but also suppresses the noise. The simulation results demonstrate that the proposed LRA-NTR-MM algorithm achieves higher computational efficiency than the state-of-the-art algorithms while preserving the effectiveness of feature extraction.
文摘Higher-order singular value decomposition （HOSVD） is an efficient way for data reduction and also eliciting intrinsic structure of multi-dimensional array data. It has been used in many applications, and some of them involve incomplete data. To obtain HOSVD of the data with missing values, one can first impute the missing entries through a certain tensor completion method and then perform HOSVD to the reconstructed data. However, the two-step procedure can be inefficient and does not make reliable decomposition. In this paper, we formulate an incomplete HOSVD problem and combine the two steps into solving a single optimization problem, which simultaneously achieves imputation of missing values and also tensor decomposition. We also present one algorithm for solving the problem based on block coordinate update （BCU）. Global convergence of the algorithm is shown under mild assumptions and implies that of the popular higher-order orthogonality iteration （HOOI） method, and thus we, for the first time, give global convergence of HOOI. In addition, we compare the proposed method to state-of-the-art ones for solving incom- plete HOSVD and also low-rank tensor completion problems and demonstrate the superior performance of our method over other compared ones. Furthermore, we apply it to face recognition and MRI image reconstruction to show its practical performance.
基金This work was supported in part by the Special Funds for Major State Basic Research Projectsthe National Natural Science Foundation of China(Grants No.60372033 and 9901936)NSF CCR9901986,DMS 0311800.
文摘We present our recent work on both linear and nonlinear data reduction methods and algorithms: for the linear case we discuss results on structure analysis of SVD of columnpartitioned matrices and sparse low-rank approximation; for the nonlinear case we investigate methods for nonlinear dimensionality reduction and manifold learning. The problems we address have attracted great deal of interest in data mining and machine learning.
基金This work was supported by the National Basic Research 973 Program of China under Grant No. 2014CB340405, the National Key Research and Development Program of China under Grant No. 2016YFB1000902, and the National Natural Science Foundation of China under Grant Nos. 61402442, 61272177, 61173008, 61232010, 61303244, 61572469, 91646120 and 61572473.
文摘Knowledge graph embedding, which maps the entities and relations into low-dimensional vector spaces, has demonstrated its effectiveness in many tasks such as link prediction and relation extraction. Typical methods include TransE, TransH, and TransR. All these methods map different relations into the vector space separately and the intrinsic correlations of these relations are ignored. It is obvious that there exist some correlations among relations because different relations may connect to a common entity. For example, the triples （Steve Jobs, PlaceOfBrith, California） and （Apple Inc., Location, California） share the same entity California as their tail entity. We analyze the embedded relation matrices learned by TransE/TransH/TransR, and find that the correlations of relations do exist and they are showed as low-rank structure over the embedded relation matrix. It is natural to ask whether we can leverage these correlations to learn better embeddings for the entities and relations in a knowledge graph. In this paper, we propose to learn the embedded relation matrix by decomposing it as a product of two low-dimensional matrices, for characterizing the low-rank structure. The proposed method, called TransCoRe （Translation-Based Method via Modeling the Correlations of Relations）, learns the embeddings of entities and relations with translation-based framework. Experimental results based on the benchmark datasets of WordNet and Freebase demonstrate that our method outperforms the typical baselines on link prediction and triple classification tasks.
基金supported by the National Key Program of China(Grant No.2018YFC1900800-5)the National Natural Science Foundation of China(Grant Nos.61890930-5 and 61622301)the Beijing University Outstanding Young Scientist Program(Grant No.BJJWZYJH0120191000-5020)。
文摘Model recognition of second-hand mobile phones has been considered as an essential process to improve the efficiency of phone recycling. However, due to the diversity of mobile phone appearances, it is difficult to realize accurate recognition. To solve this problem, a mobile phone recognition method based on bilinear-convolutional neural network(B-CNN) is proposed in this paper.First, a feature extraction model, based on B-CNN, is designed to adaptively extract local features from the images of secondhand mobile phones. Second, a joint loss function, constructed by center distance and softmax, is developed to reduce the interclass feature distance during the training process. Third, a parameter downscaling method, derived from the kernel discriminant analysis algorithm, is introduced to eliminate redundant features in B-CNN. Finally, the experimental results demonstrate that the B-CNN method can achieve higher accuracy than some existing methods.
