Rapid convergence of the unadjusted Langevin algorithm: isoperimetry suffices
From MaRDI portal
Publication:6608556
DOI10.1007/978-3-031-26300-2_15MaRDI QIDQ6608556
Santosh Vempala, Andre Wibisono
Publication date: 20 September 2024
Inequalities; stochastic orderings (60E15) Monte Carlo methods (65C05) Sampling theory in information and communication theory (94A20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Functional inequalities for convolution probability measures
- Poincaré and logarithmic Sobolev inequalities by decomposition of the energy landscape
- On fine properties of mixtures with respect to concentration of measure and Sobolev type inequalities
- A simple proof of the Poincaré inequality for a large class of probability measures
- Simulated annealing via Sobolev inequalities
- Diffusion on compact Riemannian manifolds and logarithmic Sobolev inequalities
- Exponential integrability and transportation cost related to logarithmic Sobolev inequalities
- Generalization of an inequality by Talagrand and links with the logarithmic Sobolev inequality
- Hypercontractivity of Hamilton-Jacobi equations.
- Rényi divergence and the central limit theorem
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Logarithmic Sobolev inequalities and stochastic Ising models
- Transportation cost for Gaussian and other product measures
- Is there an analog of Nesterov acceleration for gradient-based MCMC?
- Bounds on the Poincaré constant for convolution measures
- Couplings and quantitative contraction rates for Langevin dynamics
- Exponential decay of Rényi divergence under Fokker-Planck equations
- Functional inequalities for Gaussian convolutions of compactly supported measures: explicit bounds and dimension dependence
- Entropies, convexity, and functional inequalities: on \(\Phi\)-entropies and \(\Phi\)-Sobolev inequalities
- Information Theoretic Security for Encryption Based on Conditional Rényi Entropies
- Rényi Divergence and Kullback-Leibler Divergence
- Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds
- The geometry of logconcave functions and sampling algorithms
- Logarithmic Sobolev Inequalities
- Random walks and anO*(n5) volume algorithm for convex bodies
- The Variational Formulation of the Fokker--Planck Equation
- Rényi Statistics in Directed Families of Exponential Experiments*
- A short proof of the "concavity of entropy power"
- Generalized cutoff rates and Renyi's information measures
- Affine Invariant Interacting Langevin Dynamics for Bayesian Inference
- Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation
- A generalized divergence measure for robust image registration
- Hit-and-Run from a Corner
Related Items (3)
Non-asymptotic convergence bounds for modified tamed unadjusted Langevin algorithm in non-convex setting ⋮ Principal feature detection via \(\phi \)-Sobolev inequalities ⋮ Riemannian Langevin algorithm for solving semidefinite programs
This page was built for publication: Rapid convergence of the unadjusted Langevin algorithm: isoperimetry suffices
