This workshop is being live streamed on our website. Full participation (including the capacity to ask questions) will be available via Zoom webinar. 

All talk times are in Pacific Time. 

–
Opening Remarks
–
Counting Solutions to Random CNF Formulas
Leslie Ann Goldberg, University of Oxford
–
Break
–
Testing Correlation of Unlabeled Random Graphs
Jiaming Xu, Duke University
–
Break
–
Local Statistics, Semidefinite Programming, and Community Detection
Jess Banks, UC Berkeley
–
Local Statistics, Semidefinite Programming, and Community Detection II
Sidhanth Mohanty, UC Berkeley
–
Break
–
Incremental Approximate Message Passing
Ahmed El Alaoui, Stanford University
–
Social Hour
–
Introductions
–
Equitable Colorings
Afonso Bandeira, NYU
–
Break
–
A Positivity-First Approach to Sum-of-Squares Over the Hypercube
Tim Kunisky, NYU
–
Break
–
Phase Retrieval in High Dimensions: Statistical and Computational Phase Transitions
Florent Krzakala, ENS
–
Break
–
Open Problems Session
–
Social Hour
–
Introductions
–
Optimization of Full-RSB Spherical Spin Glasses
Eliran Subag, Courant
–
Break
–
Thresholds of Descending Algorithms in Inference Problems
Stefano Sarao Mannelli, IPhT CEA-Saclay
–
Break
–
The Sum-of-Squares Approach to Clustering Non-Spherical Gaussian Mixtures
Pravesh Kothari, CMU
–
Break
–
Information/Computation Gaps in Heavy-Tailed Statistics
Sam Hopkins, UC Berkeley
–
Break
–
Pedagogical Talk: Random Optimisation Problems
Amin Coja-Oghlan, Goethe University
–
Social Hour
–
Introductions
–
Correlation Decay for Hard Spheres via Markov Chains
Samantha Petti, Harvard
–
Break
–
Sampling From the Random Cluster Model at All Temperatures on Random Graphs
Will Perkins, University of Illinois at Chicago
–
Break
–
The Rank of Sparse Random Matrices
Jane Gao, University of Waterloo
–
Break
–
Pedagogical Talk: Failure of Low-Degree Polynomials
Alex Wein, NYU
–
Social Hour
–
Introductions
–
The Overlap Gap Property in Principal Submatrix Recovery
Subhabrata Sen, Harvard
–
Break
–
Free Energy Wells and Overlap Gap Property in Sparse PCA
Ilias Zadik, NYU
–
Break
–
Reducibility and Statistical-Computational Gaps from Secret Leakage
Guy Bresler, MIT
–
Break
–
Pedagogical Talk: Frameworks for Information-Computation Tradeoffs
Tselil Schramm, Stanford University
–
Social Hour