University of Cambridge > Talks.cam > Information Engineering Distinguished Lecture Series > From Diffusion Models to Schrödinger Bridges

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

From Diffusion Models to Schrödinger Bridges

Download to your calendar using vCal

If you have a question about this talk, please contact Kimberly Cole .

Diffusion models have revolutionized generative modeling. Conceptually, these methods define a transport mechanism from a noise distribution to a data distribution. Recent advancements have extended this framework to define transport maps between arbitrary distributions, significantly expanding the potential for unpaired data translation. However, existing methods often fail to approximate optimal transport maps, which are theoretically known to possess advantageous properties. In this talk, we will show how one can modify current methodologies to compute Schrödinger bridges—an entropy-regularized variant of dynamic optimal transport. We will demonstrate this methodology on a variety of unpaired data translation tasks.

This talk is part of the Information Engineering Distinguished Lecture Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Lecture Theatre 2 and 3, Judge Business School (http://www.jbs.cam.ac.uk/aboutus/location.html) Lecture Block Room 6, Sidgwick Site, Sidgwick Avenue, Cambridge Average on Sundays: 7468.80769231 kWh

Other talks

Reproducibility In Astrophysical Simulations: The AGORA Initiative and a 14-Year Human Experiment (In Memory of Joel Primack) Title and abstract tba Title to be confirmed Title to be confirmed The Inaccessible Game Pancreatic cancer - the clinical challenge;  Why the microenvironment matters during pancreatic cancer progression and treatment
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity