Towards Plurality - Stability Bounds in Statistical Optimal Transport
Paul G. Allen School via YouTube
Become an AI & ML Engineer with Cal Poly EPaCE — IBM-Certified Training
AI, Data Science & Business Certificates from Google, IBM & Microsoft
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore stability bounds in statistical optimal transport theory in this 46-minute workshop presentation delivered by Sivaraman Balakrishnan from Carnegie Mellon University at the Paul G. Allen School. Delve into the mathematical foundations of optimal transport problems and examine how stability bounds provide crucial theoretical guarantees for statistical applications. Learn about the challenges of achieving plurality in optimal transport frameworks and discover recent advances in establishing robust stability results. Gain insights into the intersection of optimal transport theory, statistical analysis, and computational methods, with particular emphasis on how stability bounds impact the reliability and performance of optimal transport algorithms in practical statistical applications.
Syllabus
IFDS Workshop–Stability Bounds In Statistical Optimal Transport
Taught by
Paul G. Allen School