Analysis of Langevin midpoint methods using an anticipative Girsanov theorem

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 $\pi \propto \exp (-V)$. Borrowing techniques from Malliavin calculus, we compute estimates for the Radon-Nikodym derivative for processes on $L^2([0,T);{\mathbb{R}}^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 $\tilde{O}(\frac{{\kappa }^{5\mathrm{/}4}{d}^{1\mathrm{/}4}}{{\epsilon }^{1\mathrm{/}2}})$ for obtaining a ${\epsilon }^2$-accurate sample in $\mathsf{K}\mathsf{L}$ divergence, under log-concavity and strong smoothness assumptions for ${\mathrm{\nabla }}^{2}V$.