aiqbench analysis
This paper advances the theoretical foundations of adaptive sampling by establishing non-asymptotic Rényi-divergence bounds for Langevin dynamics when target distributions evolve over time. The work provides explicit complexity guarantees and parameter choices for handling nonsmooth objectives via successive Moreau envelopes, addressing a critical gap in tracking algorithms for dynamic environments.
R\'enyi Tracking Bounds for Langevin Dynamics with Moving Targets
arXiv:2609.17577v1 Announce Type: cross Abstract: 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\'enyi-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\'enyi-divergence tracking bounds for Langevin dynamics with discrete target updates.
Abstract: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 tracking bounds for Langevin dynamics with discrete target updates.
Machine Learning (stat.ML); Machine Learning (cs.LG)
arXiv:2609.17577 [stat.ML]
(or arXiv:2609.17577v1 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2609.17577 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 185 words
Related coverage

[AINews] Reality Checks on AI News (Yegge shuts down Gas Town, Databricks’ +60% Astra cost)
Latent Space · Sep 17, 2026

Generalization and infinite width
LessWrong · Aug 1, 2026
Assessing Information Ecosystems : How Governments Can Get Ahead of Hybrid Threats
carnegieendowment.org · Aug 5, 2026

Scaling and Operating a Large dbt Project on Databricks: IFCO's Data Team on Performance, Visibility, and Debugging
Databricks · Oct 6, 2026