Operator Shifting for Model-based Policy Evaluation
Xun Tang, Lexing Ying, Yuhua Zhu

TL;DR
This paper introduces an operator shifting technique to reduce bias in value function estimation in model-based reinforcement learning, with theoretical guarantees and a practical algorithm.
Contribution
It proposes a novel operator shifting method that corrects bias from estimated models and provides theoretical bounds and a numerical implementation.
Findings
The shifting factor is positive and bounded by 1+O(1/n).
The method reduces bias in value function estimates.
A practical algorithm for operator shifting is developed.
Abstract
In model-based reinforcement learning, the transition matrix and reward vector are often estimated from random samples subject to noise. Even if the estimated model is an unbiased estimate of the true underlying model, the value function computed from the estimated model is biased. We introduce an operator shifting method for reducing the error introduced by the estimated model. When the error is in the residual norm, we prove that the shifting factor is always positive and upper bounded by , where is the number of samples used in learning each row of the transition matrix. We also propose a practical numerical algorithm for implementing the operator shifting.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsProbabilistic and Robust Engineering Design · Reinforcement Learning in Robotics · Advanced Multi-Objective Optimization Algorithms
