{"total":17,"rows":[{"id":"2202.06386","title":"Improved analysis for a proximal algorithm for sampling","created":"2022-02-13","cited_by_count":73,"area":null},{"id":"2202.05214","title":"Towards a Theory of Non-Log-Concave Sampling: First-Order Stationarity Guarantees for Langevin Monte Carlo","created":"2022-02-10","cited_by_count":63,"area":null},{"id":"2303.03589","title":"Towards a Complete Analysis of Langevin Monte Carlo: Beyond Poincar\\'e Inequality","created":"2023-03-07","cited_by_count":31,"area":null},{"id":"2302.10081","title":"Improved dimension dependence of a proximal algorithm for sampling","created":"2023-02-20","cited_by_count":30,"area":null},{"id":"2210.08448","title":"Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling","created":"2022-10-16","cited_by_count":22,"area":null},{"id":"2410.00858","title":"Entropy contraction of the Gibbs sampler under log-concavity","created":"2024-10-01","cited_by_count":13,"area":null},{"id":"2210.02482","title":"Fisher information lower bounds for sampling","created":"2022-10-05","cited_by_count":12,"area":null},{"id":"2304.02599","title":"Query lower bounds for log-concave sampling","created":"2023-04-05","cited_by_count":12,"area":null},{"id":"2502.05623","title":"Mixing Time of the Proximal Sampler in Relative Fisher Information via Strong Data Processing Inequality","created":"2025-02-08","cited_by_count":12,"area":null},{"id":"2410.10699","title":"Fast Convergence of $\\Phi$-Divergence Along the Unadjusted Langevin Algorithm and Proximal Sampler","created":"2024-10-14","cited_by_count":11,"area":null},{"id":"2303.03237","title":"Convergence Rates for Non-Log-Concave Sampling and Log-Partition Estimation","created":"2023-03-06","cited_by_count":10,"area":null},{"id":"2405.16736","title":"A Separation in Heavy-Tailed Sampling: Gaussian vs. Stable Oracles for Proximal Samplers","created":"2024-05-27","cited_by_count":6,"area":null},{"id":"2402.17067","title":"Characterizing Dependence of Samples along the Langevin Dynamics and Algorithms via Contraction of $\\Phi$-Mutual Information","created":"2024-02-26","cited_by_count":5,"area":null},{"id":"2510.25956","title":"Gradient Flow Sampler-based Distributionally Robust Optimization","created":"2025-10-29","cited_by_count":2,"area":null},{"id":"2602.14342","title":"High-accuracy log-concave sampling with stochastic queries","created":"2026-02-15","cited_by_count":2,"area":null},{"id":"2605.27769","title":"Smoothed Score Queries and the Complexity of Sampling","created":"2026-05-26","cited_by_count":0,"area":null},{"id":"2608.24527","title":"Provable Quantum-Classical Separation for Continuous Gibbs Sampling","created":"2026-08-25","cited_by_count":0,"area":null}],"next_cursor":null}