University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Event-chain algorithms: taming randomness in Monte Carlo methods through irreversibility, factorization and lifting

Event-chain algorithms: taming randomness in Monte Carlo methods through irreversibility, factorization and lifting

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact info@newton.ac.uk.

SIN - Scalable inference; statistical, algorithmic, computational aspects

I will first present the irreversible and rejection-free Monte Carlo methods recently developed in Physics under the name Event-Chain. They have proven to produce clear acceleration over standard Monte Carlo methods, thanks to the reduction of their random-walk behavior. Their irreversible nature relies on three key ingredients: the factorized filter, the generalized lifting framework and the infinitesimal moves.  Then, I will focus on the new Forward Event-Chain version that allows to reduce the randomization needed for ergodicity, leading to a striking speed-up. Finally, I will explain how the factorized filter may be the key to subsampling in Monte Carlo methods.



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

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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