{"total":73,"rows":[{"id":"2205.15902","title":"Variational inference via Wasserstein gradient flows","created":"2022-05-31","cited_by_count":85,"area":null},{"id":"2202.06386","title":"Improved analysis for a proximal algorithm for sampling","created":"2022-02-13","cited_by_count":73,"area":null},{"id":"2203.00263","title":"Private Convex Optimization via Exponential Mechanism","created":"2022-03-01","cited_by_count":49,"area":null},{"id":"2302.10249","title":"Faster high-accuracy log-concave sampling via algorithmic warm starts","created":"2023-02-20","cited_by_count":45,"area":null},{"id":"2109.13055","title":"Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling","created":"2021-09-27","cited_by_count":44,"area":null},{"id":"2307.02037","title":"Reverse Diffusion Monte Carlo","created":"2023-07-05","cited_by_count":41,"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":"2110.04597","title":"A Proximal Algorithm for Sampling from Non-smooth Potentials","created":"2021-10-09","cited_by_count":24,"area":null},{"id":"2202.13975","title":"A Proximal Algorithm for Sampling","created":"2022-02-28","cited_by_count":22,"area":null},{"id":"2402.03008","title":"Diffusive Gibbs Sampling","created":"2024-02-05","cited_by_count":21,"area":null},{"id":"2410.12456","title":"Training Neural Samplers with Reverse Diffusive KL Divergence","created":"2024-10-16","cited_by_count":21,"area":null},{"id":"2106.05480","title":"Lower Bounds on Metropolized Sampling Methods for Well-Conditioned Distributions","created":"2021-06-10","cited_by_count":19,"area":null},{"id":"2207.08074","title":"Mean-field Variational Inference via Wasserstein Gradient Flow","created":"2022-07-17","cited_by_count":19,"area":null},{"id":"2405.01425","title":"In-and-Out: Algorithmic Diffusion for Sampling Convex Bodies","created":"2024-05-02","cited_by_count":19,"area":null},{"id":"2304.04724","title":"When does Metropolized Hamiltonian Monte Carlo provably outperform Metropolis-adjusted Langevin algorithm?","created":"2023-04-10","cited_by_count":15,"area":null},{"id":"2207.08347","title":"Private Convex Optimization in General Norms","created":"2022-07-18","cited_by_count":13,"area":null},{"id":"2302.09699","title":"Private (Stochastic) Non-Convex Optimization Revisited: Second-Order Stationary Points and Excess Risks","created":"2023-02-20","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":"2411.13462","title":"Sampling and Integration of Logconcave Functions by Algorithmic Diffusion","created":"2024-11-20","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":"2209.12897","title":"Quantum Speedups of Optimizing Approximately Convex Functions with Applications to Logarithmic Regret Stochastic Convex Bandits","created":"2022-09-26","cited_by_count":11,"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":"2302.06085","title":"Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Sampler","created":"2023-02-13","cited_by_count":10,"area":null},{"id":"2410.09697","title":"Provable Convergence and Limitations of Geometric Tempering for Langevin Dynamics","created":"2024-10-13","cited_by_count":10,"area":null},{"id":"2404.15253","title":"GIST: Gibbs self-tuning for locally adaptive Hamiltonian Monte Carlo","created":"2024-04-23","cited_by_count":9,"area":null},{"id":"2108.12107","title":"An Introduction to Hamiltonian Monte Carlo Method for Sampling","created":"2021-08-27","cited_by_count":8,"area":null},{"id":"2406.14292","title":"Proximal Interacting Particle Langevin Algorithms","created":"2024-06-20","cited_by_count":8,"area":null},{"id":"2207.02189","title":"Accelerating Hamiltonian Monte Carlo via Chebyshev Integration Time","created":"2022-07-05","cited_by_count":7,"area":null},{"id":"2207.04387","title":"Bregman Proximal Langevin Monte Carlo via Bregman--Moreau Envelopes","created":"2022-07-10","cited_by_count":7,"area":null},{"id":"2402.07355","title":"Sampling from the Mean-Field Stationary Distribution","created":"2024-02-12","cited_by_count":7,"area":null},{"id":"2505.01937","title":"Faster logconcave sampling from a cold start in high dimension","created":"2025-05-03","cited_by_count":7,"area":null},{"id":"2310.05401","title":"Entropy-MCMC: Sampling from Flat Basins with Ease","created":"2023-10-09","cited_by_count":6,"area":null},{"id":"2404.02239","title":"Proximal Oracles for Optimization and Sampling","created":"2024-04-02","cited_by_count":6,"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":"2405.16734","title":"Faster Sampling via Stochastic Gradient Proximal Sampler","created":"2024-05-27","cited_by_count":5,"area":null},{"id":"2303.00570","title":"Mean-Square Analysis of Discretized It\\^o Diffusions for Heavy-tailed Sampling","created":"2023-03-01","cited_by_count":4,"area":null},{"id":"2305.05529","title":"Accelerate Langevin Sampling with Birth-Death Process and Exploration Component","created":"2023-05-06","cited_by_count":4,"area":null},{"id":"2305.15988","title":"Non-Log-Concave and Nonsmooth Sampling via Langevin Monte Carlo Algorithms","created":"2023-05-25","cited_by_count":4,"area":null},{"id":"2408.13115","title":"Convergence of Unadjusted Langevin in High Dimensions: Delocalization of Bias","created":"2024-08-20","cited_by_count":4,"area":null},{"id":"2306.09778","title":"Gradient is All You Need? How Consensus-Based Optimization can be Interpreted as a Stochastic Relaxation of Gradient Descent","created":"2023-06-16","cited_by_count":3,"area":null},{"id":"2407.12967","title":"R\\'enyi-infinity constrained sampling with $d^3$ membership queries","created":"2024-07-17","cited_by_count":3,"area":null},{"id":"2510.02983","title":"Oracle-based Uniform Sampling from Convex Bodies","created":"2025-10-03","cited_by_count":3,"area":null},{"id":"2606.12694","title":"A unified complexity bound for logconcave sampling","created":"2026-06-10","cited_by_count":3,"area":null},{"id":"2205.10188","title":"A Proximal Algorithm for Sampling from Non-convex Potentials","created":"2022-05-20","cited_by_count":2,"area":null},{"id":"2410.17147","title":"Covariance estimation using Markov chain Monte Carlo","created":"2024-10-22","cited_by_count":2,"area":null},{"id":"2509.04008","title":"Towards understanding Accelerated Stein Variational Gradient Flow -- Analysis of Generalized Bilinear Kernels for Gaussian target distributions","created":"2025-09-04","cited_by_count":2,"area":null},{"id":"2510.04460","title":"Perspectives on Stochastic Localization","created":"2025-10-06","cited_by_count":2,"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.10714","title":"A Non-asymptotic Analysis for Learning and Applying a Preconditioner in MCMC","created":"2026-02-11","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":"2609.06905","title":"Accelerated High-Accuracy Sampling from a Warm Start via the Proximal Bouncy Particle Sampler","created":"2026-09-07","cited_by_count":2,"area":null},{"id":"2501.06408","title":"Computational and Statistical Asymptotic Analysis of the JKO Scheme for Iterative Algorithms to update distributions","created":"2025-01-11","cited_by_count":1,"area":null},{"id":"2505.05301","title":"Operator-Level Quantum Acceleration of Non-Logconcave Sampling","created":"2025-05-08","cited_by_count":1,"area":null},{"id":"2508.15069","title":"Sampling by averaging: A multiscale approach to score estimation","created":"2025-08-20","cited_by_count":1,"area":null},{"id":"2603.19633","title":"Alternating Diffusion for Proximal Sampling with Zeroth Order Queries","created":"2026-03-20","cited_by_count":1,"area":null},{"id":"2605.12461","title":"A proximal gradient algorithm for composite log-concave sampling","created":"2026-05-12","cited_by_count":1,"area":null},{"id":"2606.27564","title":"Fast-Mixing Markov Chains without Gradients","created":"2026-06-25","cited_by_count":1,"area":null},{"id":"2607.22892","title":"Mirror Langevin diffusions: Convergence rates and Markov chain approximations","created":"2026-07-24","cited_by_count":1,"area":null},{"id":"2102.13068","title":"Truncated Log-concave Sampling with Reflective Hamiltonian Monte Carlo","created":"2021-02-25","cited_by_count":0,"area":null},{"id":"2407.04264","title":"Langevin Dynamics: A Unified Perspective on Optimization via Lyapunov Potentials","created":"2024-07-05","cited_by_count":0,"area":null},{"id":"2507.11236","title":"Improved sampling algorithms and functional inequalities for non-log-concave distributions","created":"2025-07-15","cited_by_count":0,"area":null},{"id":"2509.03110","title":"LSAM: Asynchronous Distributed Training with Landscape-Smoothed Sharpness-Aware Minimization","created":"2025-09-03","cited_by_count":0,"area":null},{"id":"2509.08560","title":"A transport approach to the cutoff phenomenon","created":"2025-09-10","cited_by_count":0,"area":null},{"id":"2601.08527","title":"Sampling via Stochastic Interpolants by Langevin-based Velocity and Initialization Estimation in Flow ODEs","created":"2026-01-13","cited_by_count":0,"area":null},{"id":"2602.03999","title":"Functional Stochastic Localization","created":"2026-02-03","cited_by_count":0,"area":null},{"id":"2603.25622","title":"The Geometry of Efficient Nonconvex Sampling","created":"2026-03-26","cited_by_count":0,"area":null},{"id":"2605.15859","title":"Complexity of Non-Log-Concave Sampling in Fisher Information","created":"2026-05-15","cited_by_count":0,"area":null},{"id":"2605.25042","title":"Unbiased Diffusion Variational Inversion via Principled Posterior Matching","created":"2026-05-24","cited_by_count":0,"area":null},{"id":"2608.25706","title":"Fast rates in Bayesian online learning with approximate posteriors","created":"2026-08-26","cited_by_count":0,"area":null},{"id":"2609.15884","title":"Thin-shell stability of Gaussian cooling: logconcave sampling with sesteric complexity from a cold start","created":"2026-09-14","cited_by_count":0,"area":null},{"id":"2609.28338","title":"Local Geometric Mixing via Dobrushin Contraction with Applications to Diffusion Path Monte Carlo and the Proximal Sampler","created":"2026-09-23","cited_by_count":0,"area":null},{"id":"2610.16248","title":"Reflected Proximal Dynamics for Accelerated High-Accuracy Log-Concave Sampling","created":"2026-10-12","cited_by_count":0,"area":null}],"next_cursor":null}