BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//prima-2022//speaker calendar//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZOME
TZID:America/Vancouver
TZURL:http://tzurl.org/zoneinfo-outlook/America/Vancouver
X-LIC-LOCATION:America/Vancouver
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP;TZID=America/Vancouver:20221210T110000
DTSTART;TZID=America/Vancouver:20221210T110000
DTEND;TZID=America/Vancouver:20221210T112000

UID:20221210T110000@prima2022.primamath.org
SUMMARY:Asymptotics of Discrete Schrödinger Bridges via Chaos Decomposition
DESCRIPTION:Consider the problem of matching two independent sets of $N$ i.i.d. observations from two densities $\rho_0$ and $\rho_1$ in $\mathbb{R}^d$. For an arbitrary continuous cost function, the optimal assignment problem looks for the matching that minimizes the total cost. We consider instead the problem where each matching is endowed with a Gibbs probability weight proportional to the exponential of the negative total cost of that matching. Viewing each matching as a joint distribution with $N$ atoms, we then take a convex combination with respect to the above Gibbs probability measure. We show that this resulting random joint distribution converges, as $N\rightarrow \infty$, to the solution of a variational problem, introduced by Föllmer, called the Schrödinger problem. Finally, we prove limiting Gaussian fluctuations for this convergence in the form of Central Limit Theorems for integrated test functions. This is enabled by a novel chaos decomposition for permutation symmetric statistics, generalizing the Hoeffding decomposition for U-statistics. Our results establish a novel passage for the transition from discrete to continuum in Schrödinger's lazy gas experiment.
STATUS:CONFIRMED
LOCATION:Online
END:VEVENT
END:VCALENDAR
