A Malliavin-calculus Girsanov analysis yields process-level KL and Rényi bounds for midpoint Langevin discretizations and a O~(kappa^{5/4} d^{1/4}/epsilon^{1/2}) query complexity for a new deterministic double midpoint sampler.
Itˆ o formula and Girsanov theorem for anticipating stochastic integrals
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.NA 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Analysis of Langevin midpoint methods using an anticipative Girsanov theorem
A Malliavin-calculus Girsanov analysis yields process-level KL and Rényi bounds for midpoint Langevin discretizations and a O~(kappa^{5/4} d^{1/4}/epsilon^{1/2}) query complexity for a new deterministic double midpoint sampler.