{"list":"other","total":107,"rows":[{"id":"1912.01703","title":"PyTorch: An Imperative Style, High-Performance Deep Learning Library","created":"2019-12-03","cited_by_count":20305},{"id":"1601.00670","title":"Variational Inference: A Review for Statisticians","created":"2016-01-04","cited_by_count":1472},{"id":"1402.4102","title":"Stochastic Gradient Hamiltonian Monte Carlo","created":"2014-02-17","cited_by_count":343},{"id":"1702.03849","title":"Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysis","created":"2017-02-13","cited_by_count":243},{"id":"1903.08568","title":"Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Suffices","created":"2019-03-20","cited_by_count":227},{"id":"1412.7392","title":"Theoretical guarantees for approximate sampling from smooth and log-concave densities","created":"2014-12-23","cited_by_count":208},{"id":"1902.03932","title":"Cyclical Stochastic Gradient MCMC for Bayesian Deep Learning","created":"2019-02-11","cited_by_count":203},{"id":"1507.05021","title":"Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm","created":"2015-07-17","cited_by_count":197},{"id":"1506.04696","title":"A Complete Recipe for Stochastic Gradient MCMC","created":"2015-06-15","cited_by_count":146},{"id":"1605.01559","title":"High-dimensional Bayesian inference via the Unadjusted Langevin Algorithm","created":"2016-05-05","cited_by_count":146},{"id":"1707.03663","title":"Underdamped Langevin MCMC: A non-asymptotic analysis","created":"2017-07-12","cited_by_count":133},{"id":"1802.09188","title":"Analysis of Langevin Monte Carlo via convex optimization","created":"2018-02-26","cited_by_count":127},{"id":"1512.07666","title":"Preconditioned Stochastic Gradient Langevin Dynamics for Deep Neural Networks","created":"2015-12-23","cited_by_count":121},{"id":"1801.02309","title":"Log-concave sampling: Metropolis-Hastings algorithms are fast","created":"2018-01-08","cited_by_count":118},{"id":"1710.00095","title":"User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient","created":"2017-09-29","cited_by_count":116},{"id":"1707.06618","title":"Global Convergence of Langevin Dynamics Based Algorithms for Nonconvex Optimization","created":"2017-07-20","cited_by_count":97},{"id":"2103.04715","title":"Bayesian imaging using Plug & Play priors: when Langevin meets Tweedie","created":"2021-03-08","cited_by_count":97},{"id":"2102.04509","title":"Oops I Took A Gradient: Scalable Sampling for Discrete Distributions","created":"2021-02-08","cited_by_count":92},{"id":"1705.09048","title":"Convergence of Langevin MCMC in KL-divergence","created":"2017-05-25","cited_by_count":88},{"id":"2010.03106","title":"Structured Logconcave Sampling with a Restricted Gaussian Oracle","created":"2020-10-07","cited_by_count":86},{"id":"2205.15902","title":"Variational inference via Wasserstein gradient flows","created":"2022-05-31","cited_by_count":85},{"id":"1612.07471","title":"Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreau","created":"2016-12-22","cited_by_count":84},{"id":"1907.05254","title":"A Wasserstein-type distance in the space of Gaussian Mixture Models","created":"2019-07-11","cited_by_count":75},{"id":"2202.06386","title":"Improved analysis for a proximal algorithm for sampling","created":"2022-02-13","cited_by_count":73},{"id":"1805.01648","title":"Sharp convergence rates for Langevin dynamics in the nonconvex setting","created":"2018-05-04","cited_by_count":68},{"id":"1811.08413","title":"Sampling Can Be Faster Than Optimization","created":"2018-11-20","cited_by_count":68},{"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},{"id":"1807.09382","title":"On sampling from a log-concave density using kinetic Langevin diffusions","created":"2018-07-24","cited_by_count":62},{"id":"1802.10174","title":"Mirrored Langevin Dynamics","created":"2018-02-27","cited_by_count":61},{"id":"2012.12810","title":"Optimal dimension dependence of the Metropolis-Adjusted Langevin Algorithm","created":"2020-12-23","cited_by_count":57},{"id":"1811.10072","title":"The promises and pitfalls of Stochastic Gradient Langevin Dynamics","created":"2018-11-25","cited_by_count":56},{"id":"1907.06986","title":"Stochastic gradient Markov chain Monte Carlo","created":"2019-07-16","cited_by_count":56},{"id":"2002.04363","title":"Wasserstein Control of Mirror Langevin Monte Carlo","created":"2020-02-11","cited_by_count":55},{"id":"2010.16212","title":"Efficient constrained sampling via the mirror-Langevin algorithm","created":"2020-10-30","cited_by_count":55},{"id":"1507.02564","title":"Sampling from a log-concave distribution with Projected Langevin Monte Carlo","created":"2015-07-09","cited_by_count":52},{"id":"1905.12247","title":"Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradients","created":"2019-05-29","cited_by_count":51},{"id":"1304.2986","title":"Adaptive piecewise polynomial estimation via trend filtering","created":"2013-04-10","cited_by_count":47},{"id":"1306.0187","title":"Proximal Markov chain Monte Carlo algorithms","created":"2013-06-02","cited_by_count":46},{"id":"2302.10249","title":"Faster high-accuracy log-concave sampling via algorithmic warm starts","created":"2023-02-20","cited_by_count":45},{"id":"1810.12361","title":"Global Non-convex Optimization with Discretized Diffusions","created":"2018-10-29","cited_by_count":44},{"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},{"id":"2206.09914","title":"A Langevin-like Sampler for Discrete Distributions","created":"2022-06-20","cited_by_count":44},{"id":"1705.08964","title":"Sampling from a log-concave distribution with compact support with proximal Langevin Monte Carlo","created":"2017-05-24","cited_by_count":43},{"id":"1907.11331","title":"Improved Bounds for Discretization of Langevin Diffusions: Near-Optimal Rates without Convexity","created":"2019-07-25","cited_by_count":39},{"id":"1910.02008","title":"Nonasymptotic estimates for Stochastic Gradient Langevin Dynamics under local conditions in nonconvex optimization","created":"2019-10-04","cited_by_count":38},{"id":"1706.06461","title":"First Order Methods beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems","created":"2017-06-20","cited_by_count":37},{"id":"2109.12077","title":"The Mirror Langevin Algorithm Converges with Vanishing Bias","created":"2021-09-24","cited_by_count":37},{"id":"1805.00452","title":"Coupling and Convergence for Hamiltonian Monte Carlo","created":"2018-05-01","cited_by_count":36},{"id":"2006.09270","title":"Primal Dual Interpretation of the Proximal Stochastic Gradient Langevin Algorithm","created":"2020-06-16","cited_by_count":35},{"id":"1911.01469","title":"Proximal Langevin Algorithm: Rapid Convergence Under Isoperimetry","created":"2019-11-04","cited_by_count":34},{"id":"1710.02736","title":"Beyond Log-concavity: Provable Guarantees for Sampling Multi-modal Distributions using Simulated Tempering Langevin Monte Carlo","created":"2017-10-07","cited_by_count":33},{"id":"2012.12137","title":"Projected Stochastic Gradient Langevin Algorithms for Constrained Sampling and Non-Convex Learning","created":"2020-12-22","cited_by_count":33},{"id":"1710.06261","title":"Convergence Rate of Riemannian Hamiltonian Monte Carlo and Faster Polytope Volume Computation","created":"2017-10-17","cited_by_count":32},{"id":"2303.03589","title":"Towards a Complete Analysis of Langevin Monte Carlo: Beyond Poincar\\'e Inequality","created":"2023-03-07","cited_by_count":31},{"id":"1309.2983","title":"Langevin diffusions and the Metropolis-adjusted Langevin algorithm","created":"2013-09-11","cited_by_count":29},{"id":"1905.02313","title":"Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions","created":"2019-05-07","cited_by_count":28},{"id":"1905.13285","title":"Langevin Monte Carlo without smoothness","created":"2019-05-30","cited_by_count":28},{"id":"2202.01908","title":"Sampling with Riemannian Hamiltonian Monte Carlo in a Constrained Space","created":"2022-02-03","cited_by_count":28},{"id":"2302.08049","title":"Improved Discretization Analysis for Underdamped Langevin Monte Carlo","created":"2023-02-16","cited_by_count":28},{"id":"1510.02451","title":"The Bouncy Particle Sampler: A Non-Reversible Rejection-Free Markov Chain Monte Carlo Method","created":"2015-10-08","cited_by_count":27},{"id":"2301.01766","title":"Learning Gaussian Mixtures Using the Wasserstein-Fisher-Rao Gradient Flow","created":"2023-01-04","cited_by_count":27},{"id":"2010.09800","title":"A Contour Stochastic Gradient Langevin Dynamics Algorithm for Simulations of Multi-modal Distributions","created":"2020-10-19","cited_by_count":26},{"id":"2101.10695","title":"The Langevin Monte Carlo algorithm in the non-smooth log-concave case","created":"2021-01-26","cited_by_count":26},{"id":"2204.10818","title":"Convergence of the Riemannian Langevin Algorithm","created":"2022-04-22","cited_by_count":25},{"id":"2110.04597","title":"A Proximal Algorithm for Sampling from Non-smooth Potentials","created":"2021-10-09","cited_by_count":24},{"id":"1905.11937","title":"Efficient MCMC Sampling with Dimension-Free Convergence Rate using ADMM-type Splitting","created":"2019-05-23","cited_by_count":22},{"id":"2010.11176","title":"Riemannian Langevin Algorithm for Solving Semidefinite Programs","created":"2020-10-21","cited_by_count":22},{"id":"2202.13975","title":"A Proximal Algorithm for Sampling","created":"2022-02-28","cited_by_count":22},{"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},{"id":"1610.09641","title":"Auxiliary gradient-based sampling algorithms","created":"2016-10-30","cited_by_count":21},{"id":"1812.02709","title":"On stochastic gradient Langevin dynamics with dependent data streams in the logconcave case","created":"2018-12-06","cited_by_count":20},{"id":"2105.08368","title":"Convergence Rates of Gradient Methods for Convex Optimization in the Space of Measures","created":"2021-05-18","cited_by_count":20},{"id":"1910.00551","title":"An Efficient Sampling Algorithm for Non-smooth Composite Potentials","created":"2019-10-01","cited_by_count":19},{"id":"2106.05480","title":"Lower Bounds on Metropolized Sampling Methods for Well-Conditioned Distributions","created":"2021-06-10","cited_by_count":19},{"id":"2105.00887","title":"Mixing Time Guarantees for Unadjusted Hamiltonian Monte Carlo","created":"2021-05-03","cited_by_count":18},{"id":"1905.11768","title":"Stochastic Proximal Langevin Algorithm: Potential Splitting and Nonasymptotic Rates","created":"2019-05-28","cited_by_count":17},{"id":"2008.02260","title":"Fixed Point Strategies in Data Science","created":"2020-08-05","cited_by_count":16},{"id":"2010.05263","title":"Fast Convergence of Langevin Dynamics on Manifold: Geodesics meet Log-Sobolev","created":"2020-10-11","cited_by_count":16},{"id":"1902.08452","title":"Nonconvex sampling with the Metropolis-adjusted Langevin algorithm","created":"2019-02-22","cited_by_count":15},{"id":"1905.13142","title":"On stochastic gradient Langevin dynamics with dependent data streams: the fully non-convex case","created":"2019-05-30","cited_by_count":14},{"id":"2201.06133","title":"On Maximum-a-Posteriori estimation with Plug & Play priors and stochastic gradient descent","created":"2022-01-16","cited_by_count":14},{"id":"1705.06019","title":"Regularizing with Bregman-Moreau envelopes","created":"2017-05-17","cited_by_count":12},{"id":"2212.12499","title":"Posterior-Variance-Based Error Quantification for Inverse Problems in Imaging","created":"2022-12-23","cited_by_count":12},{"id":"2106.03646","title":"Proximal nested sampling for high-dimensional Bayesian model selection","created":"2021-06-07","cited_by_count":11},{"id":"2108.00682","title":"Asymptotic bias of inexact Markov Chain Monte Carlo methods in high dimension","created":"2021-08-02","cited_by_count":11},{"id":"2208.00040","title":"Enhanced gradient-based MCMC in discrete spaces","created":"2022-07-29","cited_by_count":10},{"id":"2210.07219","title":"Condition-number-independent convergence rate of Riemannian Hamiltonian Monte Carlo with numerical integrators","created":"2022-10-13","cited_by_count":10},{"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},{"id":"2303.03237","title":"Convergence Rates for Non-Log-Concave Sampling and Log-Partition Estimation","created":"2023-03-06","cited_by_count":10},{"id":"1604.08096","title":"Forward-backward quasi-Newton methods for nonsmooth optimization problems","created":"2016-04-27","cited_by_count":9},{"id":"2202.09867","title":"Interacting Contour Stochastic Gradient Langevin Dynamics","created":"2022-02-20","cited_by_count":9},{"id":"1505.05198","title":"Forward-Backward Splitting with Bregman Distances","created":"2015-05-19","cited_by_count":8},{"id":"1606.06256","title":"Forward-backward envelope for the sum of two nonconvex functions: Further properties and nonmonotone line-search algorithms","created":"2016-06-20","cited_by_count":8},{"id":"1403.7957","title":"Information-geometric Markov Chain Monte Carlo methods using Diffusions","created":"2014-03-31","cited_by_count":7},{"id":"1908.03878","title":"Bregman Forward-Backward Operator Splitting","created":"2019-08-11","cited_by_count":7},{"id":"2207.04387","title":"Bregman Proximal Langevin Monte Carlo via Bregman--Moreau Envelopes","created":"2022-07-10","cited_by_count":7},{"id":"2103.09017","title":"Gradient-Based Markov Chain Monte Carlo for Bayesian Inference With Non-Differentiable Priors","created":"2021-03-16","cited_by_count":6},{"id":"1903.08111","title":"Preconditioned P-ULA for Joint Deconvolution-Segmentation of Ultrasound Images -- Extended Version","created":"2019-03-19","cited_by_count":5},{"id":"1912.05153","title":"Sampling for Bayesian Mixture Models: MCMC with Polynomial-Time Mixing","created":"2019-12-11","cited_by_count":5},{"id":"2212.12629","title":"Concentration of the Langevin Algorithm's Stationary Distribution","created":"2022-12-24","cited_by_count":5}],"next_cursor":"100"}