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-WR-CALNAME:Département de mathématiques et applications
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:20260329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20261025T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20260409T124500
DTEND;TZID=Europe/Paris:20260409T134500
DTSTAMP:20260409T014659
CREATED:20260326T102406Z
LAST-MODIFIED:20260326T102534Z
UID:21172-1775738700-1775742300@www.math.ens.psl.eu
SUMMARY:ENS-Data Science colloquium - Michael Chertkov : Samples That Cooperate\, Samples That Remember: Two Exactly Solvable Bridge Diffusions
DESCRIPTION:Diffusion-based generative models treat samples as independent and memoryless. I will show that relaxing each assumption leads to rich\, exactly solvable physics — with no neural networks anywhere.Giving samples a present — coupling them through their evolving mean field — produces a McKean–Vlasov optimal transport problem whose self-consistent guidance is provably the linear interpolant between endpoint means\, for arbitrary distributions and any interaction schedule; applied to building-fleet demand response\, this saves 20%+ in actuation energy.Giving samples a past produces a continual-learning agent whose memory is a Bridge Diffusion and whose forgetting — arising from a single lossy temporal coarse-graining step — obeys a universal linear capacity law with a Shannon-like constant.Both constructions live in the world of Riccati equations\, hyperbolic functions\, and mixture linear algebra; the physics of the bridge — not the expressivity of a network — controls what is achievable. \n\n\n\n  \n\n\n\nThese seminars are being made possible through the support of the CFM-ENS Chair « Modèles et Sciences des Données ». \n\n\n\nThe organizers: Giulio Biroli\, Alex Cayco Gajic\, Bruno Loureiro\, Stéphane Mallat\, Gabriel Peyré.
URL:https://www.math.ens.psl.eu/evenement/ens-data-science-colloquium-michael-chertkov-samples-that-cooperate-samples-that-remember-two-exactly-solvable-bridge-diffusions/
LOCATION:ENS Salle Dussane
CATEGORIES:ENS-Data Science colloquium
END:VEVENT
END:VCALENDAR