Breaking the Deadly Triad with a Target Network
arXiv:2101.08862
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 -learning algorithms under nonrestrictive and changing behavior policies without bi-level optimization.
ICML 2021
References in corpus (11)
- Challenges of Real-World Reinforcement Learning
- Provably Efficient Reinforcement Learning with Linear Function Approximation
- Towards Characterizing Divergence in Deep Q-Learning
- Optimism in Reinforcement Learning with Generalized Linear Function Approximation
- A Finite Time Analysis of Two Time-Scale Actor Critic Methods
- Sample-Optimal Parametric Q-Learning Using Linearly Additive Features
- Regularized Off-Policy TD-Learning
- Learning and Planning in Average-Reward Markov Decision Processes
- Finite-sample Analysis of Greedy-GQ with Linear Function Approximation under Markovian Noise
- Zap Q-Learning With Nonlinear Function Approximation
- Average-Reward Off-Policy Policy Evaluation with Function Approximation