mlsanityData to 7 Oct 2026

Implicit Langevin Algorithms for Sampling From Log-concave Densities

arXiv 1903.12322 ↗First posted 29 Mar 2019stat.ML cs.LG stat.COcited by 6

Not on the map. Why?

Abstract (arXiv)

For sampling from a log-concave density, we study implicit integrators resulting from θ-method discretization of the overdamped Langevin diffusion stochastic differential equation. Theoretical and algorithmic properties of the resulting sampling methods for θ ∈ [0,1] and a range of step sizes are established. Our results generalize and extend prior works in several directions. In particular, for θ≥1/2, we prove geometric ergodicity and stability of the resulting methods for all step sizes. We show that obtaining subsequent samples amounts to solving a strongly-convex optimization problem, which is readily achievable using one of numerous existing methods. Numerical examples supporting our theoretical analysis are also presented.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 29 Mar 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 1; 2025: 2; 2026: 1.

6 papers.