Computing the gradient in optimization algorithms for the CP decomposition in constant memory through tensor blocking
From MaRDI portal
(Redirected from Publication:5258607)
Recommendations
- Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-(L_r,L_r,1) terms, and a new generalization
- Computing dense tensor decompositions with optimal dimension trees
- Parallel Candecomp/Parafac decomposition of sparse tensors using dimension trees
- Stochastic gradients for large-scale tensor decomposition
- A Practical Randomized CP Tensor Decomposition
Cites work
- A comparison of algorithms for fitting the PARAFAC model
- A Newton-Grassmann method for computing the best multilinear rank-(r₁,r₂,r₃) approximation of a tensor
- A nonlinearly preconditioned conjugate gradient algorithm for rank-R canonical tensor approximation.
- A set of level 3 basic linear algebra subprograms
- An algorithm for generic and low-rank specific identifiability of complex tensors
- An extended set of FORTRAN basic linear algebra subprograms
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Anatomy of high-performance matrix multiplication
- Block tensor unfoldings
- Block tensors and symmetric embeddings
- Exploiting symmetry in tensors for high performance: multiplication with symmetric tensors
- scientific article; zbMATH DE number 5968745 (Why is no real title available?)
- Low complexity damped Gauss-Newton algorithms for CANDECOMP/PARAFAC
- Newton-based optimization for Kullback-Leibler nonnegative tensor factorizations
- On the uniqueness of the canonical polyadic decomposition of third-order tensors. II: Uniqueness of the overall decomposition
- Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-(L_r,L_r,1) terms, and a new generalization
- Refined methods for the identifiability of tensors
- Tensor Decompositions and Applications
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
Cited in
(7)- Computing dense tensor decompositions with optimal dimension trees
- On norm compression inequalities for partitioned block tensors
- On the tensor spectral p-norm and its dual norm via partitions
- Exploiting Efficient Representations in Large-Scale Tensor Decompositions
- Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition
- A Riemannian trust region method for the canonical tensor rank approximation problem
- Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition
This page was built for publication: Computing the gradient in optimization algorithms for the CP decomposition in constant memory through tensor blocking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5258607)
