Pith. sign in

Convergence in total variation for the kinetic Langevin algorithm

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

We prove non asymptotic total variation estimates for the kinetic Langevin algorithm in high dimension when the target measure satisfies a Poincar\'e inequality and has gradient Lipschitz potential. The main point is that the estimate improves significantly upon the corresponding bound for the non kinetic version of the algorithm, due to Dalalyan. In particular the dimension dependence drops from $O(n)$ to $O(\sqrt n)$.

citation-role summary

background 1

citation-polarity summary

fields

math.PR 1

years

2024 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.