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 > Isaac Newton Institute Seminar Series > Langevin Monte Carlo Beyond Lipschitz Gradient Continuity
Langevin Monte Carlo Beyond Lipschitz Gradient ContinuityAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact nobody. SSD - Stochastic systems for anomalous diffusion We present a significant advancement in the field of Langevin Monte Carlo (LMC) methods by introducing the Inexact Proximal Langevin Algorithm (IPLA). This novel algorithm broadens the scope of problems that LMC can effectively address while maintaining controlled computational costs. IPLA extends LMC ’s applicability to potentials that are convex, strongly convex in the tails, and exhibit polynomial growth, beyond the conventional $L$-smoothness assumption. Moreover, we extend LMC ’s applicability to super-quadratic potentials and offer improved convergence rates over existing algorithms. Additionally, we provide bounds on all moments of the Markov chain generated by IPLA , enhancing its analytical robustness. The talk is based on joint work with Matej Benko, Iwona Chlebicka, Jorgen Endal. 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 listsDoble riotType the title of a new list hereDouble FERSA Workshops Denise SchofieldOther talksFriction damping in structural dynamics: from fundamental understanding to physics-based machine learning identification Practical Functional Oxide Thin Films for Electronic Devices Exploring What Works in Science Communication; Experiments and Evidence Camouflage and Sleep, two behaviors to study brain evolution BSU Seminar: "Personalized Decision-Making for Infectious Disease Control: Causal Inference and Complex Dependence" |