Reducing Sampling Error in Batch Temporal Difference Learning
Not on the map. Why?
Abstract (arXiv)
Temporal difference (TD) learning is one of the main foundations of modern reinforcement learning. This paper studies the use of TD(0), a canonical TD algorithm, to estimate the value function of a given policy from a batch of data. In this batch setting, we show that TD(0) may converge to an inaccurate value function because the update following an action is weighted according to the number of times that action occurred in the batch -- not the true probability of the action under the given policy. To address this limitation, we introduce textitpolicy sampling error corrected-TD(0) (PSEC-TD(0)). PSEC-TD(0) first estimates the empirical distribution of actions in each state in the batch and then uses importance sampling to correct for the mismatch between the empirical weighting and the correct weighting for updates following each action. We refine the concept of a certainty-equivalence estimate and argue that PSEC-TD(0) is a more data efficient estimator than TD(0) for a fixed batch of data. Finally, we conduct an empirical evaluation of PSEC-TD(0) on three batch value function learning tasks, with a hyperparameter sensitivity analysis, and show that PSEC-TD(0) produces value function estimates with lower mean squared error than TD(0).
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Aug 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 5; 2023: 1; 2024: 1; 2025: 1.
11 papers.
- 2021Universal Off-Policy Evaluationcited by 43
- 2021Robust On-Policy Sampling for Data-Efficient Policy Evaluation in Reinforcement Learningcited by 15
- 2022ReVar: Strengthening Policy Evaluation via Reduced Variance Samplingcited by 15
- 2022User-Interactive Offline Reinforcement Learningcited by 11
- 2022Comparing Model-free and Model-based Algorithms for Offline Reinforcement Learningcited by 9
- 2023On-Policy Policy Gradient Reinforcement Learning Without On-Policy Samplingcited by 6
- 2021Batch Reinforcement Learning from Crowdscited by 4
- 2022On the Reuse Bias in Off-Policy Reinforcement Learningcited by 2
- 2022Behavior Estimation from Multi-Source Data for Offline Reinforcement Learningcited by 2
- 2024Improving Actor-Critic Training with Steerable Action-Value Approximation Errorscited by 0
- 2025Centralized Adaptive Sampling for Reliable Co-Training of Independent Multi-Agent Policiescited by 0
- 2025Centralized Adaptive Sampling for Reliable Co-Training of Independent Multi-Agent Policies1 Aug 2025
- 2024Improving Actor-Critic Training with Steerable Action-Value Approximation Errors6 Jun 2024
- 2023On-Policy Policy Gradient Reinforcement Learning Without On-Policy Sampling14 Nov 2023
- 2022Behavior Estimation from Multi-Source Data for Offline Reinforcement Learning29 Nov 2022
- 2022On the Reuse Bias in Off-Policy Reinforcement Learning15 Sep 2022
- 2022User-Interactive Offline Reinforcement Learning21 May 2022
- 2022ReVar: Strengthening Policy Evaluation via Reduced Variance Sampling9 Mar 2022
- 2022Comparing Model-free and Model-based Algorithms for Offline Reinforcement Learning14 Jan 2022
- 2021Robust On-Policy Sampling for Data-Efficient Policy Evaluation in Reinforcement Learning29 Nov 2021
- 2021Batch Reinforcement Learning from Crowds8 Nov 2021
- 2021Universal Off-Policy Evaluation26 Apr 2021