The Langevin Monte Carlo algorithm in the non-smooth log-concave case
From MaRDI portal
Publication:6138925
DOI10.1214/23-aap1935arXiv2101.10695MaRDI QIDQ6138925
Publication date: 16 January 2024
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.10695
Sampling theory, sample surveys (62D05) Monte Carlo methods (65C05) Randomized algorithms (68W20) Asymptotic theory of convex bodies (52A23)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Isoperimetric and concentration inequalities: equivalence under curvature lower bound
- Stochastic differential equations with reflecting boundary condition in convex regions
- Convex measures on locally convex spaces
- Sections of convex bodies through their centroid
- Generalization of an inequality by Talagrand and links with the logarithmic Sobolev inequality
- From Brunn-Minkowski to Brascamp-Lieb and to logarithmic Sobolev inequalities
- Hypercontractivity of Hamilton-Jacobi equations.
- Sampling from a log-concave distribution with projected Langevin Monte Carlo
- Isoperimetric problems for convex bodies and a localization lemma
- An almost constant lower bound of the isoperimetric coefficient in the KLS conjecture
- Bourgain's slicing problem and KLS isoperimetry up to polylog
- The Poincaré inequality and quadratic transportation-variance inequalities
- High-dimensional Bayesian inference via the unadjusted Langevin algorithm
- A note on quadratic transportation and divergence inequality
- Thin shell implies spectral gap up to polylog via a stochastic localization scheme
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Analysis and Geometry of Markov Diffusion Operators
- Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
