Improved dimension dependence of a proximal algorithm for sampling

20 February 2023

Papers citing "Improved dimension dependence of a proximal algorithm for sampling"

9 / 9 papers shown

Title
Convergence Analysis of the Wasserstein Proximal Algorithm beyond Geodesic Convexity Shuailong Zhu Xiaohui Chen 72 0 0 28 Jan 2025
Query lower bounds for log-concave sampling Sinho Chewi Jaume de Dios Pont Jerry Li Chen Lu Shyam Narayanan 27 8 0 05 Apr 2023
Nesterov smoothing for sampling without smoothness JiaoJiao Fan Bo Yuan Jiaming Liang Yongxin Chen 32 2 0 15 Aug 2022
A Proximal Algorithm for Sampling from Non-convex Potentials Jiaming Liang Yongxin Chen 21 4 0 20 May 2022
Private Convex Optimization via Exponential Mechanism Sivakanth Gopi Y. Lee Daogao Liu 65 51 0 01 Mar 2022
Variational Wasserstein gradient flow JiaoJiao Fan Qinsheng Zhang Amirhossein Taghvaei Yongxin Chen 68 54 0 04 Dec 2021
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 25 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