Enregistré dans:
Détails bibliographiques
Auteurs principaux: Schramm, Fabian, Perrin-Gilbert, Nicolas, Carpentier, Justin
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:https://arxiv.org/abs/2511.19165
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866914169258770432
author Schramm, Fabian
Perrin-Gilbert, Nicolas
Carpentier, Justin
author_facet Schramm, Fabian
Perrin-Gilbert, Nicolas
Carpentier, Justin
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2511_19165
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle First-order Sobolev Reinforcement Learning
Schramm, Fabian
Perrin-Gilbert, Nicolas
Carpentier, Justin
Machine Learning
Robotics
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.
title First-order Sobolev Reinforcement Learning
topic Machine Learning
Robotics
url https://arxiv.org/abs/2511.19165