Optimal Transport Seminar

Organizers: Chris Gartland & Kevin McGoff

Overview: This Fall 2025 seminar will cover a broad range of topics related to optimal transport, determined by the interests of the participants. There will be an emphasis on expository talks, and graduate students are encouraged to attend and to give talks. We will typically meet weekly on Fridays at 3:00pm, location Fretwell 302. References for external reading are also provided.

External Reading:

Upcoming Talk:

  • Friday Sept 19, 2025
  • Time: 3:00pm
  • Location: Fret 302
  • Speaker: Helen Li
  • Title: Condition number of Hessian of Entropy-Regularized OT and other types of modified optimal transport problem.
  • Abstract: I will begin by discussing the condition number for the benchmark example of equally spaced points on the unit circle, and then pose questions related to datasets consisting of random samples. I will also explain the main ideas and results from  https://arxiv.org/abs/2107.12364. Next, I will turn to other types of modified optimal transport with improved regularity properties, focusing in particular on unbalanced OT. For this part, I will primarily follow the results presented in https://arxiv.org/pdf/2211.08775 

Full Schedule:

  • Friday Nov 14, 2025
  • Time: 3:00pm
  • Location: Fret 302
  • Speaker: Helen Li
  • Friday Oct 24, 2025
  • Time: 3:00pm
  • Location: Fret 302
  • Speaker: Phuong Hoang
  • Title: Optimal Graph Joining with Applications to Isomorphism Detection and Identification
  • Abstract: We introduce and develop a new constrained optimal transport problem for graphs, called the optimal graph joining (OGJ) problem, and study its relation to graph isomorphism. The graphs of interest are finite, undirected, and may be weighted and labeled. Extending the idea of probabilistic couplings to the setting of graphs, we first introduce the notion of a graph joining of two graphs G and H, which is a graph K on the product of the vertex sets of G and H that has G and H as marginals in an appropriate sense. Given two graphs and a vertex-based cost function, OGJ aims to find a graph joining that minimizes the expected cost. After establishing the basic properties of the OGJ problem, we provide theoretical results connecting the OGJ problem to the graph isomorphism problem. In particular, we provide a variety of sufficient conditions on graph families under which OGJ detects and identifies isomorphisms between graphs within the family.
  • Friday Sept 26, 2025
  • Time: 3:00pm
  • Location: Fret 302
  • Speaker: Kevin McGoff
  • Title: Optimal transport in ergodic theory and dynamical systems
  • Abstract: In this expository talk, I will provide an introduction to the use of optimal transport in the setting of ergodic theory and dynamical systems. In this setting it is natural to consider a constrained set of couplings that respect the dynamics, called joinings. Originally introduced by Furstenberg in 1967, joinings have proved to be an influential and powerful tool for studying stationary dynamics. I will describe the setting, define joinings, and describe some of the ways that optimal transport has made an impact. No prior knowledge of dynamical systems will be assumed.
  • Friday Sept 19, 2025
  • Time: 3:00pm
  • Location: Fret 302
  • Speaker: Helen Li
  • Title: Condition number of Hessian of Entropy-Regularized OT and other types of modified optimal transport problem.
  • Abstract: I will begin by discussing the condition number for the benchmark example of equally spaced points on the unit circle, and then pose questions related to datasets consisting of random samples. I will also explain the main ideas and results from  https://arxiv.org/abs/2107.12364. Next, I will turn to other types of modified optimal transport with improved regularity properties, focusing in particular on unbalanced OT. For this part, I will primarily follow the results presented in https://arxiv.org/pdf/2211.08775 
  • Friday Sept 12, 2025
  • Time: 2:30pm
  • Location: Fret 302
  • Speaker: Helen Li
  • Title: Robust Numerical Differentiation for Entropy-regularized Optimal Transport (EOT) with application to Shuffled Regression
  • Abstract: In this presentation, I will begin by introducing shuffled regression and entropic optimal transport (EOT) as one possible approach. I will then discuss the derivatives of EOT, provide a brief overview of numerical condition numbers, and explain how to compute them robustly. I will present an example of shuffled regression that could serve as a potential benchmark for future numerical algorithm comparisons. Finally, I would like to discuss future work, extensions, and possible collaborations among the audience.
  • Friday Sept 5, 2025
  • Time: 2:30pm
  • Location: meet at Fret 302, but may have to move if room is taken
  • Speaker: Chris Gartland
  • Title: Introduction to Wasserstein Metrics
  • Abstract: I will give an introductory talk defining Wasserstein-p metrics, mostly focused on p=1. Basic properties and interesting questions will be discussed.