Spectral methods from tensor networks
From MaRDI portal
Cites work
- A nearly tight sum-of-squares lower bound for the planted clique problem
- A tensor approach to learning mixed membership community models
- Algorithmic aspects of machine learning
- Analyzing tensor power method dynamics in overcomplete regime
- Angular synchronization by eigenvectors and semidefinite programming
- Bispectrum Inversion With Application to Multireference Alignment
- Concentration and moment inequalities for polynomials of independent random variables
- Decomposing overcomplete 3rd order tensors using sum-of-squares algorithms
- Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
- Learning mixtures of spherical Gaussians: moment methods and spectral decompositions (extended abstract)
- Learning nonsingular phylogenies and hidden Markov models
- Message-passing algorithms for synchronization problems over compact groups
- Multireference alignment using semidefinite programming
- Non-unique games over compact groups and orientation estimation in cryo-EM
- Optimal rates of estimation for multi-reference alignment
- Polynomial-time tensor decompositions with sum-of-squares
- Rapid solution of the cryo-EM reconstruction problem by frequency marching
- The sample complexity of multireference alignment
- Three-dimensional structure determination from common lines in cryo-EM by eigenvectors and semidefinite programming
This page was built for publication: Spectral methods from tensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7036478)
