Optimal Transport Courses and Certifications

Finnish Center for Artificial Intelligence FCAI

Fast Geometric Libraries for Vision and Data Sciences

Explore fast geometric computations for point clouds, optimal transport, and shape analysis. Learn about efficient tools for vision and data sciences, with applications in medical imaging and beyond.

• YouTube
• 48 minutes
• Self-Paced
• Free Video

Valence Labs

Transport, Variational Inference and Diffusions

Explore connections between optimal transport and variational inference, focusing on stochastic differential equations and Girsanov transformations. Discover novel sampling and generative modeling techniques.

• YouTube
• 58 minutes
• Self-Paced
• Free Video

Valence Labs

A Computational Framework for Solving Wasserstein Lagrangian Flows

Explore a computational framework for solving Wasserstein Lagrangian flows, covering optimal transport variations and applications in single-cell trajectory inference.

• YouTube
• 1 hour 32 minutes
• Self-Paced
• Free Video

Centre International de Rencontres Mathématiques

On the Concave One-Dimensional Random Assignment Problem: Kantorovich Meets Young

Explore the concave one-dimensional random assignment problem, bridging Kantorovich and Young's theories in this mathematical conference talk by Dario Trevisan.

• YouTube
• 49 minutes
• Self-Paced
• Free Video

Paul G. Allen School

Statistical Applications of Wasserstein Gradient Flows

Explore statistical applications of Wasserstein gradient flows in optimal transport, covering Otto calculus, Riemannian structures, and applications to variational inference and Gaussian mixture models.

• YouTube
• 1 hour 1 minute
• Self-Paced
• Free Video

Applied Algebraic Topology Network

Trajectory Inference in Wasserstein Space

Explore advanced trajectory inference methods using Wasserstein geometry and B-spline approximation for analyzing dynamic processes in computational biology and point cloud data.

• YouTube
• 51 minutes
• Self-Paced
• Free Video

Conference GSI

The Total Variation Wasserstein Problem - A New Derivation of the Euler-Lagrange Equations

Explore a novel derivation of Euler-Lagrange equations for the Total Variation Wasserstein problem, advancing understanding in mathematical optimization and transport theory.

• YouTube
• 22 minutes
• Self-Paced
• Free Video

Hausdorff Center for Mathematics

Mass Decompositions of Currents

Explore the mathematical theory of expressing normal currents as averages of integral currents, with insights into mass-decomposed currents and connections to optimal transportation problems.

• YouTube
• 50 minutes
• Self-Paced
• Free Video

Institute for Pure & Applied Mathematics (IPAM)

Schrödinger Bridges: Old and New - Part 1

Delve into the mathematics of Schrödinger bridges with Tryphon Georgiou as he explores their theory, applications, and connection to concepts like relative entropy, likelihood estimation, and optimal mass transport.

• YouTube
• 1 hour 22 minutes
• Self-Paced
• Free Video

INI Seminar Room 2

Tree-Based Diffusion Schrödinger Bridge with Applications to Wasserstein Barycenters

Delve into advanced mathematical concepts of Tree-Based Diffusion Schrödinger Bridge and its applications in Multi-marginal Optimal Transport, focusing on high-dimensional settings and Wasserstein barycenters.

• YouTube
• 1 hour 17 minutes
• Self-Paced
• Free Video

Institute for Pure & Applied Mathematics (IPAM)

Gromov-Wasserstein Alignment: Statistics, Computation, and Geometry

Delve into the Gromov-Wasserstein problem for optimal alignment of metric measure spaces, exploring statistical convergence rates, computational tractability, and geometric applications in data alignment.

• YouTube
• 57 minutes
• Self-Paced
• Free Video

Institute for Pure & Applied Mathematics (IPAM)

Learning to Optimize Transport Plans

Dive into optimal transport distances and their regularized versions as tools for comparing probability measures, with a focus on amortized optimization for transport plans.

• YouTube
• 50 minutes
• Self-Paced
• Free Video

Institute for Pure & Applied Mathematics (IPAM)

Near-Linear Runtime for a Classical Matrix Preconditioning Algorithm

Dive into the theoretical advancements of Osborne's matrix balancing algorithm, exploring its near-linear runtime guarantees and connections to optimal transport problems in modern computational applications.

• YouTube
• 55 minutes
• Self-Paced
• Free Video

Fields Institute

Lipschitz Continuity of Diffusion Transport Maps and Exponential Convergence of Sinkhorn's Algorithm via Creation of Log-Semiconcavity Along Heat Flows

Explore advanced mathematical theory connecting diffusion transport maps' Lipschitz properties with Sinkhorn algorithm convergence through heat flow analysis.

• YouTube
• 30 minutes
• Self-Paced
• Free Video

Fields Institute

Worst-Case Generation via Minimax Optimization in Wasserstein Space

Explore minimax optimization techniques in Wasserstein space for worst-case generation problems through advanced optimal transport theory and stochastic projections.

• YouTube
• 33 minutes
• Self-Paced
• Free Video