Keynote Talk : Optimal transport for machine learning

Abstract:

Optimal transport (OT) (a.k.a Wasserstein distance) has been the subject of significant interest in the past decade from themachine learning community.  Due to its geometrical properties, OT is naturally the go-to tool in several applications in transfer learning, domain adaptation, computer graphics, medical imaging and generative diffusion models. It has been the focus of different Communities: in economics (Kantorovich, Nobel prize 1975), mathematics and statistics (C. Villani and Figalli Fields medal 2010, 2018), physics (Schrodinger 1932) and now machine learning. In this tutorial, I will give an overview of Optimal transport, from the historical Monge problem to its trending entropy regularization. The focus will be on practical aspects of OT and its applications in machine learning and signal processing. 

Dates

March 1st ,2025

Abstract submission deadline

March 8th ,2025

Paper submission deadline

April 14th ,2025

Accept/Reject notification

May 21-23 ,2025

Netys Conference

Proceedings

Revised selected papers will be published as a post-proceedings in Springer's LNCS "Lecture Notes in Computer Science"

Parteners & Sponsors (TBA)