# Analysis of Langevin midpoint methods using an anticipative Girsanov theorem

arXiv: https://arxiv.org/abs/2507.12791 · HTML: https://mlsanity.com/paper/2507.12791/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 17 Jul 2025.

## Built on by (most cited first, 2 of 2)

- [Sublinear iterations can suffice even for DDPMs](https://mlsanity.com/paper/2511.04844/) (2025)
- [Algorithmic warm starts for Hamiltonian Monte Carlo](https://mlsanity.com/paper/2603.22741/) (2026)

## Abstract (arXiv)

We introduce a new method for analyzing midpoint discretizations of stochastic differential equations (SDEs), which are frequently used in Markov chain Monte Carlo (MCMC) methods for sampling from a target measure π propto exp(-V). Borrowing techniques from Malliavin calculus, we compute estimates for the Radon-Nikodym derivative for processes on L2([0, T); ℝd) which may anticipate the Brownian motion, in the sense that they may not be adapted to the filtration at the same time. Applying these to various popular midpoint discretizations, we are able to improve the regularity and cross-regularity results in the literature on sampling methods. We also obtain a query complexity bound of widetildeO(frackappa5/4 d1/4varepsilon1/2) for obtaining a varepsilon2-accurate sample in mathsfKL divergence, under log-concavity and strong smoothness assumptions for nabla2 V.