COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Statistics > On the hypocoercivity of some PDMP-Monte Carlo algorithms
On the hypocoercivity of some PDMP-Monte Carlo algorithmsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Dr Sergio Bacallado. Monte Carlo methods based on Piecewise Deterministic Markov Processes (PDMP) have recently received some attention. In this talk we discuss (exponential) convergence to equilibrium for a broad sub-class of PDMP -MC, covering Randomized Hamiltonian Monte Carlo, the Zig-Zag process and the Bouncy Particle Sampler as particular cases, establishing hypocoercivity under fairly weak conditions and explicit bounds on the spectral gap in terms of the parameters of the dynamics. This allows us, for example, to discuss dependence of this gap on the dimension of the problem for some classes of target distributions. arXiv:1808.08592 (joint work with Alain Durmus, Nikolas Nüsken, Julien Roussel) This talk is part of the Statistics series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsBeyond Profit Algebra Type the title of a new list hereOther talks"Knowledge-that and knowledge-how: the politics of tackling health inequalities in South Korea" Relative kappa-classes Past, present and future of Drosophila Research REAL WORLD DRIVING EMISSIONS AROUND CAMBRIDGE AND LONDON CAN HIGH TECHNOLOGY PRODUCTS BE SUSTAINABLE? HONORARY FELLOWS LECTURE - The Fuel of Life |