Breaking The Deadly Triad With A Target Network

Abstract

The deadly triad refers to the instability of a reinforcement learning algorithm when it employs off-policy learning, function approximation, and bootstrapping simultaneously. In this paper, we investigate the target network as a tool for breaking the deadly triad, providing theoretical support for the conventional wisdom that a target network stabilizes training. We first propose and analyze a novel target network update rule which augments the commonly used Polyak-averaging style update with two projections. We then apply the target network and ridge regularization in several divergent algorithms and show their convergence to regularized TD fixed points. Those algorithms are off-policy with linear function approximation and bootstrapping, spanning both policy evaluation and control, as well as both discounted and average-reward settings. In particular, we provide the first convergent linear \(Q\)-learning algorithms under nonrestrictive and changing behavior policies without bi-level

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyzhang2021breaking

Related papers

• Deep Reinforcement Learning And The Deadly Triad (2018)0.00
• Target Networks And Over-parameterization Stabilize Off-policy Bootstrapping With Function Approximation (2024)0.00
• Target-based Temporal Difference Learning (2019)0.00
• T-soft Update Of Target Network For Deep Reinforcement Learning (2020)13.39
• Analysis Of Off-policy Multi-step Td-learning With Linear Function Approximation (2024)2.26
• Periodic Q-learning (2020)0.00
• Policy Search By Target Distribution Learning For Continuous Control (2019)3.58
• Analysis Of A Target-based Actor-critic Algorithm With Linear Function Approximation (2021)0.00