All talk times are in Pacific Time. 

–
Opening Remarks
–
Tight Lipschitz Hardness for Optimizing Mean Field Spin Glasses
Mark Sellke (Stanford University)
–
Break
–
Convex Influences and a Quantitative Gaussian Correlation Inequality
Anindya De (University of Pennsylvania)
–
Lunch
–
Matching Correlated Random Graphs
Mark Rudelson (University of Michigan)
–
Break
–
The Brownian Transport Map
Dan Mikulincer (MIT)
–
Reception
–
Algorithmic Stochastic Localization for the Sherrington-Kirkpatrick Model
Ahmed El Alaoui (Cornell University)
–
Break
–
On Some New Estimates for Minimal Dispersion
Galyna Livshyts (Georgia Institute of Technology)
–
Lunch
–
The Johnson--Lindenstrauss Lemma for Clustering and Subspace Approximation
Erik Waingarten (Stanford University)
–
Break
–
Characterizing the Type 1-Type 2 Error Trade-off for SLOPE
Cynthia Rush (Columbia University)
–
Approximate Counting and Sampling via Local Central Limit Theorems
Vishesh Jain (Stanford University)
–
Break
–
Sparse Random Graphs With Unusually Large Subgraph Counts
Amir Dembo (Stanford University)
–
Lunch
–
Regression And Contextual Bandits With Huber Contamination
Frederic Koehler (MIT)
–
Break
–
Blaschke-Santalo Inequality for Many Functions and Geodesic Barycenters of Measures
Elisabeth Werner (Case Western Reserve University)
–
Testing Thresholds for High-Dimensional Sparse Random Geometric Graphs
Sidhanth Mohanty (UC Berkeley)
–
Break
–
Lower Bounds on Circuit Depth for the Largest Independent Set Problem
David Gamarnik (MIT)