A Temporal Difference Method for Stochastic Continuous Dynamics
On the map: Deep reinforcement learning methods → RL theory and sample complexity
Abstract (arXiv)
For continuous systems modeled by dynamical equations such as ODEs and SDEs, Bellman's Principle of Optimality takes the form of the Hamilton-Jacobi-Bellman (HJB) equation, which provides the theoretical target of reinforcement learning (RL). Although recent advances in RL successfully leverage this formulation, the existing methods typically assume the underlying dynamics are known a priori because they need explicit access to the coefficient functions of dynamical equations to update the value function following the HJB equation. We address this inherent limitation of HJB-based RL; we propose a model-free approach still targeting the HJB equation and propose the corresponding temporal difference method. We establish exponential convergence of the idealized continuous-time dynamics and empirically demonstrate its potential advantages over transition-kernel-based formulations. The proposed formulation paves the way toward bridging stochastic control and model-free reinforcement learning.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Placed in RL theory and sample complexity, one of 15 directions in Deep reinforcement learning methods. Builds on 19 of its 34 references that are in the map. First posted on arXiv 21 May 2025.
Builds on
19 of 34 references.
References · 19
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
- 2015Trust Region Policy Optimizationcited by 2,580
- 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,258
- 2019Dream to Control: Learning Behaviors by Latent Imaginationcited by 1,653
- 2017Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithmcited by 734
- 2021Brax -- A Differentiable Physics Engine for Large Scale Rigid Body Simulationcited by 407
- 2021Policy Gradient and Actor-Critic Learning in Continuous Time and Space: Theory and Algorithmscited by 101
- 2022q-Learning in Continuous Timecited by 91
- 2021Policy Evaluation and Temporal-Difference Learning in Continuous Time and Space: A Martingale Approachcited by 84
- 2023Hyperparameters in Reinforcement Learning and How To Tune Themcited by 59
- 2019Making Deep Q-learning methods robust to time discretizationcited by 58
7 more
- 2021Continuous-Time Model-Based Reinforcement Learningcited by 41
- 2021Exploratory HJB equations and their convergencecited by 32
- 2020Hamilton-Jacobi Deep Q-Learning for Deterministic Continuous-Time Systems with Lipschitz Continuous Controlscited by 31
- 2023Policy Optimization for Continuous Reinforcement Learningcited by 31
- 2023High-probability sample complexities for policy evaluation with linear function approximationcited by 16
- 2022Distributional Hamilton-Jacobi-Bellman Equations for Continuous-Time Reinforcement Learningcited by 12
- 2022Temporal Difference Learning with Continuous Time and State in the Stochastic Settingcited by 5
Built on by
Citing papers per year: 2026: 3.
3 papers.
Similar, not cited
Close in wording, no citation either way
- 2026Discretization error from regularized Reinforcement Learning to continuous-time stochastic control
- 2025Is Bellman Equation Enough for Learning Control?
- 2024PhiBE: A PDE-based Bellman Equation for Continuous Time Policy Evaluation
- 2024On Bellman equations for continuous-time policy evaluation I: discretization and approximation
- 2024On the stability of Lipschitz continuous control problems and its application to reinforcement learning
- 2025Continuous-time reinforcement learning for optimal switching over multiple regimes
- 2026Unifying Hamilton-Jacobi Reachability and Reinforcement Learning
- 2025First-order Sobolev Reinforcement Learning