Low Complexity Damped Gauss--Newton Algorithms for CANDECOMP/PARAFAC
From MaRDI portal
Publication:5300549
DOI10.1137/100808034zbMath1365.65071arXiv1205.2584OpenAlexW2066392792WikidataQ60486587 ScholiaQ60486587MaRDI QIDQ5300549
Anh-Huy Phan, Petr Tichavský, Andrzej Cichocki
Publication date: 27 June 2013
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.2584
inverse problemsline searchcanonical decompositionlow-rank approximationalternating least squaresGauss-NewtonLevenberg-MarquardtCANDECOMP/PARAFACtensor factorizationcomplex-valued tensor factorization
Multilinear algebra, tensor calculus (15A69) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Tensor decomposition for learning Gaussian mixtures from moments ⋮ A seminorm regularized alternating least squares algorithm for canonical tensor decomposition ⋮ The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor ⋮ Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems ⋮ Condition numbers for the tensor rank decomposition ⋮ Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition ⋮ A block-randomized stochastic method with importance sampling for CP tensor decomposition ⋮ On global convergence of alternating least squares for tensor approximation ⋮ A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem ⋮ Numerical CP decomposition of some difficult tensors ⋮ Generalized Canonical Polyadic Tensor Decomposition ⋮ Riemannian Newton optimization methods for the symmetric tensor approximation problem ⋮ The Dynamics of Swamps in the Canonical Tensor Approximation Problem ⋮ Alternate algorithms to most referenced techniques of numerical optimization to solve the symmetric rank-\(R\) approximation problem of symmetric tensors ⋮ Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition ⋮ On the Uniqueness and Perturbation to the Best Rank-One Approximation of a Tensor ⋮ Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking ⋮ A literature survey of low-rank tensor approximation techniques
