Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition

DOI10.1137/22m1490739zbMath1527.15026arXiv2204.07208MaRDI QIDQ6087747

Edgar Solomonik, Navjot Singh

Publication date: 16 November 2023

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.07208

zbMATH Keywords

eigenvaluescondition numbersingular valuestensor decompositionalternating least squaresMahalanobis distanceCP decomposition

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Vector and tensor algebra, theory of invariants (15A72) Approximation algorithms (68W25) Complexity and performance of numerical algorithms (65Y20) Multilinear algebra, tensor calculus (15A69) Numerical algorithms for computer arithmetic, etc. (65Y04)

Cites Work

• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• A comparison of algorithms for fitting the PARAFAC model
• An enhanced line search scheme for complex-valued tensor decompositions. Application in DS-CDMA
• Computing dense tensor decompositions with optimal dimension trees
• Tensor eigenvalues and their applications
• Musings on multilinear fitting
• Further results on Moore-Penrose inverses of tensors with application to tensor nearness problems
• Condition numbers for the tensor rank decomposition
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Moore–Penrose inverse of tensors via Einstein product
• Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization
• Metric Learning: A Survey
• Local Convergence of the Alternating Least Squares Algorithm for Canonical Tensor Approximation
• Tensor decompositions for learning latent variable models
• The Z -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory
• Exploiting Symmetry in Tensors for High Performance: Multiplication with Symmetric Tensors
• Globally Convergent Jacobi-Type Algorithms for Simultaneous Orthogonal Symmetric Tensor Diagonalization
• Shifted Power Method for Computing Tensor Eigenpairs
• Parallel Candecomp/Parafac Decomposition of Sparse Tensors Using Dimension Trees
• Singular vectors of orthogonally decomposable tensors
• The Condition Number of Join Decompositions
• Tensor Decomposition for Signal Processing and Machine Learning
• A Practical Randomized CP Tensor Decomposition
• Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition
• Nesterov acceleration of alternating least squares for canonical tensor decomposition: Momentum step size selection and restart mechanisms
• Approximate Matrix and Tensor Diagonalization by Unitary Transformations: Convergence of Jacobi-Type Algorithms
• Metric Learning
• All Real Eigenvalues of Symmetric Tensors
• Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking
• Low Complexity Damped Gauss--Newton Algorithms for CANDECOMP/PARAFAC
• Enhanced Line Search: A Novel Method to Accelerate PARAFAC
• Most Tensor Problems Are NP-Hard
• Accelerating alternating least squares for tensor decomposition by pairwise perturbation
• Exact line and plane search for tensor optimization
• The condition number of many tensor decompositions is invariant under Tucker compression

This page was built for publication: Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition