Improved dimension dependence of a proximal algorithm for sampling

20 February 2023

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

12 / 12 papers shown

Title
Mixing Time of the Proximal Sampler in Relative Fisher Information via Strong Data Processing Inequality Andre Wibisono 53 1 0 08 Feb 2025
Convergence Analysis of the Wasserstein Proximal Algorithm beyond Geodesic Convexity Shuailong Zhu Xiaohui Chen 77 0 0 28 Jan 2025
Principled Probabilistic Imaging using Diffusion Models as Plug-and-Play Priors Zihui Wu Yu Sun Yifan Chen Bingliang Zhang Yisong Yue Katherine L. Bouman DiffM 29 20 0 29 May 2024
Proximal Oracles for Optimization and Sampling Jiaming Liang Yongxin Chen 31 3 0 02 Apr 2024
Query lower bounds for log-concave sampling Sinho Chewi Jaume de Dios Pont Jerry Li Chen Lu Shyam Narayanan 32 8 0 05 Apr 2023
Nesterov smoothing for sampling without smoothness JiaoJiao Fan Bo Yuan Jiaming Liang Yongxin Chen 37 2 0 15 Aug 2022
A Proximal Algorithm for Sampling from Non-convex Potentials Jiaming Liang Yongxin Chen 28 4 0 20 May 2022
Private Convex Optimization via Exponential Mechanism Sivakanth Gopi Y. Lee Daogao Liu 81 52 0 01 Mar 2022
Variational Wasserstein gradient flow JiaoJiao Fan Qinsheng Zhang Amirhossein Taghvaei Yongxin Chen 72 54 0 04 Dec 2021
Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling Keru Wu S. Schmidler Yuansi Chen 39 50 0 27 Sep 2021
Unadjusted Langevin algorithm for non-convex weakly smooth potentials D. Nguyen Xin Dang Yixin Chen 27 14 0 16 Jan 2021
Convergence of Langevin Monte Carlo in Chi-Squared and Renyi Divergence Murat A. Erdogdu Rasa Hosseinzadeh Matthew Shunshi Zhang 86 41 0 22 Jul 2020