SOURCE-LINKED INTELLIGENCE

Rényi Tracking Bounds for Langevin Dynamics with Moving Targets

arXiv · AI, language, vision and robotics · article · Aug 25, 2026 · UTC

We study Langevin diffusion and Langevin Monte Carlo (LMC) when the target distribution changes over time. Under a log-Sobolev inequality (LSI), we derive non-asymptotic Rényi-divergence guarantees for tracking the current target. The framework covers continuous-time Langevin diffusion and its discretizations. We then apply the results to nonsmooth sampling based on successive Moreau envelopes. For this scheme, we give explicit choices of the smoothing parameters and step sizes, together with corresponding complexity bounds. To our knowledge, these are the first non-asymptotic Rényi-divergence

Read original source ↗ Open in workspace

recordType: paper
region: Global

Evidence & attribution

arXiv · AI, language, vision and robotics · 2026-08-25T07:53:23.000Z

First collected: 2026-09-21T10:02:02.728Z. This is not the publication date.