583 research outputs found
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem
We prove that with high probability over the choice of a random graph
from the Erd\H{o}s-R\'enyi distribution , the -time degree
Sum-of-Squares semidefinite programming relaxation for the clique problem
will give a value of at least for some constant
. This yields a nearly tight bound on the value of this
program for any degree . Moreover we introduce a new framework
that we call \emph{pseudo-calibration} to construct Sum of Squares lower
bounds. This framework is inspired by taking a computational analog of Bayesian
probability theory. It yields a general recipe for constructing good
pseudo-distributions (i.e., dual certificates for the Sum-of-Squares
semidefinite program), and sheds further light on the ways in which this
hierarchy differs from others.Comment: 55 page
The power of sum-of-squares for detecting hidden structures
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 powerful semidefinite programs has recently
yielded many new algorithms for planted problems, often achieving the best
known polynomial-time guarantees in terms of accuracy of recovered solutions
and robustness to noise. One theme in recent work is the design of spectral
algorithms which match the guarantees of SoS algorithms for planted problems.
Classical spectral algorithms are often unable to accomplish this: the twist in
these new spectral algorithms is the use of spectral structure of matrices
whose entries are low-degree polynomials of the input variables. We prove that
for a wide class of planted problems, including refuting random constraint
satisfaction problems, tensor and sparse PCA, densest-k-subgraph, community
detection in stochastic block models, planted clique, and others, eigenvalues
of degree-d matrix polynomials are as powerful as SoS semidefinite programs of
roughly degree d. For such problems it is therefore always possible to match
the guarantees of SoS without solving a large semidefinite program. Using
related ideas on SoS algorithms and low-degree matrix polynomials (and inspired
by recent work on SoS and the planted clique problem by Barak et al.), we prove
new nearly-tight SoS lower bounds for the tensor and sparse principal component
analysis problems. Our lower bounds for sparse principal component analysis are
the first to suggest that going beyond existing algorithms for this problem may
require sub-exponential time
- …