Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking
From MaRDI portal
Publication:5258607
DOI10.1137/14097968XzbMath1320.65066OpenAlexW1590929617MaRDI QIDQ5258607
Karl Meerbergen, Nick Vannieuwenhoven, Raf Vandebril
Publication date: 23 June 2015
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/14097968x
Symbolic computation and algebraic computation (68W30) Numerical optimization and variational techniques (65K10) Complexity and performance of numerical algorithms (65Y20) Multilinear algebra, tensor calculus (15A69)
Related Items
On norm compression inequalities for partitioned block tensors, Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition, A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem, Exploiting Efficient Representations in Large-Scale Tensor Decompositions, On the tensor spectral \(p\)-norm and its dual norm via partitions, Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition
Uses Software
Cites Work
- Unnamed Item
- Tensor Decompositions and Applications
- Refined methods for the identifiability of tensors
- A comparison of algorithms for fitting the PARAFAC model
- Block tensors and symmetric embeddings
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization
- On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part II: Uniqueness of the Overall Decomposition
- Block Tensor Unfoldings
- Exploiting Symmetry in Tensors for High Performance: Multiplication with Symmetric Tensors
- Newton-based optimization for Kullback–Leibler nonnegative tensor factorizations
- A nonlinearly preconditioned conjugate gradient algorithm for rank‐R canonical tensor approximation
- Anatomy of high-performance matrix multiplication
- A Newton–Grassmann Method for Computing the Best Multilinear Rank-$(r_1,$ $r_2,$ $r_3)$ Approximation of a Tensor
- An extended set of FORTRAN basic linear algebra subprograms
- A set of level 3 basic linear algebra subprograms
- An Algorithm For Generic and Low-Rank Specific Identifiability of Complex Tensors
- Low Complexity Damped Gauss--Newton Algorithms for CANDECOMP/PARAFAC
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
