Low rank symmetric tensor approximations

DOI10.1137/16M1107528zbMATH Open1379.65025arXiv1709.01964OpenAlexW2964053826MaRDI QIDQ4598341FDOQ4598341

Authors: Jiawang Nie 

Publication date: 20 December 2017

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Abstract: For a given symmetric tensor, we aim at finding a new one whose symmetric rank is small and that is close to the given one. There exist linear relations among the entries of low rank symmetric tensors. Such linear relations can be expressed by polynomials, which are called generating polynomials. We propose a new approach for computing low rank approximations by using generating polynomials. First, we estimate a set of generating polynomials that are approximately satisfied by the given tensor. Second, we find approximate common zeros of these polynomials. Third, we use these zeros to construct low rank tensor approximations. If the symmetric tensor to be approximated is sufficiently close to a low rank one, we show that the computed low rank approximations are quasi-optimal.

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

Recommendations

• On the rank and the approximation of symmetric tensors
• Symmetric rank-1 approximation of symmetric high-order tensors
• Generating polynomials and symmetric tensor decompositions
• On the best rank-1 approximation to higher-order symmetric tensors
• A convergence analysis for an algorithm computing a symmetric low rank orthogonal approximation of a symmetric tensor

zbMATH Keywords

low rank approximationleast squaressymmetric tensortensor rankgenerating polynomialtensor decomposition

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Vector spaces, linear dependence, rank, lineability (15A03)

Cites Work

• General tensor decomposition, moment matrices and applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Tensor Decompositions and Applications
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
• Title not available (Why is that?)
• Most tensor problems are NP-hard
• Power sums, Gorenstein algebras, and determinantal loci. With an appendix `The Gotzmann theorems and the Hilbert scheme' by Anthony Iarrobino and Steven L. Kleiman
• On the best rank-1 approximation of higher-order supersymmetric tensors
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A literature survey of low-rank tensor approximation techniques
• Canonical polyadic decomposition of third-order tensors: reduction to generalized eigenvalue decomposition
• Tensor decompositions for learning latent variable models
• On generic identifiability of symmetric tensors of subgeneric rank
• Symmetric tensor decomposition
• The best rank-1 approximation of a symmetric tensor and related spherical optimization problems
• The number of singular vector tuples and uniqueness of best rank-one approximation of tensors
• Symmetric Tensors and Symmetric Tensor Rank
• Rank-one approximation to high order tensors
• Semidefinite relaxations for best rank-1 tensor approximations
• Recent advances in numerical methods for nonlinear equations and nonlinear least squares
• Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-\((L_r,L_r,1)\) terms, and a new generalization
• A Decomposition for Three-Way Arrays
• Decomposition of homogeneous polynomials with low rank
• Eigenvectors of tensors and algorithms for Waring decomposition
• Title not available (Why is that?)
• Computing symmetric rank for symmetric tensors
• Low-rank approximation of tensors
• Numerical optimization for symmetric tensor decomposition
• Remarks on the symmetric rank of symmetric tensors
• Generating polynomials and symmetric tensor decompositions
• Identifiability of homogeneous polynomials and Cremona transformations
• Nonlocal Perturbation Analysis of the Schur System of a Matrix
• Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique
• Perturbation Bounds for the Generalized Schur Decomposition

Cited In (21)

• Learning diagonal Gaussian mixture models and incomplete tensor decompositions
• Decomposition of Low Rank Multi-symmetric Tensor
• The moment-SOS hierarchy: applications and related topics
• Generating polynomials and symmetric tensor decompositions
• Symmetric orthogonal approximation to symmetric tensors with applications to image reconstruction
• Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares
• A three-way Jordan canonical form as limit of low-rank tensor approximations
• Singular Value Decompositions and Low Rank Approximations of Tensors
• Fast low rank approximations of matrices and tensors
• Symmetric rank-1 approximation of symmetric high-order tensors
• Riemannian Newton optimization methods for the symmetric tensor approximation problem
• Random Projections for Low Multilinear Rank Tensors
• Symmetric Hermitian decomposability criterion, decomposition, and its applications
• Large Margin Low Rank Tensor Analysis
• Best Nonspherical Symmetric Low Rank Approximation
• Convex generalized Nash equilibrium problems and polynomial optimization
• Loss functions for finite sets
• Approximate real symmetric tensor rank
• On the rank and the approximation of symmetric tensors
• Hankel Tensor Decompositions and Ranks
• Structure-preserving low multilinear rank approximation of antisymmetric tensors

This page was built for publication: Low rank symmetric tensor approximations

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