49 citations · 63 across the 3 of their papers we have counts for
3 papers
A Robust Spectral Algorithm for Overcomplete Tensor Decomposition
Samuel B. Hopkins, Tselil Schramm, Jonathan Shi
We give a spectral algorithm for decomposing overcomplete order-4 tensors, so long as their components satisfy an algebraic non-degeneracy condition that holds for nearly all (all…
Tensor principal component analysis via sum-of-squares proofs
Samuel B. Hopkins, Jonathan Shi, David Steurer
We study a statistical model for the tensor principal component analysis problem introduced by Montanari and Richard: Given a order- tensor of the form $T = τ\cdot v_0^{\oti…
Efficient Computation of the Kauffman Bracket
Lauren Ellenberg, Gabriella Newman, Stephen Sawin +1
This paper bounds the computational cost of computing the Kauffman bracket of a link in terms of the crossing number of that link. Specifically, it is shown that the image of a tan…