Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 11 of 11 for “"Canonical Polyadic Decomposition"”.
-
An Iterative Method for Canonical Polyadic Decomposition of Tensors
The Singular Value Decomposition (SVD) of matrices is widely used in least-squares regression, image and data processing, principal component analysis and many other applications. Often only the larger singular values of the matrix are needed to reconstruct the matrix and those below a given …
-
Breaking the curse of dimensionality in electronic structure methods: towards optimal utilization of the canonical polyadic decomposition
… and application of higher-order tensor (HOT) decompositions, specifically the canonical polyadic (CP) decomposition, is fairly limited. The CP decomposition is an incredibly useful sparse tensor factorization that has the ability to disentangle all correlated modes of a tensor. However the …
-
Tensor Modeling of High-dimensional Distributions and Nonlinear Functions
… are scalable and efficient. We show that the canonical polyadic decomposition model offers an appealing solution for modeling and learning a general nonlinear function. We formulate the problem as a smooth tensor decomposition problem with missing data and prove that under certain conditions …
-
Limited feedback scheme using tensor decompositions for FDD massive MIMO systems
… possible. Our method uses two different tensor decompositions, the canonical polyadic decomposition (CPD) and the rank-(L [subscript r], L [subscript r], 1) or LL-1 block decomposition, on the DL frequency channel to estimate its parameters. By feeding back only the channel parameters, we show …
-
Hashed Coordinate Sparse Tensor Storage with MATLAB
… Interest in tensor analysis using tensor decomposition has expanded to a variety of fields, including data mining, signal processing, computer vision, and machine learning. Tensors modelling interesting data may also be sparse, where the majority of its values are zero. These tensors can …
-
Electron Dynamics of Inter-particle Coulombic Decay in Self-Assembled Quantum Dots
… and a recently introduced Monte-Carlo-based canonical polyadic decomposition. This requires adopting a new mode combination, and the results show that it can substantially accelerate high-dimensional simulations, ultimately enabling realistic modeling of interparticle Coulombic decay in …
-
Low-Rank Matrix And Tensor Models For Data Science Applications
… by the r dominant factors of the singular value decomposition (SVD). When the model is multilinear and the data is represented as a multi-way array called a tensor, the optimal rank-r approximation may not even exist. Nonetheless, the canonical polyadic decomposition (CP) provides a useful …
-
Optimization and Machine Learning Techniques for Analyzing Spatiotemporal Dynamics
In a numerical context, the tensor CP decomposition challenge can be reformulated into a series of least squares subproblems, which can be addressed using the renowned Alternating Least Square algorithm (ALS). The ALS algorithm is often characterized by a 'swamp phenomenon' that slows down its …
-
Tensor Decomposition for Motion Artifact Removal in Wireless ECG
… we propose the application of tensor decomposition using canonical polyadic decomposition (CPD) as an example. A significant advantage of tensor factorization is that it can decompose the data without artificial constraints, unlike matrix factorization. We use CPD along with …
-
Constrained Matrix and Tensor Factorization: Theory, Algorithms, and Applications
… two-way to higher-way tensor data, the so-called canonical polyadic decomposition (CPD) model can provide essentially unique factors under mild conditions, but it is also widely accepted that if correct priors are imposed on the latent factors, the estimation performance can be greatly enhanced. …
-
Array processing with compressive measurements and coherent signals
… decorrelate the covariance tensor, followed by canonical polyadic decomposition (CPD) for signal DOA estimation. We then develop a general framework for 2D DOA estimation of coherent signals in a uniform rectangular array (URA), with a detailed study of the tradeoffs among the achievable number …