The query complexity of sampling from strongly log-concave distributions in one dimension

29 May 2021

Papers citing "The query complexity of sampling from strongly log-concave distributions in one dimension"

7 / 7 papers shown

Title
Mixing Time of the Proximal Sampler in Relative Fisher Information via Strong Data Processing Inequality Andre Wibisono 47 1 0 08 Feb 2025
Query lower bounds for log-concave sampling Sinho Chewi Jaume de Dios Pont Jerry Li Chen Lu Shyam Narayanan 29 8 0 05 Apr 2023
Convergence Rates for Non-Log-Concave Sampling and Log-Partition Estimation David Holzmüller Francis R. Bach 29 8 0 06 Mar 2023
Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling Jason M. Altschuler Kunal Talwar 27 24 0 16 Oct 2022
Fisher information lower bounds for sampling Sinho Chewi P. Gerber Holden Lee Chen Lu 43 15 0 05 Oct 2022
Towards a Theory of Non-Log-Concave Sampling: First-Order Stationarity Guarantees for Langevin Monte Carlo Krishnakumar Balasubramanian Sinho Chewi Murat A. Erdogdu Adil Salim Matthew Shunshi Zhang 35 60 0 10 Feb 2022
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