All talks are listed in Pacific Time. Please note some speakers may present remotely. Schedule subject to change.

–
Opening Remarks
–
Smoothed CSP Refutation Is As Easy As Random, For Both Efficient Algorithms And Certificates
Pravesh K. Kothari (Carnegie Mellon University)
–
Sum Of Squares Lower Bounds Versus Low-Degree Polynomial Lower Bounds
Aaron Potechin (University of Chicago)
–
Break
–
Planted Geometric Matching Problems
Dmitriy (Tim) Kunisky
–
Robust Parameter Estimation For Random Graphs
Jayadev Acharya (Cornell University)
–
Lunch
–
New Techniques For Proving Fine-Grained Average-Case Hardness
Andrea Lincoln (UC Berkeley)
–
Charting the Landscape of Memory/Data Tradeoffs in Continuous Optimization: A Survey of Open Problems
Gregory Valiant (Stanford University)
–
Break
–
Computational Barriers to Estimation from Low-Degree Polynomials
Tselil Schramm (Stanford University)
–
The Overlap Gap Property For Inference: Power And Limitations
Ilias Zadik (Massachusetts Institute of Technology)
–
Reception
–
Joint Session with EPFL
–
To Be (Hard) or Not Be: The Spiked Matrix-Tensor Model
Florent Krzakala (École polytechnique fédérale de Lausanne)
–
Are Generative Models The New Sparsity?
Bruno Loureiro (EPFL)
–
Break
–
A Few Simple Average-Case Reduction Techniques And Their Surprising Effectiveness
Guy Bresler (Massachusetts Institute of Technology)
–
Break
–
The Initial Search Phase Of Stochastic Gradient Descent For High-Dimensional Inference Tasks
Reza Gheissari (UC Berkeley)
–
Local Convexity Of The Tap Free Energy And Amp Convergence For Z2-Synchronization
Song Mei (UC Berkeley)
–
Lunch
–
Signal Recovery With Generative Priors
Paul Hand (Northeastern University)
–
All-or-Nothing Statistical and Computational Phase Transitions in Sparse Spiked Matrix Estimation
Cynthia Rush (Columbia University)
–
Joint Session with EPFL
–
Phase Retrieval In High Dimensions: Statistical And Computational Phase Transitions
Antoine Maillard (Ecole Normale Supérieure - Paris)
–
Mismatched Monte Carlo Algorithms For The Planted Clique Problem
Maria Chiara Angelini (Sapienza - Università di Roma)
–
Break
–
Putting Quantum Supremacy on a Rigorous Footing
Umesh Vazirani (UC Berkeley)
–
Break
–
Optimizing Noncommutative Polynomials: The SYK Model
Ryan O'Donnell (Carnegie Mellon University)
–
Lunch
–
The Algorithmic Phase Transition of Random k-SAT for Low Degree Polynomials
Brice Huang (Massachusetts Institute of Technology)
–
Tight Algorithmic Thresholds for Spin Glass Hamiltonians
Mark Sellke (Stanford University)
–
Joint Session with EPFL
–
Average-Case Hardness in Proof Complexity
Susanna F. de Rezende (Czech Academy of Sciences)
–
Break
–
Extractor-Based Approach To Memory-Sample Tradeoffs
Sumegha Garg (Harvard University)
–
Break
–
Optimal Spectral Recovery Of A Planted Vector In A Subspace
Alexander Wein (UC Berkeley)
–
Refutation and Spectrally Quiet Planting of Cuts and Colorings in Random Graphs
Jess Banks (UC Berkeley)
–
Lunch
–
Differential Privacy And The Complexity Of Simple Queries
Jonathan Ullman (Northeastern University)
–
The Estimation Error of General First Order Methods
Michael Celentano (UC Berkeley)
–
Non-Gaussian Component Analysis: Statistical Query Hardness and its Applications
Ilias Diakonikolas (University of Wisconsin-Madison)
–
SQ Lower Bounds for Learning Halfspaces with Massart Noise
Daniel Kane (UC San Diego)
–
Break
–
Towards Lower Bounds for Efficient Robust Estimation From Worst Case Assumptions
Jerry Li (Microsoft Research)
–
Computational Barriers For Learning Some Generalized Linear Models
Surbhi Goel (Microsoft Research NY)
–
Lunch
–
Group Hike with Michael Celentano