11 citations · 12 across the 2 of their papers we have counts for
3 papers
cs.DS2017
The power of sum-of-squares for detecting hidden structures
Samuel B. Hopkins, Pravesh K. Kothari, Aaron Potechin +3
We study planted problems---finding hidden structures in random noisy inputs---through the lens of the sum-of-squares semidefinite programming hierarchy (SoS). This family of power…
cs.LG2017★ 11 cited
Fast and robust tensor decomposition with applications to dictionary learning
Tselil Schramm, David Steurer
We develop fast spectral algorithms for tensor decomposition that match the robustness guarantees of the best known polynomial-time algorithms for this problem based on the sum-of-…
math.CO2015★ 1 cited
Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors
Ronen Eldan, Miklós Rácz, Tselil Schramm
We study how the spectral gap of the normalized Laplacian of a random graph changes when an edge is added to or removed from the graph. There are known examples of graphs where, pe…