We study robust community detection in the context of node-corrupted
sto...
In this work, we study the problem of robustly estimating the mean/locat...
We introduce general tools for designing efficient private estimation
al...
We design new polynomial-time algorithms for recovering planted cliques ...
We consider estimation models of the form Y=X^*+N, where X^* is some
m-d...
We develop the first fast spectral algorithm to decompose a random
third...
We consider mixtures of k≥ 2 Gaussian components with unknown means and
...
We develop an efficient algorithm for weak recovery in a robust version ...
We develop machinery to design efficiently computable and consistent
est...
We develop a general framework to significantly reduce the degree of
sum...
We study efficient algorithms for Sparse PCA in standard statistical mod...
We give a novel analysis of the Huber loss estimator for consistent robu...
We study symmetric spiked matrix models with respect to a general class ...
We give an algorithm for solving unique games (UG) instances whose
const...
Estimation is the computational task of recovering a hidden parameter x
...
Dinur, Khot, Kindler, Minzer and Safra (2016) recently showed that the
(...
We develop efficient algorithms for estimating low-degree moments of unk...
We study planted problems---finding hidden structures in random noisy
in...
We propose an efficient meta-algorithm for Bayesian estimation problems ...
We develop fast spectral algorithms for tensor decomposition that match ...
We obtain the first polynomial-time algorithm for exact tensor completio...
We consider two problems that arise in machine learning applications: th...
We give a new approach to the dictionary learning (also known as "sparse...