Subspace power method for symmetric tensor decomposition

Cites work

A Decomposition for Three-Way Arrays
A Rank–One Reduction Formula and Its Applications to Matrix Factorizations
An adaptive shifted power method for computing generalized tensor eigenpairs
An Extrinsic Look at the Riemannian Hessian
An Introduction to Optimization on Smooth Manifolds
Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
Average-case complexity of tensor decomposition for low-degree polynomials
Computing linear sections of varieties: quantum entanglement, tensor decompositions and beyond
Convergence Analysis on SS-HOPM for BEC-Like Nonlinear Eigenvalue Problems
Convergence results for projected line-search methods on varieties of low-rank matrices via Łojasiewicz inequality
Decompositions of a Higher-Order Tensor in Block Terms—Part I: Lemmas for Partitioned Matrices
Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
Decompositions of a Higher-Order Tensor in Block Terms—Part III: Alternating Least Squares Algorithms
Eigenvalues of a real supersymmetric tensor
Eigenvectors of tensors and algorithms for Waring decomposition
Estimating Higher-Order Moments Using Symmetric Tensor Decomposition
Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
Finding a low-rank basis in a matrix subspace
Fourth-Order Cumulant-Based Blind Identification of Underdetermined Mixtures
Generating polynomials and symmetric tensor decompositions
Gradient descent only converges to minimizers: non-isolated critical points and invariant regions
scientific article; zbMATH DE number 5968745 (Why is no real title available?)
scientific article; zbMATH DE number 3572315 (Why is no real title available?)
scientific article; zbMATH DE number 1148205 (Why is no real title available?)
scientific article; zbMATH DE number 1461253 (Why is no real title available?)
Learning mixtures of Gaussians in high dimensions
Low rank symmetric tensor approximations
Most tensor problems are NP-hard
Numerical optimization for symmetric tensor decomposition
On generic identifiability of symmetric tensors of subgeneric rank
On the optimization landscape of tensor decompositions
On the virtual array concept for higher order array processing
On the weak non-defectivity of Veronese embeddings of projective spaces
Optimal separation of independent narrow-band sources: Concept and performance
Pencil-based algorithms for tensor rank decomposition are not stable
Polynomial-time tensor decompositions with sum-of-squares
Power sums, Gorenstein algebras, and determinantal loci. With an appendix `The Gotzmann theorems and the Hilbert scheme' by Anthony Iarrobino and Steven L. Kleiman
Robust and resource efficient identification of shallow neural networks by fewest samples
Shifted power method for computing tensor eigenpairs
Smoothed analysis in unsupervised learning via decoupling
Spectra of general hypergraphs
Spectra of uniform hypergraphs
Spectral decomposition of a 4th-order covariance tensor: applications to diffusion tensor MRI
Symmetric tensor decomposition
Tensor Decompositions and Applications
Tensor decompositions for learning latent variable models
Tensor Deflation for CANDECOMP/PARAFAC— Part I: Alternating Subspace Update Algorithm
Tensor Spaces and Numerical Tensor Calculus
Weakly defective varieties

This page was built for publication: Subspace power method for symmetric tensor decomposition

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