Entropic Selection Principle for Monge's Optimal Transport
University of Chicago Department of Mathematics via YouTube
Become an AI & ML Engineer with Cal Poly EPaCE — IBM-Certified Training
2,000+ Free Courses with Certificates: Coding, AI, SQL, and More
Overview
AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
Explore the convergence of entropically regularized optimal transport (EOT) to classical Monge optimal transport in this 57-minute lecture by Promit Ghosal from the University of Chicago. Delve into the challenges of understanding small-regularization limits, particularly in dimensions greater than one. Learn how concepts from optimal transport, geometry, and large deviations theory can quantify local exponential convergence of entropic optimizers and characterize large deviation rate functions using Kantorovich potential. The lecture introduces a novel selection principle for Monge transport plans with Euclidean distance cost and absolutely continuous marginals, demonstrating how the limiting plan is supported on transport rays and uniquely determined by minimizing a relative entropy functional. This mathematical exploration resolves an open problem in higher dimensions through a complete variational characterization of limiting transport plans.
Syllabus
Entropic Selection Principle for Monge’s Optimal Transport - Promit Ghosal (University Of Chicago)
Taught by
University of Chicago Department of Mathematics