Fast spectral algorithms from sum-of-squares proofs: tensor
decomposition and planted sparse vectors

v1v2 (latest)

Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors

8 December 2015

Samuel B. Hopkins

ArXiv (abs)PDF HTML

Papers citing "Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors"

6 / 56 papers shown

Title
Exact tensor completion with sum-of-squares Aaron Potechin David Steurer 207 80 0 21 Feb 2017
Spectral algorithms for tensor completion Andrea Montanari Nike Sun 170 87 0 23 Dec 2016
Polynomial-time Tensor Decompositions with Sum-of-Squares Tengyu Ma Jonathan Shi David Steurer 212 121 0 06 Oct 2016
A Non-generative Framework and Convex Relaxations for Unsupervised Learning Elad Hazan Tengyu Ma 112 19 0 04 Oct 2016
Complete Dictionary Recovery over the Sphere II: Recovery by Riemannian Trust-region Method Ju Sun Qing Qu John N. Wright 98 147 0 15 Nov 2015
Finding a sparse vector in a subspace: Linear sparsity using alternating directions Qing Qu Ju Sun John N. Wright 129 112 0 15 Dec 2014