A code C {0,1}^k →{0,1}^n is a q-locally decodable code
(q-LDC) if one c...
In [Sau11,SPW13], Saunderson, Parrilo and Willsky asked the following el...
We study the computational complexity of two related problems: recoverin...
We present a polynomial-time algorithm for robustly learning an unknown
...
In this work, we give efficient algorithms for privately estimating a
Ga...
We design new polynomial-time algorithms for recovering planted cliques ...
A remarkable recent paper by Rubinfeld and Vasilyan (2022) initiated the...
We give efficient algorithms for finding power-sum decomposition of an i...
The hypergraph Moore bound is an elegant statement that characterizes th...
We give the first polynomial time algorithm for list-decodable
covarianc...
In this note, we describe a α_GW + Ω̃(1/d^2)-factor
approximation algori...
Let ℋ(k,n,p) be the distribution on k-uniform hypergraphs where
every su...
We give the first polynomial time and sample (ϵ,
δ)-differentially priva...
In this work, we revisit the problem of estimating the mean and covarian...
Consider a system of m polynomial equations {p_i(x) = b_i}_i ≤ m
of degr...
We present an algorithm for strongly refuting smoothed instances of all
...
In this work, we show, for the well-studied problem of learning parity u...
We prove that with high probability over the choice of a random graph G
...
We give a polynomial-time algorithm for the problem of robustly estimati...
We study efficient algorithms for Sparse PCA in standard statistical mod...
We give an efficient algorithm to strongly refute semi-random
instances ...
In this work, we establish lower-bounds against memory bounded algorithm...
We study the expressive power of kernel methods and the algorithmic
feas...
Several works have shown unconditional hardness (via integrality gaps) o...
Dinur, Khot, Kindler, Minzer and Safra (2016) recently showed that the
(...
We give the first polynomial-time algorithm for performing linear or
pol...
A first line of attack in exploratory data analysis is data visualizatio...
Elections involving a very large voter population often lead to outcomes...
We develop efficient algorithms for estimating low-degree moments of unk...
We study planted problems---finding hidden structures in random noisy
in...