paper-with-me

홈 › Papers

Target Networks and Over-parameterization Stabilize Off-policy Bootstrapping with Function Approximation

2024-05-31 · Fengdi Che, Chenjun Xiao, Jincheng Mei, Bo Dai, Ramki Gummadi, Oscar A Ramirez, Christopher K Harris, A. Rupam Mahmood, Dale Schuurmans

We prove that the combination of a target network and over-parameterized linear function approximation establishes a weaker convergence condition for bootstrapped value estimation in certain cases, even with off-policy data. Our condition is naturally satisfied for expected updates over the entire state-action space or learning with a batch of complete trajectories from episodic Markov decision processes. Notably, using only a target network or an over-parameterized model does not provide such a convergence guarantee. Additionally, we extend our results to learning with truncated trajectories, showing that convergence is achievable for all tasks with minor modifications, akin to value truncation for the final states in trajectories. Our primary result focuses on temporal difference estimation for prediction, providing high-probability value estimation error bounds and empirical analysis on Baird's counterexample and a Four-room task. Furthermore, we explore the control setting, demonstrating that similar convergence conditions apply to Q-learning.

📄 PDF Abstract BibTeX arXiv:2405.21043

Code (1)

FengdiC/OTTD 공식 구현

Tasks

Q-Learning

Similar Papers 제목 키워드 기반

Breaking the Deadly Triad with a Target Network

2021-01-21 · Shangtong Zhang, Hengshuai Yao, Shimon Whiteson

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 net…

Q-Learning

Bootstrapping the Expressivity with Model-based Planning

2019-09-25 · Kefan Dong, Yuping Luo, Tengyu Ma

We compare the model-free reinforcement learning with the model-based approaches through the lens of the expressive power of neural networks for policies, $Q$-functions, and dynamics. We show, theoretically and empirica…

modelMuJoCo

Implicit Under-Parameterization Inhibits Data-Efficient Deep Reinforcement Learning

2020-10-27 · ICLR 2021 1 · Aviral Kumar, Rishabh Agarwal, Dibya Ghosh, Sergey Levine

We identify an implicit under-parameterization phenomenon in value-based deep RL methods that use bootstrapping: when value functions, approximated using deep neural networks, are trained with gradient descent using iter…

Deep Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)

On the Expressivity of Neural Networks for Deep Reinforcement Learning

2019-10-14 · ICML 2020 1 · Kefan Dong, Yuping Luo, Tengyu Ma

We compare the model-free reinforcement learning with the model-based approaches through the lens of the expressive power of neural networks for policies, $Q$-functions, and dynamics. We show, theoretically and empirical…

Deep Reinforcement LearningMuJoCoreinforcement-learningReinforcement Learning+1

Bridging the Gap Between Target Networks and Functional Regularization

2022-10-21 · Alexandre Piche, Valentin Thomas, Joseph Marino, Rafael Pardinas 외

Bootstrapping is behind much of the successes of Deep Reinforcement Learning. However, learning the value function via bootstrapping often leads to unstable training due to fast-changing target values. Target Networks ar…

Deep Reinforcement Learning