University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > SDE sampling algorithms for bounded domains, constraints and noisy gradients

  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

SDE sampling algorithms for bounded domains, constraints and noisy gradients

Download to your calendar using vCal

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

DDEW03 - Computational Challenges and Emerging Tools

I will discuss sampling procedures based on discretized stochastic differential equations for a wide range of applications in physical modelling and data science. In this talk I will cover accurate weak approximation methods for domains with boundary and constraint manifolds. I will also discuss the problem of sampling systems driven by noisy gradients, as arise in many Bayesian inversion problems.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Seminar Room 5, Clinical School, Addenbrooke's Webinar & FW11, Computer Laboratory, William Gates Building. Cookipauto

Other talks

Morning Break Kirk Public Lecture: Title TBC Machine Learning for Spectral Geometry and Vice Versa Group Work Title to be confirmed  Life, death, and the discovery of PDAR: the Pol II Degradation-dependent Apoptotic Response 
 

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