Gradient Descent for Symmetric Tensor Decomposition

DOI10.4208/AAM.OA-2021-0090MaRDI QIDQ6097061zbMATH OpenOpenAlexFDO

Authors Jian-Feng Cai, Haixia Liu, Yang Wang

Publication date 12 June 2023

Published in Annals of Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4208/aam.oa-2021-0090

zbMATH Keywords

CP decompositiongradient descentlinear convergencerandom initializationsymmetric tensor decomposition

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Methods of reduced gradient type (90C52)

Recommendations

• Greedy approaches to symmetric orthogonal tensor decomposition
• Alternate algorithms to most referenced techniques of numerical optimization to solve the symmetric rank-\(R\) approximation problem of symmetric tensors
• Symmetric rank-1 approximation of symmetric high-order tensors
• Symmetric tensor decomposition
• A convergence analysis for an algorithm computing a symmetric low rank orthogonal approximation of a symmetric tensor

Cited in

(4)

• Estimating Higher-Order Moments Using Symmetric Tensor Decomposition
• Symmetric tensor decomposition
• Scalable symmetric Tucker tensor decomposition
• Complete decomposition of symmetric tensors in linear time and polylogarithmic precision

This page was built for publication: Gradient Descent for Symmetric Tensor Decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6097061)