Minimax Value Interval for Off-Policy Evaluation and Policy Optimization
Not on the map. Why?
Abstract (arXiv)
We study minimax methods for off-policy evaluation (OPE) using value functions and marginalized importance weights. Despite that they hold promises of overcoming the exponential variance in traditional importance sampling, several key problems remain: (1) They require function approximation and are generally biased. For the sake of trustworthy OPE, is there anyway to quantify the biases? (2) They are split into two styles ("weight-learning" vs "value-learning"). Can we unify them? In this paper we answer both questions positively. By slightly altering the derivation of previous methods (one from each style; Uehara et al., 2020), we unify them into a single value interval that comes with a special type of double robustness: when either the value-function or the importance-weight class is well specified, the interval is valid and its length quantifies the misspecification of the other class. Our interval also provides a unified view of and new insights to some recent methods, and we further explore the implications of our results on exploration and exploitation in off-policy policy optimization with insufficient data coverage.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 6 Feb 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2020: 1; 2021: 6; 2022: 2; 2023: 2.
11 papers.
- 2020What are the Statistical Limits of Offline RL with Linear Function Approximation?cited by 135
- 2021Finite Sample Analysis of Minimax Offline Reinforcement Learning: Completeness, Fast Rates and First-Order Efficiencycited by 54
- 2021Universal Off-Policy Evaluationcited by 43
- 2021Instabilities of Offline RL with Pre-Trained Neural Representationcited by 38
- 2022Confidence-Conditioned Value Functions for Offline Reinforcement Learningcited by 20
- 2021Non-asymptotic Confidence Intervals of Off-policy Evaluation: Primal and Dual Boundscited by 11
- 2021SOPE: Spectrum of Off-Policy Estimatorscited by 5
- 2023Model-based Offline Reinforcement Learning with Local Misspecificationcited by 5
- 2021On the Convergence Rate of Off-Policy Policy Optimization Methods with Density-Ratio Correctioncited by 4
- 2023Off-Policy Evaluation for Action-Dependent Non-Stationary Environmentscited by 2
- 2022Operator Deep Q-Learning: Zero-Shot Reward Transferring in Reinforcement Learningcited by 1
- 2023Model-based Offline Reinforcement Learning with Local Misspecification26 Jan 2023
- 2023Off-Policy Evaluation for Action-Dependent Non-Stationary Environments24 Jan 2023
- 2022Confidence-Conditioned Value Functions for Offline Reinforcement Learning8 Dec 2022
- 2022Operator Deep Q-Learning: Zero-Shot Reward Transferring in Reinforcement Learning1 Jan 2022
- 2021SOPE: Spectrum of Off-Policy Estimators6 Nov 2021
- 2021On the Convergence Rate of Off-Policy Policy Optimization Methods with Density-Ratio Correction2 Jun 2021
- 2021Universal Off-Policy Evaluation26 Apr 2021
- 2021Non-asymptotic Confidence Intervals of Off-policy Evaluation: Primal and Dual Bounds9 Mar 2021
- 2021Instabilities of Offline RL with Pre-Trained Neural Representation8 Mar 2021
- 2021Finite Sample Analysis of Minimax Offline Reinforcement Learning: Completeness, Fast Rates and First-Order Efficiency5 Feb 2021
- 2020What are the Statistical Limits of Offline RL with Linear Function Approximation?22 Oct 2020