Target Networks and Over-parameterization Stabilize Off-policy Bootstrapping with Function Approximation
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911218606800896 |
|---|---|
| author | Che, Fengdi Xiao, Chenjun Mei, Jincheng Dai, Bo Gummadi, Ramki Ramirez, Oscar A Harris, Christopher K Mahmood, A. Rupam Schuurmans, Dale |
| author_facet | Che, Fengdi Xiao, Chenjun Mei, Jincheng Dai, Bo Gummadi, Ramki Ramirez, Oscar A Harris, Christopher K Mahmood, A. Rupam Schuurmans, Dale |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_21043 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Target Networks and Over-parameterization Stabilize Off-policy Bootstrapping with Function Approximation Che, Fengdi Xiao, Chenjun Mei, Jincheng Dai, Bo Gummadi, Ramki Ramirez, Oscar A Harris, Christopher K Mahmood, A. Rupam Schuurmans, Dale Machine Learning Artificial Intelligence 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. |
| title | Target Networks and Over-parameterization Stabilize Off-policy Bootstrapping with Function Approximation |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2405.21043 |