All times are listed in Pacific Time.

–
Coffee and Check-In
–
Opening Remarks
–
Singular Limits for Vlasov Equations via Kinetic-Type Wasserstein Distances
Mikaela Iacobelli (ETH Zurich)
–
The (Non-Convex) Optimal Uniform Quantization Problem
Quentin Mérigot (Université Paris-Saclay)
–
Break
–
Nonlocal Interaction Equation on Graphs: Gradient Flow Structure and Continuum Limit
Antonio Esposito (Friedrich-Alexander University Erlangen-Nürnberg)
–
Nonlocal Wasserstein Distance and the Associated Gradient Flows
Dejan Slepčev (Carnegie Mellon Univeristy)
–
Lunch
–
A Duality Approach for Entropic-Regularized Optimal Transport: Sinkhorn Algorithm and Applications to Generative Models
Augusto Gerolin (University of Ottawa)
–
The Most Likely Evolution of Diffusing and Vanishing Particles in the Spirit of E. Schroedinger: Constructing Bridges With Unbalanced Marginals
Tryphon Georgiou (UC Irvine)
–
Break
–
Training Wasserstein Generative Adversarial Networks Without Gradient Penalties
Dohyun Kwon (University of Wisconsin, Madison)
–
Reception
–
Coffee and Check-In
–
An Optimal Transport Problem With Bulk/Interface Interactions
Léonard Monsaingeon (University of Lorraine and University of Lisbon)
–
Dissipative Evolution of Probability Measures
Giuseppe Savaré (Bocconi University)
–
Break
–
Sampling via Birth-Death Dynamics
Yulong Lu (University of Massachusetts, Amherst)
–
Latest Results on Birth-Death Dynamics
Lihan Wang (Carnegie Mellon University)
–
Lunch
–
Optimal Transport for Learning Chaotic Dynamics via Invariant Measures
Yunan Yang (Simons Institute)
–
Hessian Informed Mirror Descent With Application in Gradient Flows
Li Wang (University of Minnesota)
–
Break
–
Uniform Convergence Rates for Lipschitz Learning Down to Graph Connectivity
Jeff Calder (University of Minnesota)
–
Coffee and Check-In
–
Optimal Transport With Stopping Times and the Stefan Problem
Inwon Kim (UCLA)
–
The Singular Set in the Stefan Problem
Alessio Figalli (ETH Zurich)
–
Break
–
Global Well Posedness of Master Equations Mean Field Games
Wilfrid Gangbo (UCLA)
–
Wasserstein GANs Work Because They Fail (to Approximate the Wasserstein Distance)
Jan Stanczuk (University of Cambridge)
–
Lunch
–
Open Discussion (In-Person Only)
–
Coffee and Check-In
–
Linearised Optimal Transport Distances
Matthew Thorpe (University of Manchester)
–
Archetypal Analysis
Braxton Osting (University of Utah)
–
Break
–
Mean-Field Theory of Two-Layers Neural Networks: Dimension Free Bounds and Example
Theodor Misiakiewicz (Stanford University)
–
Continuous Time Stochastic Gradient Descent and Flat Minimum Selection
Stephan Wojtowytsch (Texas A&M)
–
Lunch
–
Consensus Based Sampling
Franca Hoffmann (University of Bonn)
–
Sampling From Wasserstein Barycenter
Thibaut Le Gouic (Ecole Centrale de Marseille)
–
Break
–
Extending the JKO Scheme Beyond Wasserstein-2 Gradient Flows
Matthew Jacobs (UCLA)
–
Coffee and Check-In
–
Deterministic Particle Approximation for Nonlocal Transport Equations
Emanuela Radici (École Polytechnique Fédérale de Lausanne)
–
A Particle Method for Degenerate Diffusion, and Applications to Robotic Swarming
Olga Turanova (Michigan State University)
–
Break
–
How to Train Better: Exploiting the Separability of DNNs
Lars Ruthotto (Emory University), Elizabeth Newman (Emory University)
–
Mirror Descent Algorithms for Minimizing Interacting Free Energy
Lexing Ying (Stanford University)
–
Lunch
–
Learning Interaction Kernels in Stochastic Systems of Interacting Particles from Multiple Trajectories
Sui Tang (UC Santa Barbara)
–
Discrete-To-Continuum Limits of Dynamical Optimal Transport Problems
Lorenzo Portinale (Hausdorff Center of Mathematics, Bonn)
–
Density Control of Interacting Agent Systems
Yongxin Chen (Georgia Institute of Technology)