Importance Resampling for Off-policy Prediction

Matthew Schlegel, Wesley Chung, Daniel Graves, Jian Qian, Martha White
6/11/2019
cs.LGcs.AIstat.ML

Official code: mkschleg/Resampling.jl (6 stars, MIT, last commit 2020-02-08).

Abstract

Importance sampling (IS) is a common reweighting strategy for off-policy prediction in reinforcement learning. While it is consistent and unbiased, it can result in high variance updates to the weights for the value function. In this work, we explore a resampling strategy as an alternative to reweighting. We propose Importance Resampling (IR) for off-policy prediction, which resamples experience from a replay buffer and applies standard on-policy updates. The approach avoids using importance sampling ratios in the update, instead correcting the distribution before the update. We characterize the bias and consistency of IR, particularly compared to Weighted IS (WIS). We demonstrate in several microworlds that IR has improved sample efficiency and lower variance updates, as compared to IS and several variance-reduced IS strategies, including variants of WIS and V-trace which clips IS ratios. We also provide a demonstration showing IR improves over IS for learning a value function from images in a racing car simulator.

View on arXivView PDF

Code Implementations(1)

MIT

Importance Resampling for Off-Policy Prediction

62JuliaApr 25, 20196 years agoMIT

Similar Papers

Cite this paper

@article{schlegel2019importance,
  title  = {Importance Resampling for Off-policy Prediction},
  author = {Matthew Schlegel and Wesley Chung and Daniel Graves and Jian Qian and Martha White},
  year   = {2019},
  eprint = {1906.04328},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1906.04328}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1906.04328.svg)](https://codeofpaper.com/paper/1906.04328)

Discussion