Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the Prokhorov Theorem in the context of Optimal Transport, discussing the concept of relatively compact sets, tightness, and narrow convergence. The instructor explains the conditions for c-cyclical monotonicity and provides a heuristic approach for optimality. The lecture emphasizes the importance of support sets and rigorous definitions in proving optimality conditions.