All talks are listed in Pacific Time. Schedule subject to change.

–
Coffee and Check In
–
Opening Remarks
–
The Complexity of Learning Generative Models

Sitan Chen (UC Berkeley)
–
Break
–
A Simple and Sharper Proof of the Hypergraph Moore Bound

Jun-Ting Hsieh (Carnegie Mellon University)
–
Break
–
Algorithmic Thresholds for Multi-Species Spin Glasses

Brice Huang (MIT)
–
Lunch
–
Statistical Efficiency of Score Matching: The View from Isoperimetry

Frederic Koehler (Stanford)
–
Break
–
Visioning Session
–
Light Reception
–
Coffee and Check In
–
Is It Easier to Count Communities Than Find Them?

Fiona Skerman (Uppsala University, Sweden)
–
Break
–
Optimality of AMP Among Low-Degree Polynomials

Alex Wein (UC Davis)
–
Break
–
Nearly Optimal Algorithms for Semirandom Planted Clique

Pravesh Kothari (Carnegie Mellon University)
–
Lunch
–
Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs

Chenghao Guo (MIT)
–
Break
–
Sudakov-Fernique Post-amp, and a New Proof of the Local Convexity of the Tap Free Energy

Michael Celentano (UC Berkeley)
–
Differential Privacy Versus Robustness: Black-Box Reductions and Efficient Algorithms

Sam Hopkins (MIT)
–
Break
–
Statistical-computational Tradeoffs in Tensor Learning

Anru Zhang (Duke University)
–
Break
–
Polynomial-Time Power-Sum Decomposition of Polynomials

Jeff Xu (CMU)
–
Break
–
Nearly Solving Intractable Problems via Mean-Field Convergence: Two Examples

Dheeraj Nagaraj (Google Research)
–
Lunch
–
Quantum Algorithms with Shallow Depth Probabilistic Properties and Algorithmic Barriers.

David Gamarnik (MIT)
–
Social Acitivity