Low rank symmetric tensor approximations
From MaRDI portal
Publication:4598341
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.
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
Cites work
- scientific article; zbMATH DE number 5968745 (Why is no real title available?)
- scientific article; zbMATH DE number 1820149 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 1253975 (Why is no real title available?)
- scientific article; zbMATH DE number 621807 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- scientific article; zbMATH DE number 773851 (Why is no real title available?)
- A Decomposition for Three-Way Arrays
- A literature survey of low-rank tensor approximation techniques
- Canonical polyadic decomposition of third-order tensors: reduction to generalized eigenvalue decomposition
- Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique
- Computing symmetric rank for symmetric tensors
- Decomposition of homogeneous polynomials with low rank
- Eigenvectors of tensors and algorithms for Waring decomposition
- General tensor decomposition, moment matrices and applications
- Generating polynomials and symmetric tensor decompositions
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Identifiability of homogeneous polynomials and Cremona transformations
- Low-rank approximation of tensors
- Most tensor problems are NP-hard
- Nonlocal Perturbation Analysis of the Schur System of a Matrix
- Numerical optimization for symmetric tensor decomposition
- On generic identifiability of symmetric tensors of subgeneric rank
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- On the best rank-1 approximation of higher-order supersymmetric tensors
- Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-\((L_r,L_r,1)\) terms, and a new generalization
- Perturbation Bounds for the Generalized Schur Decomposition
- Power sums, Gorenstein algebras, and determinantal loci. With an appendix `The Gotzmann theorems and the Hilbert scheme' by Anthony Iarrobino and Steven L. Kleiman
- Rank-one approximation to high order tensors
- Recent advances in numerical methods for nonlinear equations and nonlinear least squares
- Remarks on the symmetric rank of symmetric tensors
- Semidefinite relaxations for best rank-1 tensor approximations
- Symmetric Tensors and Symmetric Tensor Rank
- Symmetric tensor decomposition
- Tensor Decompositions and Applications
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Tensor decompositions for learning latent variable models
- 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
Cited in
(21)- Structure-preserving low multilinear rank approximation of antisymmetric tensors
- Generating polynomials and symmetric tensor decompositions
- Best Nonspherical Symmetric Low Rank Approximation
- Symmetric rank-1 approximation of symmetric high-order tensors
- Riemannian Newton optimization methods for the symmetric tensor approximation problem
- Singular Value Decompositions and Low Rank Approximations of Tensors
- Symmetric Hermitian decomposability criterion, decomposition, and its applications
- Large Margin Low Rank Tensor Analysis
- On the rank and the approximation of symmetric tensors
- Decomposition of Low Rank Multi-symmetric Tensor
- Hankel Tensor Decompositions and Ranks
- The moment-SOS hierarchy: applications and related topics
- Fast low rank approximations of matrices and tensors
- Symmetric orthogonal approximation to symmetric tensors with applications to image reconstruction
- Loss functions for finite sets
- Learning diagonal Gaussian mixture models and incomplete tensor decompositions
- A three-way Jordan canonical form as limit of low-rank tensor approximations
- Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares
- Convex generalized Nash equilibrium problems and polynomial optimization
- Random Projections for Low Multilinear Rank Tensors
- Approximate real symmetric tensor rank
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)
