mlsanityData to 7 Oct 2026

On the Ergodicity, Bias and Asymptotic Normality of Randomized Midpoint Sampling Method

arXiv 2011.03176 ↗First posted 6 Nov 2020stat.ML cs.LG math.STcited by 23

Not on the map. Why?

Abstract (arXiv)

The randomized midpoint method, proposed by [SL19], has emerged as an optimal discretization procedure for simulating the continuous time Langevin diffusions. Focusing on the case of strong-convex and smooth potentials, in this paper, we analyze several probabilistic properties of the randomized midpoint discretization method for both overdamped and underdamped Langevin diffusions. We first characterize the stationary distribution of the discrete chain obtained with constant step-size discretization and show that it is biased away from the target distribution. Notably, the step-size needs to go to zero to obtain asymptotic unbiasedness. Next, we establish the asymptotic normality for numerical integration using the randomized midpoint method and highlight the relative advantages and disadvantages over other discretizations. Our results collectively provide several insights into the behavior of the randomized midpoint discretization method, including obtaining confidence intervals for numerical integrations.

Key facts. Cited by 23 papers in the map (data through 7 Oct 2026). First posted on arXiv 6 Nov 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2022: 3; 2023: 8; 2024: 10; 2025: 2.

23 papers.

Sort:

By area:

  1. 2023Faster high-accuracy log-concave sampling via algorithmic warm startscited by 44
  2. 2023Towards a Complete Analysis of Langevin Monte Carlo: Beyond Poincar'e Inequalitycited by 31
  3. 2023Improved dimension dependence of a proximal algorithm for samplingcited by 29
  4. 2024Faster Diffusion Sampling with Randomized Midpoints: Sequential and Parallelcited by 29
  5. 2023Improved Discretization Analysis for Underdamped Langevin Monte Carlocited by 26
  6. 2024Zeroth-Order Sampling Methods for Non-Log-Concave Distributions: Alleviating Metastability by Denoising Diffusioncited by 19
  7. 2024Error bounds for particle gradient descent, and extensions of the log-Sobolev and Talagrand inequalitiescited by 13
  8. 2023Langevin Monte Carlo for strongly log-concave distributions: Randomized midpoint revisitedcited by 10
  9. 2024Parallelized Midpoint Randomization for Langevin Monte Carlocited by 9
  10. 2024GIST: Gibbs self-tuning for locally adaptive Hamiltonian Monte Carlocited by 9
  11. 2022Unadjusted Hamiltonian MCMC with Stratified Monte Carlo Time Integrationcited by 8
  12. 2025Assessing the Quality of Denoising Diffusion Models in Wasserstein Distance: Noisy Score and Optimal Boundscited by 8
11 more
  1. 2024Sampling from the Mean-Field Stationary Distributioncited by 7
  2. 2022Heavy-tailed Sampling via Transformed Unadjusted Langevin Algorithmcited by 6
  3. 2024The Poisson Midpoint Method for Langevin Dynamics: Provably Efficient Discretization for Diffusion Modelscited by 6
  4. 2024A Separation in Heavy-Tailed Sampling: Gaussian vs. Stable Oracles for Proximal Samplerscited by 5
  5. 2023Mean-Square Analysis of Discretized Ito Diffusions for Heavy-tailed Samplingcited by 4
  6. 2024Convergence of Unadjusted Langevin in High Dimensions: Delocalization of Biascited by 4
  7. 2022A Dynamical System View of Langevin-Based Non-Convex Samplingcited by 2
  8. 2023Mean-field underdamped Langevin dynamics and its spacetime discretizationcited by 2
  9. 2024Randomized Midpoint Method for Log-Concave Sampling under Constraintscited by 2
  10. 2023Randomized Runge-Kutta-Nystr"om Methods for Unadjusted Hamiltonian and Kinetic Langevin Monte Carlocited by 1
  11. 2025Poisson Midpoint Method for Log Concave Sampling: Beyond the Strong Error Lower Boundscited by 0