BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Département de mathématiques et applications - ECPv6.2.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.math.ens.psl.eu
X-WR-CALDESC:évènements pour Département de mathématiques et applications
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20240331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20241027T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20240206T093000
DTEND;TZID=Europe/Paris:20240206T123000
DTSTAMP:20260426T225645
CREATED:20230830T100826Z
LAST-MODIFIED:20240129T073949Z
UID:16723-1707211800-1707222600@www.math.ens.psl.eu
SUMMARY:Optimal Transport for PDEs and Machine Learning
DESCRIPTION:Optimal transport (OT) has recently gained significant interest in statistics and machine learning. It serves as a natural tool for comparing probability distributions in a geometrically faithful manner. However\, OT faces challenges due to the curse of dimensionality\, as it may require a sample size that grows exponentially with the dimension. This seminar will be divided into two parts: \n\nA tutorial on optimal transport\, where I will review the Monge and Kantorovich formulations\, and their connection to gradient flow PDEs via the minimizing movement scheme.\nA more advanced discussion on entropic regularization and the Schrödinger problem\, which improves both the numerical complexity of computing OT and the ability to approximate OT with better sample complexity in high dimensions.\n\nFor more information and references\, please visit the website of our book ‘Computational Optimal Transport’ at https://optimaltransport.github.io/.
URL:https://www.math.ens.psl.eu/evenement/gabriel-peyre/
LOCATION:Jussieu —  salle 15-16-309\, 4 Place Jussieu\, Paris\, 75005\, France
CATEGORIES:Séminaire Analyse non linéaire et EDP
END:VEVENT
END:VCALENDAR