log-concave distribution

Sampling from Log-Concave Distributions with Infinity-Distance Guarantees NeurIPS 2022 The query complexity of sampling from strongly log-concave distributions in one dimension COLT 2022 Efficient constrained sampling via the mirror-Langevin algorithm NeurIPS 2021 Langevin Monte Carlo: random coordinate descent and variance reduction JMLR 2021 Learning Online Algorithms with Distributional Advice ICML 2021 Optimal dimension dependence of the Metropolis-Adjusted Langevin Algorithm COLT 2021 Optimal Underdamped Langevin MCMC Method NeurIPS 2021 Random Coordinate Langevin Monte Carlo COLT 2021 Random Coordinate Underdamped Langevin Monte Carlo AISTATS 2021 Wasserstein distance estimates for the distributions of numerical approximations to ergodic stochastic differential equations JMLR 2021 Double-Loop Unadjusted Langevin Algorithm ICML 2020 Exponential ergodicity of mirror-Langevin diffusions NeurIPS 2020 Langevin Monte Carlo without smoothness AISTATS 2020 Learning Halfspaces with Massart Noise Under Structured Distributions COLT 2020 Logsmooth Gradient Concentration and Tighter Runtimes for Metropolized Hamiltonian Monte Carlo COLT 2020 Penalized Langevin dynamics with vanishing penalty for smooth and log-concave targets NeurIPS 2020 Primal Dual Interpretation of the Proximal Stochastic Gradient Langevin Algorithm NeurIPS 2020 Variance reduction for Random Coordinate Descent-Langevin Monte Carlo NeurIPS 2020 Wasserstein Control of Mirror Langevin Monte Carlo COLT 2020 Analysis of Langevin Monte Carlo via Convex Optimization JMLR 2019 A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families NeurIPS 2019 Log-concave sampling: Metropolis-Hastings algorithms are fast JMLR 2019 Online sampling from log-concave distributions NeurIPS 2019 Stochastic Proximal Langevin Algorithm: Potential Splitting and Nonasymptotic Rates NeurIPS 2019 Dimension-free Information Concentration via Exp-Concavity ALT 2018