| Publication | Date of Publication | Type |
|---|
Tensor cumulants for statistical inference on invariant distributions
(available as arXiv preprint) | N/A | Paper |
| Time lower bounds for the Metropolis process and simulated annealing | 2026-09-11 | Paper |
Is it easier to count communities than find them?
Random Structures & Algorithms | 2026-07-20 | Paper |
| Counterexamples to the low-degree conjecture | 2026-04-15 | Paper |
The Kikuchi hierarchy and tensor PCA
Journal of the ACM | 2025-11-27 | Paper |
| Low-degree hardness of random optimization problems | 2025-08-12 | Paper |
| The Kikuchi hierarchy and tensor PCA | 2025-08-12 | Paper |
Precise error rates for computationally efficient testing
The Annals of Statistics | 2025-06-06 | Paper |
Equivalence of approximate message passing and low-degree polynomials in rank-one matrix estimation
Probability Theory and Related Fields | 2025-02-27 | Paper |
Information-theoretic thresholds for planted dense cycles
IEEE Transactions on Information Theory | 2025-02-27 | Paper |
Optimal spectral recovery of a planted vector in a subspace
Bernoulli | 2025-02-25 | Paper |
Detection of dense subhypergraphs by low-degree polynomials
Random Structures & Algorithms | 2025-02-14 | Paper |
Spectral methods from tensor networks
SIAM Journal on Computing | 2025-01-28 | Paper |
| Is it easier to count communities than find them? | 2024-09-25 | Paper |
Circuit lower bounds for the p-spin optimization problem
Markov Processes and Related Fields | 2024-09-12 | Paper |
Subexponential-time algorithms for sparse PCA
Foundations of Computational Mathematics | 2024-07-03 | Paper |
| Average-case complexity of tensor decomposition for low-degree polynomials | 2024-05-08 | Paper |
Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics
SIAM Journal on Computing | 2024-02-28 | Paper |
Free Energy Wells and Overlap Gap Property in Sparse PCA
Communications on Pure and Applied Mathematics | 2023-10-12 | Paper |
Estimation under group actions: recovering orbits from invariants
Applied and Computational Harmonic Analysis | 2023-07-19 | Paper |
Computationally efficient sparse clustering
Information and Inference: A Journal of the IMA | 2023-02-20 | Paper |
scientific article; zbMATH DE number 7650426 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| Is it easier to count communities than find them? | 2022-12-21 | Paper |
Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio
(available as arXiv preprint) | 2022-12-13 | Paper |
| Equivalence of Approximate Message Passing and Low-Degree Polynomials in Rank-One Matrix Estimation | 2022-12-13 | Paper |
Computational barriers to estimation from low-degree polynomials
The Annals of Statistics | 2022-06-24 | Paper |
Optimal low-degree hardness of maximum independent set
Mathematical Statistics and Learning | 2022-03-11 | Paper |
The Average-Case Time Complexity of Certifying the Restricted Isometry Property
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
| Circuit Lower Bounds for the p-Spin Optimization Problem | 2021-09-03 | Paper |
Optimal Low-Degree Hardness of Maximum Independent Set
(available as arXiv preprint) | 2020-10-13 | Paper |
| Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs | 2020-08-27 | Paper |
Computational Barriers to Estimation from Low-Degree Polynomials
(available as arXiv preprint) | 2020-08-05 | Paper |
Statistical limits of spiked tensor models
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2020-05-12 | Paper |
Statistical limits of spiked tensor models
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2020-05-12 | Paper |
Spectral methods from tensor networks
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio
(available as arXiv preprint) | 2019-07-26 | Paper |
Notes on computational-to-statistical gaps: predictions using statistical physics
Portugaliae Mathematica. Nova Série | 2019-02-28 | Paper |
Computational Hardness of Certifying Bounds on Constrained PCA Problems
(available as arXiv preprint) | 2019-02-19 | Paper |
Message-passing algorithms for synchronization problems over compact groups
Communications on Pure and Applied Mathematics | 2018-11-02 | Paper |
Optimality and sub-optimality of PCA. I: Spiked random matrix models
The Annals of Statistics | 2018-10-24 | Paper |
Optimality and sub-optimality of PCA. I: Spiked random matrix models
The Annals of Statistics | 2018-10-24 | Paper |
| Optimality and Sub-optimality of PCA for Spiked Random Matrices and Synchronization | 2016-09-18 | Paper |
| A semidefinite program for unbalanced multisection in the stochastic block model | 2015-07-20 | Paper |
