BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CREST - ECPv5.1.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CREST
X-ORIGINAL-URL:https://crest.science
X-WR-CALDESC:Events for CREST
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20211031T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210301T140000
DTEND;TZID=Europe/Paris:20210301T151500
DTSTAMP:20260712T090332
CREATED:20210121T084416Z
LAST-MODIFIED:20210121T084416Z
UID:12515-1614607200-1614611700@crest.science
SUMMARY:Gabriel PEYRÉ (CNRS\, ENS) - "Scaling Optimal Transport for High dimensional Learning "
DESCRIPTION:\nStatistical Seminar: Every Monday at 2:00 pm.\nTime: 2:00 pm – 3:15 pm\nDate: 1st of March 2021\nPlace: Visio\nGabriel PEYRÉ (CNRS\, ENS) – “Scaling Optimal Transport for High dimensional Learning ” \nAbstract: Optimal transport (OT) has recently gained lot of interest in machine learning. It is a natural tool to compare in a geometrically faithful way probability distributions. It finds applications in both supervised learning (using geometric loss functions) and unsupervised learning (to perform generative model fitting). OT is however plagued by the curse of dimensionality\, since it might require a number of samples which grows exponentially with the dimension. In this talk\, I will explain how to leverage entropic regularization methods to define computationally efficient loss functions\, approximating OT with a better sample complexity. More information and references can be found on the website of our book “Computational Optimal Transport” https://optimaltransport.github.io/ \nOrganizers:\nCristina BUTUCEA (CREST)\, Alexandre TSYBAKOV (CREST)\, Karim LOUNICI (CMAP) \, Zoltan SZABO (CMAP)\nSponsors:\nCREST-CMAP\n \n\n
URL:https://crest.science/event/gabriel-peyre/
CATEGORIES:Statistics
ATTACH;FMTTYPE=:
END:VEVENT
END:VCALENDAR