{"total":27,"rows":[{"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":"2203.00263","title":"Private Convex Optimization via Exponential Mechanism","created":"2022-03-01","cited_by_count":49,"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":"2407.16936","title":"Provable Benefit of Annealed Langevin Monte Carlo for Non-log-concave Sampling","created":"2024-07-24","cited_by_count":23,"area":null},{"id":"2202.13975","title":"A Proximal Algorithm for Sampling","created":"2022-02-28","cited_by_count":22,"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":"2206.00508","title":"Convergence of Stein Variational Gradient Descent under a Weaker Smoothness Condition","created":"2022-06-01","cited_by_count":16,"area":null},{"id":"2110.01827","title":"When is the Convergence Time of Langevin Algorithms Dimension Independent? A Composite Optimization Viewpoint","created":"2021-10-05","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":"2306.08494","title":"Langevin Monte Carlo for strongly log-concave distributions: Randomized midpoint revisited","created":"2023-06-14","cited_by_count":10,"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":"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":"2501.00565","title":"Sampling from multi-modal distributions with polynomial query complexity in fixed dimension via reverse diffusion","created":"2024-12-31","cited_by_count":4,"area":null},{"id":"2502.03458","title":"The Performance Of The Unadjusted Langevin Algorithm Without Smoothness Assumptions","created":"2025-02-05","cited_by_count":4,"area":null},{"id":"2112.09311","title":"Unadjusted Langevin algorithm for sampling a mixture of weakly smooth potentials","created":"2021-12-17","cited_by_count":3,"area":null},{"id":"2509.19455","title":"Anchored Langevin Algorithms","created":"2025-09-23","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":"2206.11533","title":"Stochastic Langevin Differential Inclusions with Applications to Machine Learning","created":"2022-06-23","cited_by_count":2,"area":null},{"id":"2503.16222","title":"Efficient Bayesian Computation Using Plug-and-Play Priors for Poisson Inverse Problems","created":"2025-03-20","cited_by_count":2,"area":null},{"id":"2203.09142","title":"Covid19 Reproduction Number: Credibility Intervals by Blockwise Proximal Monte Carlo Samplers","created":"2022-03-17","cited_by_count":1,"area":null},{"id":"2303.17109","title":"Efficient Sampling of Stochastic Differential Equations with Positive Semi-Definite Models","created":"2023-03-30","cited_by_count":1,"area":null},{"id":"2303.12407","title":"Non-asymptotic analysis of Langevin-type Monte Carlo algorithms","created":"2023-03-22","cited_by_count":0,"area":null},{"id":"2309.04877","title":"A Gentle Introduction to Gradient-Based Optimization and Variational Inequalities for Machine Learning","created":"2023-09-09","cited_by_count":0,"area":null},{"id":"2310.06081","title":"Ito Diffusion Approximation of Universal Ito Chains for Sampling, Optimization and Boosting","created":"2023-10-09","cited_by_count":0,"area":null},{"id":"2501.04134","title":"Mixing Times and Privacy Analysis for the Projected Langevin Algorithm under a Modulus of Continuity","created":"2025-01-07","cited_by_count":0,"area":null},{"id":"2501.18178","title":"Estimating Multi-chirp Parameters using Curvature-guided Langevin Monte Carlo","created":"2025-01-30","cited_by_count":0,"area":null}],"next_cursor":null}