Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This paper is a theoretical study of semi-gradient temporal-difference learning, a core reinforcement learning method, using two-layer neural networks in the mean-field regime. It gives a proof-based stability condition: when entropy-driven relaxation outweighs the sensitivity of the moving bootstrap target, training converges exponentially to a unique fixed point, with a quantifiable bias from the unregularized Bellman solution. The result is a mathematical account of when function-approximation RL is stable, and it extends to soft Q-learning for off-policy control, though its practical relevance depends on how well the mean-field assumptions hold in realistic architectures.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

On the Convergence of Semi-Gradient TD: A Mean Field Perspective

arXiv1 min read

arXiv:2610.20014v1 Announce Type: new Abstract: Semi-gradient temporal-difference learning is a core algorithmic component of reinforcement learning, but bootstrapping with function approximation generally induces a non-conservative vector field and can lead to instability. We analyze this effect for two-layer neural networks in the mean-field regime and identify a simple stability mechanism in which entropy-induced relaxation dominates the sensitivity of the moving bootstrap target. Under this condition, we prove exponential convergence to a unique fixed point and quantify its bias relative to the unregularized Bellman solution. We also show that the same mechanism extends to entropy-regularized off-policy control through soft Q-learning.

Abstract:Semi-gradient temporal-difference learning is a core algorithmic component of reinforcement learning, but bootstrapping with function approximation generally induces a non-conservative vector field and can lead to instability. We analyze this effect for two-layer neural networks in the mean-field regime and identify a simple stability mechanism in which entropy-induced relaxation dominates the sensitivity of the moving bootstrap target. Under this condition, we prove exponential convergence to a unique fixed point and quantify its bias relative to the unregularized Bellman solution. We also show that the same mechanism extends to entropy-regularized off-policy control through soft Q-learning.

Machine Learning (cs.LG); Artificial Intelligence (cs.AI)

arXiv:2610.20014 [cs.LG]

(or arXiv:2610.20014v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2610.20014 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.

Full text under the publisher's open licence · 191 words

Related coverage