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

–
Coffee and Check In
–
Opening Remarks
–
Opening Remarks
–
The Restricted Gaussian Oracle as a Proximity Operator for Sampling

Adil Salim (KAUST)
–
Convergence in KL Divergence of the Inexact Langevin Algorithm with Application to Score-based Generative Models

Andre Wibisono (Yale University)
–
Break
–
Quantization of Measures via Interacting Particle-based Optimization

Dejan Slepcev (Carnegie Mellon University)
–
Lunch
–
High-dimensional Scaling Limits of Least-square Online SGD Iterates and Its Fluctuations

Krishnakumar Balasubramanian (UC Davis)
–
Lower Bounds for Sampling: Dimension Two and Gaussians

Sinho Chewi (Massachusetts Institute of Technology)
–
Break
–
Reception
–
Coffee and Check In
–
Feature Learning in Two-layer Neural Networks

Murat Erdogdu (University of Toronto)
–
Score-based Generative Modeling: Convergence Theory

Holden Lee (Duke University)
–
Break
–
TBA

Augusto Gerolin (Vrije Universiteit Amsterdam)
–
Lunch
–
The Ensemble Kalman Filter in the Near-Gaussian Setting

Franca Hoffmann (University of Bonn)
–
Geometric Methods in Private Convex Optimization

Kevin Tian (Stanford University)
–
Break + Discussion
–
Coffee and Check In
–
Geometry Aware Exploratory Data Analysis

Paromita Dubey (Stanford)
–
A Proximal Algorithm for Sampling

Yongxin Chen (Georgia Institute of Technology)
–
Break
–
Analysis of Adversarial Robustness and of Other Problems in Modern Machine Learning

Nicolas Garcia Trillos (University of Wisconsin Madison)
–
Lunch
–
The Geometry of Adversarial Training - Nonlocal Regularization and Gamma-Convergence

Leon Bungert (University of Bonn)
–
TBA

Aram-Alexandre Pooladian (New York University)
–
Break + Discussion