Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling

27 September 2021

Papers citing "Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling"

8 / 8 papers shown

Title
Convergence Analysis of the Wasserstein Proximal Algorithm beyond Geodesic Convexity Shuailong Zhu Xiaohui Chen 65 0 0 28 Jan 2025
Score-Based Metropolis-Hastings Algorithms Ahmed Aloui Ali Hasan Juncheng Dong Zihao Wu Vahid Tarokh DiffM 34 0 0 31 Dec 2024
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 17 8 0 05 Apr 2023
Nesterov smoothing for sampling without smoothness JiaoJiao Fan Bo Yuan Jiaming Liang Yongxin Chen 17 2 0 15 Aug 2022
Scalable Bayesian computation for crossed and nested hierarchical models O. Papaspiliopoulos Timothée Stumpf-Fétizon Giacomo Zanella 18 7 0 19 Mar 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
MCMC using Hamiltonian dynamics Radford M. Neal 130 3,260 0 09 Jun 2012