Variance-Aware Off-Policy Evaluation with Linear Function Approximation
Yifei Min, Tianhao Wang, Dongruo Zhou, Quanquan Gu
Abstract
We study the off-policy evaluation (OPE) problem in reinforcement learning with linear function approximation, which aims to estimate the value function of a target policy based on the offline data collected by a behavior policy. We propose to incorporate the variance information of the value function to improve the sample efficiency of OPE. More specifically, for time-inhomogeneous episodic linear Markov decision processes (MDPs), we propose an algorithm, VA-OPE, which uses the estimated variance of the value function to reweight the Bellman residual in Fitted Q-Iteration. We show that our algorithm achieves a tighter error bound than the best-known result. We also provide a fine-grained characterization of the distribution shift between the behavior policy and the target policy. Extensive numerical experiments corroborate our theory.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 015ee64c-dc84-4c90-b162-f6973ebdc234Cited by top-tier papers23
- Near-optimal Offline Reinforcement Learning with Linear Representation: Leveraging Variance Information with PessimismMing Yin, Yaqi Duan, Mengdi Wang, Yu-Xiang WangICLR 2022 · 74 citations
- Learning Stochastic Shortest Path with Linear Function ApproximationYifei Min, Jiafan He, Tianhao Wang, Quanquan GuICML 2022 · 34 citations
- Offline Reinforcement Learning with Differential PrivacyDan Qiao, Yu-Xiang WangNeurIPS 2023 · 34 citations
- Learn to Match with No Regret: Reinforcement Learning in Markov Matching MarketsYifei Min, Tianhao Wang, Ruitu Xu, Zhaoran Wang et al.NeurIPS 2022 · 31 citations
- On Instance-Dependent Bounds for Offline Reinforcement Learning with Linear Function ApproximationThanh Nguyen-Tang, Ming Yin, Sunil Gupta, Svetha Venkatesh et al.AAAI 2023 · 24 citations
Builds on17
- MOReL: Model-Based Offline Reinforcement LearningRahul Kidambi, Aravind Rajeswaran, Praneeth Netrapalli, Thorsten JoachimsNeurIPS 2020 · 870 citations
- Is Pessimism Provably Efficient for Offline RL?Ying Jin, Zhuoran Yang, Zhaoran WangICML 2021 · 419 citations
- Model-Based Reinforcement Learning with Value-Targeted RegressionAlex Ayoub, Zeyu Jia, Csaba Szepesvári, Mengdi Wang et al.ICML 2020 · 324 citations
- Provably Efficient Exploration in Policy OptimizationQi Cai, Zhuoran Yang, Chi Jin, Zhaoran WangICML 2020 · 304 citations
- Learning Near Optimal Policies with Low Inherent Bellman ErrorAndrea Zanette, Alessandro Lazaric, Mykel J. Kochenderfer, Emma BrunskillICML 2020 · 238 citations
Related papers
- State-Action Similarity-Based Representations for Off-Policy EvaluationBrahma S. Pavse, Josiah HannaNeurIPS 2023 · 5 citations
- A Principled Path to Fitted Distributional EvaluationSungee Hong, Jiayi Wang, Zhengling Qi, Raymond K. W. WongNeurIPS 2025
- Kernel Metric Learning for In-Sample Off-Policy Evaluation of Deterministic RL PoliciesHaanvid Lee, Tri Wahyu Guntara, Jongmin Lee, Yung-Kyun Noh et al.ICLR 2024 · 3 citations
- Demystifying the Paradox of Importance Sampling with an Estimated History-Dependent Behavior Policy in Off-Policy EvaluationHongyi Zhou, Josiah P. Hanna, Jin Zhu, Ying Yang et al.ICML 2025
- Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision ProcessesJiafan He, Heyang Zhao, Dongruo Zhou, Quanquan GuICML 2023 · 68 citations
