Derives KL and TV error bounds for kTULA and tRLMC schemes, giving near-optimal ilde O(ε^{-1/2}) complexity for kTULA and ilde O(ε^{-1}) for tRLMC under log-Sobolev sampling.
ktula: A langevin sampling algorithm with improved kl bounds under super-linear log-gradients.arXiv preprint arXiv:2506.04878, 2025
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Error estimates for tamed Euler and Randomized Euler schemes for SDEs with locally Lipschitz drift with applications to non-logconcave sampling and optimization
Derives KL and TV error bounds for kTULA and tRLMC schemes, giving near-optimal ilde O(ε^{-1/2}) complexity for kTULA and ilde O(ε^{-1}) for tRLMC under log-Sobolev sampling.