analiza aiqbench
This paper introduces a novel theoretical framework for deep reinforcement learning in continuous environments by modeling the problem as a continuous-time stochastic process. By deriving an equation for state distribution changes under a vanishingly small learning rate, the authors provide a nonparametric formulation for analyzing overparametrized neural actor-critic algorithms. The work bridges stochastic control theory with infinite-width network limits, offering a rigorous analytical foundation for understanding RL dynamics in continuous settings.
From Ticks to Flows: Dynamics of Neural Reinforcement Learning in Continuous Environments
arXiv:2606.04275v1 Announce Type: new Abstract: We present a novel theoretical framework for deep reinforcement learning (RL) in continuous environments by modeling the problem as a continuous-time stochastic process, drawing on insights from stochastic control. Building on previous work, we introduce a viable model of actor-critic algorithm that incorporates both exploration and stochastic transitions. For single-hidden-layer neural networks, we show that the state of the environment can be formulated as a two time scale process: the environment time and the gradient time. Within this formulation, we characterize how the time-dependent random variables that represent the environment's state and estimate of the cumulative discounted return evolve over gradient steps in the infinite width limit of two-layer networks. Using the theory of stochastic differential equations, we derive, for the first time in continuous RL, an equation describing the infinitesimal change in the state distribution at each gradient step, under a vanishingly small learning rate. Overall, our work provides a novel nonparametric formulation for studying overparametrized neural actor-critic algorithms. We empirically corroborate our theoretical result using a toy continuous control task.
Abstract:We present a novel theoretical framework for deep reinforcement learning (RL) in continuous environments by modeling the problem as a continuous-time stochastic process, drawing on insights from stochastic control. Building on previous work, we introduce a viable model of actor-critic algorithm that incorporates both exploration and stochastic transitions. For single-hidden-layer neural networks, we show that the state of the environment can be formulated as a two time scale process: the environment time and the gradient time. Within this formulation, we characterize how the time-dependent random variables that represent the environment's state and estimate of the cumulative discounted return evolve over gradient steps in the infinite width limit of two-layer networks. Using the theory of stochastic differential equations, we derive, for the first time in continuous RL, an equation describing the infinitesimal change in the state distribution at each gradient step, under a vanishingly small learning rate. Overall, our work provides a novel nonparametric formulation for studying overparametrized neural actor-critic algorithms. We empirically corroborate our theoretical result using a toy continuous control task.
Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
arXiv:2606.04275 [cs.LG]
(or arXiv:2606.04275v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2606.04275 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
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.
Text integral sub licența deschisă a publicației · 269 cuvinte
Subiecte conexe

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

News
Quantum Computing Report · 25 iul. 2026
Explainable Deep Learning for Price-Trade Dynamics: From Black-Box Forecasts to Effective Parametric Models
arXiv · 9 sept. 2026
Does preservation make sense before we know how to revive?
LessWrong · 15 iun. 2026