| Publication | Date of Publication | Type |
|---|
| Online and distribution-free robustness: regression and contextual bandits with Huber contamination | 2025-08-13 | Paper |
| On the power of preconditioning in sparse linear regression | 2025-08-13 | Paper |
| Chow-Liu++: optimal prediction-centric learning of tree Ising models | 2025-08-13 | Paper |
| Universality of spectral independence with applications to fast mixing in spin glasses | 2024-11-28 | Paper |
A phase transition in Arrow's theorem with three alternatives
The Annals of Applied Probability | 2024-10-09 | Paper |
Kalman filtering with adversarial corruptions
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Entropic independence: optimal mixing of down-up random walks
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
| Universality of Spectral Independence with Applications to Fast Mixing in Spin Glasses | 2023-07-19 | Paper |
| Influences in Mixing Measures | 2023-07-14 | Paper |
A spectral condition for spectral gap: fast mixing in high-temperature Ising models
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2022-04-21 | Paper |
| Sampling Approximately Low-Rank Ising Models: MCMC meets Variational Methods | 2022-02-17 | Paper |
| Entropic Independence II: Optimal Sampling and Concentration via Restricted Modified Log-Sobolev Inequalities | 2021-11-05 | Paper |
| Reconstruction on Trees and Low-Degree Polynomials | 2021-09-14 | Paper |
| Entropic Independence I: Modified Log-Sobolev Inequalities for Fractionally Log-Concave Distributions and High-Temperature Ising Models | 2021-06-08 | Paper |
A Spectral Condition for Spectral Gap: Fast Mixing in High-Temperature Ising Models
(available as arXiv preprint) | 2020-07-16 | Paper |
| A Phase Transition in Arrow's Theorem | 2020-04-27 | Paper |
Learning restricted Boltzmann machines via influence maximization
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
| Fast Convergence of Belief Propagation to Global Optima: Beyond Correlation Decay | 2019-05-23 | Paper |
How many subpopulations is too many? Exponential lower bounds for inferring population histories
(available as arXiv preprint) | 2019-05-21 | Paper |
| How many subpopulations is too many? Exponential lower bounds for inferring population histories | 2019-05-21 | Paper |
| The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity | 2018-02-16 | Paper |
| The Vertex Sample Complexity of Free Energy is Polynomial | 2018-02-16 | Paper |
| Busy time scheduling on a bounded number of machines (extended abstract) | 2017-09-22 | Paper |
Optimal batch schedules for parallel machines
Lecture Notes in Computer Science | 2013-08-12 | Paper |
