Stable And Efficient Policy Evaluation

Abstract

Policy evaluation algorithms are essential to reinforcement learning due to their ability to predict the performance of a policy. However, there are two long-standing issues lying in this prediction problem that need to be tackled: off-policy stability and on-policy efficiency. The conventional temporal difference (TD) algorithm is known to perform very well in the on-policy setting, yet is not off-policy stable. On the other hand, the gradient TD and emphatic TD algorithms are off-policy stable, but are not on-policy efficient. This paper introduces novel algorithms that are both off-policy stable and on-policy efficient by using the oblique projection method. The empirical experimental results on various domains validate the effectiveness of the proposed approach.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keylyu2020stable

Related papers

• Intrinsically Efficient, Stable, And Bounded Off-policy Evaluation For Reinforcement Learning (2019)0.00
• Efficient Evaluation Of Natural Stochastic Policies In Offline Reinforcement Learning (2020)0.00
• Adaptive Temporal-difference Learning For Policy Evaluation With Per-state Uncertainty Estimates (2019)0.00
• Distillation Policy Optimization (2023)0.00
• O\(^2\)TD: (near)-optimal Off-policy TD Learning (2017)0.00
• Adaptive Temporal Difference Learning With Linear Function Approximation (2020)0.00
• Doubly Optimal Policy Evaluation For Reinforcement Learning (2024)0.00
• Accelerated And Instance-optimal Policy Evaluation With Linear Function Approximation (2021)0.00