Some Recent Papers

(Click here for all papers)

Chow-Liu++: Optimal Prediction-Centric Learning of Tree Ising Models
The Algorithmic Phase Transition of Random k-SAT for Low Degree Polynomials
De Finetti-Style Results for Wishart Matrices: Combinatorial Structure and Phase Transitions
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent
Reducibility and Statistical-Computational Gaps from Secret Leakage
A Corrective View of Neural Networks: Representation, Memorization and Learning
Sharp Representation Theorems for ReLU Networks with Precise Dependence on Depth
Phase Transitions for Detecting Latent Geometry in Random Graphs
The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness
Universality of Computational Lower Bounds for Submatrix Detection
Stein's Method for Stationary Distributions of Markov Chains and Application to Ising Models
Learning Restricted Boltzmann Machines via Influence Maximization
Learning Tree-structured Ising Models in Order to Make Predictions
Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure
Regret Bounds and Regimes of Optimality for Item-item and User-user Collaborative Filtering


  • (617) 324-1549
  • 32-D672, 32 Vassar St., Cambridge, MA 02139