Score: 0

First-order Sobolev Reinforcement Learning

Published: November 24, 2025 | arXiv ID: 2511.19165v1

By: Fabian Schramm, Nicolas Perrin-Gilbert, Justin Carpentier

Potential Business Impact:

Teaches computers to learn faster and more reliably.

Business Areas:
Machine Learning Artificial Intelligence, Data and Analytics, Software

We propose a refinement of temporal-difference learning that enforces first-order Bellman consistency: the learned value function is trained to match not only the Bellman targets in value but also their derivatives with respect to states and actions. By differentiating the Bellman backup through differentiable dynamics, we obtain analytically consistent gradient targets. Incorporating these into the critic objective using a Sobolev-type loss encourages the critic to align with both the value and local geometry of the target function. This first-order TD matching principle can be seamlessly integrated into existing algorithms, such as Q-learning or actor-critic methods (e.g., DDPG, SAC), potentially leading to faster critic convergence and more stable policy gradients without altering their overall structure.

Page Count
5 pages

Category
Computer Science:
Machine Learning (CS)