ResearchTrend.AI
Contraction and Convergence Rates for Discretized Kinetic Langevin Dynamics

Contraction and Convergence Rates for Discretized Kinetic Langevin Dynamics

Benedict Leimkuhler
Daniel Paulin
Peter Whalley
ArXivPDFHTML

Papers citing "Contraction and Convergence Rates for Discretized Kinetic Langevin Dynamics"

6 / 6 papers shown
Title
A Langevin sampling algorithm inspired by the Adam optimizer
A Langevin sampling algorithm inspired by the Adam optimizer
Benedict Leimkuhler
René Lohmann
Peter Whalley
100
0
0
26 Apr 2025
On the query complexity of sampling from non-log-concave distributions
On the query complexity of sampling from non-log-concave distributions
Yuchen He
Chihao Zhang
59
1
0
10 Feb 2025
Random Reshuffling for Stochastic Gradient Langevin Dynamics
Luke Shaw
Peter A. Whalley
123
3
0
28 Jan 2025
Sampling from Bayesian Neural Network Posteriors with Symmetric Minibatch Splitting Langevin Dynamics
Sampling from Bayesian Neural Network Posteriors with Symmetric Minibatch Splitting Langevin Dynamics
Daniel Paulin
Peter Whalley
Neil K. Chada
Benedict Leimkuhler
BDL
62
4
0
14 Oct 2024
Non-asymptotic error bounds for scaled underdamped Langevin MCMC
Non-asymptotic error bounds for scaled underdamped Langevin MCMC
T. Zajic
11
2
0
06 Dec 2019
Bounding the error of discretized Langevin algorithms for non-strongly log-concave targets
Bounding the error of discretized Langevin algorithms for non-strongly log-concave targets
A. Dalalyan
Avetik G. Karagulyan
L. Riou-Durand
40
38
0
20 Jun 2019

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.