| Publication | Date of Publication | Type |
|---|
Adversarially-Robust Inference on Trees via Belief Propagation
(available as arXiv preprint) | N/A | Paper |
The full landscape of robust mean testing: sharp separations between oblivious and adaptive contamination
SIAM Journal on Computing | 2026-07-08 | Paper |
| The full landscape of robust mean testing: sharp separations between oblivious and adaptive contamination | 2025-08-15 | Paper |
| Subexponential LPs approximate max-cut | 2025-08-12 | Paper |
| Smoothed complexity of 2-player Nash equilibria | 2025-08-12 | Paper |
| Outlier-robust clustering of Gaussians and other non-spherical mixtures | 2025-08-12 | Paper |
| The power of sum-of-squares for detecting hidden structures | 2025-08-06 | Paper |
| Efficient Bayesian estimation from few samples: community detection and related problems | 2025-08-06 | Paper |
| A nearly tight sum-of-squares lower bound for the planted clique problem | 2025-08-06 | Paper |
Matrix discrepancy from Quantum communication
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Efficient mean estimation with pure differential privacy via a sum-of-squares exponential mechanism
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
| Robustness Implies Privacy in Statistical Estimation | 2022-12-09 | Paper |
Algorithms for heavy-tailed statistics: regression, covariance estimation, and beyond
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Mean estimation with sub-Gaussian rates in polynomial time
The Annals of Statistics | 2020-08-28 | Paper |
Mean estimation with sub-Gaussian rates in polynomial time
The Annals of Statistics | 2020-08-28 | Paper |
| Sum-of-squares meets program obfuscation, revisited | 2020-02-04 | Paper |
Algorithms for Heavy-Tailed Statistics: Regression, Covariance Estimation, and Beyond
(available as arXiv preprint) | 2019-12-23 | Paper |
Mixture models, robustness, and sum of squares proofs
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
A nearly tight sum-of-squares lower bound for the planted clique problem
SIAM Journal on Computing | 2019-05-07 | Paper |
On the integrality gap of degree-4 sum of squares for planted clique
ACM Transactions on Algorithms | 2018-11-13 | Paper |
On the integrality gap of degree-4 sum of squares for planted clique
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Bayesian estimation from few samples: community detection and related problems | 2017-09-30 | Paper |
Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Kolmogorov complexity, circuits, and the strength of formal theories of arithmetic
Chicago Journal of Theoretical Computer Science | 2014-05-07 | Paper |
