Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2210.08448
Cited By
Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling
16 October 2022
Jason M. Altschuler
Kunal Talwar
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling"
6 / 6 papers shown
Title
When does Metropolized Hamiltonian Monte Carlo provably outperform Metropolis-adjusted Langevin algorithm?
Yuansi Chen
Khashayar Gatmiry
78
15
0
10 Apr 2023
Query lower bounds for log-concave sampling
Sinho Chewi
Jaume de Dios Pont
Jerry Li
Chen Lu
Shyam Narayanan
19
8
0
05 Apr 2023
Fisher information lower bounds for sampling
Sinho Chewi
P. Gerber
Holden Lee
Chen Lu
27
15
0
05 Oct 2022
Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling
Keru Wu
S. Schmidler
Yuansi Chen
34
50
0
27 Sep 2021
Unadjusted Langevin algorithm for non-convex weakly smooth potentials
D. Nguyen
Xin Dang
Yixin Chen
19
14
0
16 Jan 2021
Convergence of Langevin Monte Carlo in Chi-Squared and Renyi Divergence
Murat A. Erdogdu
Rasa Hosseinzadeh
Matthew Shunshi Zhang
73
41
0
22 Jul 2020
1