| Title: |
Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors |
| Article URLs: |
|
| Alternative Article URLs: |
https://arxiv.org/pdf/1512.02337.pdf |
| Authors: |
Samuel B. Hopkins |
-
Cornell University, Computer Science
|
| Tselil Schramm |
-
University of California - Berkeley, Electrical Engineering and Computer Science
|
| Jonathan Shi |
-
Cornell University, Computer Science
|
| David Steurer |
-
Cornell University, Computer Science
|
| Sharing: |
Other
|
| Verification: |
Authors have
verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
1144153,
1106400,
1350196
|
| DBLP Key: |
conf/stoc/HopkinsSSS16
|
| Author Comments: |
None of the results claimed in the paper are backed by code. All contributions of the paper are backed by proofs, which are all included in the arXiv version of the paper. The paper includes formal descriptions of all contributed algorithms, at a level of detail sufficient to directly translate to any programming language that has a linear algebra package. |