Off-Policy Fitted Q-Evaluation with Differentiable Function Approximators: Z-Estimation and Inference Theory
Not on the map. Why?
Abstract (arXiv)
Off-Policy Evaluation (OPE) serves as one of the cornerstones in Reinforcement Learning (RL). Fitted Q Evaluation (FQE) with various function approximators, especially deep neural networks, has gained practical success. While statistical analysis has proved FQE to be minimax-optimal with tabular, linear and several nonparametric function families, its practical performance with more general function approximator is less theoretically understood. We focus on FQE with general differentiable function approximators, making our theory applicable to neural function approximations. We approach this problem using the Z-estimation theory and establish the following results: The FQE estimation error is asymptotically normal with explicit variance determined jointly by the tangent space of the function class at the ground truth, the reward structure, and the distribution shift due to off-policy learning; The finite-sample FQE error bound is dominated by the same variance term, and it can also be bounded by function class-dependent divergence, which measures how the off-policy distribution shift intertwines with the function approximator. In addition, we study bootstrapping FQE estimators for error distribution inference and estimating confidence intervals, accompanied by a Cramer-Rao lower bound that matches our upper bounds. The Z-estimation analysis provides a generalizable theoretical framework for studying off-policy estimation in RL and provides sharp statistical theory for FQE with differentiable function approximators.
Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). Builds on 28 of its 48 references that are in the map. First posted on arXiv 10 Feb 2022.
Builds on
28 of 48 references.
References · 28
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
- 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,218
- 2019Provably Efficient Reinforcement Learning with Linear Function Approximationcited by 514
- 2015Doubly Robust Off-policy Value Evaluation for Reinforcement Learningcited by 337
- 2016Data-Efficient Off-Policy Policy Evaluation for Reinforcement Learningcited by 285
- 2019Information-Theoretic Considerations in Batch Reinforcement Learningcited by 285
- 2019Batch Policy Learning under Constraintscited by 242
- 2019A Theoretical Analysis of Deep Q-Learningcited by 212
- 2019Provably Efficient Exploration in Policy Optimizationcited by 203
- 2019On the Theory of Policy Gradient Methods: Optimality, Approximation, and Distribution Shiftcited by 174
- 2019Minimax Weight and Q-Function Learning for Off-Policy Evaluationcited by 150
- 2020What are the Statistical Limits of Offline RL with Linear Function Approximation?cited by 135
16 more
- 2020Minimax-Optimal Off-Policy Evaluation with Linear Function Approximationcited by 120
- 2019Towards Optimal Off-Policy Evaluation for Reinforcement Learning with Marginalized Importance Samplingcited by 118
- 2019Double Reinforcement Learning for Efficient Off-Policy Evaluation in Markov Decision Processescited by 118
- 2019Optimism in Reinforcement Learning with Generalized Linear Function Approximationcited by 111
- 2020Provably Efficient Reinforcement Learning for Discounted MDPs with Feature Mappingcited by 102
- 2020Statistical Inference of the Value Function for Reinforcement Learning in Infinite Horizon Settingscited by 65
- 2020Asymptotically Efficient Off-Policy Evaluation for Tabular Reinforcement Learningcited by 60
- 2021Finite Sample Analysis of Minimax Offline Reinforcement Learning: Completeness, Fast Rates and First-Order Efficiencycited by 54
- 2020Accountable Off-Policy Evaluation With Kernel Bellman Statisticscited by 36
- 2021Variance-Aware Off-Policy Evaluation with Linear Function Approximationcited by 34
- 2022On Well-posedness and Minimax Optimal Rates of Nonparametric Q-function Estimation in Off-policy Evaluationcited by 33
- 2020Statistical Bootstrapping for Uncertainty Estimation in Off-Policy Evaluationcited by 28
- 2020Sparse Feature Selection Makes Batch Reinforcement Learning More Sample Efficientcited by 24
- 2021Optimal policy evaluation using kernel-based temporal difference methodscited by 24
- 2020On Function Approximation in Reinforcement Learning: Optimism in the Face of Large State Spacescited by 19
- 2021An L2 Analysis of Reinforcement Learning in High Dimensions with Kernel and Neural Network Approximationcited by 13
Built on by
Citing papers per year: 2022: 6; 2023: 5; 2024: 1; 2025: 2; 2026: 4.
18 papers.
Sort:
By area:
- 2022A Review of Off-Policy Evaluation in Reinforcement Learningcited by 92
- 2022Offline Reinforcement Learning with Closed-Form Policy Improvement Operatorscited by 14
- 2022Sample Complexity of Nonparametric Off-Policy Evaluation on Low-Dimensional Manifolds using Deep Networkscited by 12
- 2022Offline Reinforcement Learning with Differentiable Function Approximation is Provably Efficientcited by 12
- 2022Offline Policy Evaluation and Optimization under Confoundingcited by 12
- 2023Policy Finetuning in Reinforcement Learning via Design of Experiments using Offline Datacited by 11
- 2023Logarithmic Switching Cost in Reinforcement Learning beyond Linear MDPscited by 8
- 2023Non-stationary Reinforcement Learning under General Function Approximationcited by 5
- 2022Offline Stochastic Shortest Path: Learning, Evaluation and Towards Optimalitycited by 3
- 2023Offline Policy Evaluation for Reinforcement Learning with Adaptively Collected Datacited by 0
- 2023Sample Complexity of Preference-Based Nonparametric Off-Policy Evaluation with Deep Networkscited by 0
- 2024Is Offline Decision Making Possible with Only Few Samples? Reliable Decisions in Data-Starved Bandits via Trust Region Enhancementcited by 0
6 more
- 2025Efficient On-Policy Reinforcement Learning via Exploration of Sparse Parameter Spacecited by 0
- 2025Realistic CDSS Drug Dosing with End-to-end Recurrent Q-learning for Dual Vasopressor Controlcited by 0
- 2026Formulating Reinforcement Learning for Human-Robot Collaboration through Off-Policy Evaluationcited by 0
- 2026Beyond Bellman: High-Order Generator Regression for Continuous-Time Policy Evaluationcited by 0
- 2026Off-Policy Evaluation for Missingness-Aware Policies in MDPs with Rewards Missing Not at Randomcited by 0
- 2026Model-based Bootstrap for Offline Policy Evaluation in Tabular Reinforcement Learningcited by 0
- 2026Model-based Bootstrap for Offline Policy Evaluation in Tabular Reinforcement Learning17 Sep 2026
- 2026Off-Policy Evaluation for Missingness-Aware Policies in MDPs with Rewards Missing Not at Random18 Jun 2026
- 2026Beyond Bellman: High-Order Generator Regression for Continuous-Time Policy Evaluation21 Apr 2026
- 2026Formulating Reinforcement Learning for Human-Robot Collaboration through Off-Policy Evaluation27 Jan 2026
- 2025Realistic CDSS Drug Dosing with End-to-end Recurrent Q-learning for Dual Vasopressor Control1 Oct 2025
- 2025Efficient On-Policy Reinforcement Learning via Exploration of Sparse Parameter Space30 Sep 2025
- 2024Is Offline Decision Making Possible with Only Few Samples? Reliable Decisions in Data-Starved Bandits via Trust Region Enhancement24 Feb 2024
- 2023Sample Complexity of Preference-Based Nonparametric Off-Policy Evaluation with Deep Networks16 Oct 2023
- 2023Policy Finetuning in Reinforcement Learning via Design of Experiments using Offline Data10 Jul 2023
- 2023Offline Policy Evaluation for Reinforcement Learning with Adaptively Collected Data24 Jun 2023
- 2023Non-stationary Reinforcement Learning under General Function Approximation1 Jun 2023
- 2023Logarithmic Switching Cost in Reinforcement Learning beyond Linear MDPs24 Feb 2023
6 more
- 2022A Review of Off-Policy Evaluation in Reinforcement Learning13 Dec 2022
- 2022Offline Policy Evaluation and Optimization under Confounding29 Nov 2022
- 2022Offline Reinforcement Learning with Closed-Form Policy Improvement Operators29 Nov 2022
- 2022Offline Reinforcement Learning with Differentiable Function Approximation is Provably Efficient3 Oct 2022
- 2022Offline Stochastic Shortest Path: Learning, Evaluation and Towards Optimality10 Jun 2022
- 2022Sample Complexity of Nonparametric Off-Policy Evaluation on Low-Dimensional Manifolds using Deep Networks6 Jun 2022
- 2022Offline Reinforcement Learning with Closed-Form Policy Improvement Operatorscited by 14
- 2022Offline Reinforcement Learning with Differentiable Function Approximation is Provably Efficientcited by 12
- 2022Offline Policy Evaluation and Optimization under Confoundingcited by 12
- 2023Offline Policy Evaluation for Reinforcement Learning with Adaptively Collected Datacited by 0
- 2026Formulating Reinforcement Learning for Human-Robot Collaboration through Off-Policy Evaluationcited by 0
- 2026Off-Policy Evaluation for Missingness-Aware Policies in MDPs with Rewards Missing Not at Randomcited by 0
- 2026Off-Policy Evaluation for Missingness-Aware Policies in MDPs with Rewards Missing Not at Random18 Jun 2026
- 2026Formulating Reinforcement Learning for Human-Robot Collaboration through Off-Policy Evaluation27 Jan 2026
- 2023Offline Policy Evaluation for Reinforcement Learning with Adaptively Collected Data24 Jun 2023
- 2022Offline Policy Evaluation and Optimization under Confounding29 Nov 2022
- 2022Offline Reinforcement Learning with Closed-Form Policy Improvement Operators29 Nov 2022
- 2022Offline Reinforcement Learning with Differentiable Function Approximation is Provably Efficient3 Oct 2022
- 2022A Review of Off-Policy Evaluation in Reinforcement Learningcited by 92
- 2022Sample Complexity of Nonparametric Off-Policy Evaluation on Low-Dimensional Manifolds using Deep Networkscited by 12
- 2023Policy Finetuning in Reinforcement Learning via Design of Experiments using Offline Datacited by 11
- 2023Logarithmic Switching Cost in Reinforcement Learning beyond Linear MDPscited by 8
- 2023Non-stationary Reinforcement Learning under General Function Approximationcited by 5
- 2022Offline Stochastic Shortest Path: Learning, Evaluation and Towards Optimalitycited by 3
- 2024Is Offline Decision Making Possible with Only Few Samples? Reliable Decisions in Data-Starved Bandits via Trust Region Enhancementcited by 0
- 2025Efficient On-Policy Reinforcement Learning via Exploration of Sparse Parameter Spacecited by 0
- 2025Realistic CDSS Drug Dosing with End-to-end Recurrent Q-learning for Dual Vasopressor Controlcited by 0
- 2026Beyond Bellman: High-Order Generator Regression for Continuous-Time Policy Evaluationcited by 0
- 2026Model-based Bootstrap for Offline Policy Evaluation in Tabular Reinforcement Learningcited by 0
- 2026Model-based Bootstrap for Offline Policy Evaluation in Tabular Reinforcement Learning17 Sep 2026
- 2026Beyond Bellman: High-Order Generator Regression for Continuous-Time Policy Evaluation21 Apr 2026
- 2025Realistic CDSS Drug Dosing with End-to-end Recurrent Q-learning for Dual Vasopressor Control1 Oct 2025
- 2025Efficient On-Policy Reinforcement Learning via Exploration of Sparse Parameter Space30 Sep 2025
- 2024Is Offline Decision Making Possible with Only Few Samples? Reliable Decisions in Data-Starved Bandits via Trust Region Enhancement24 Feb 2024
- 2023Policy Finetuning in Reinforcement Learning via Design of Experiments using Offline Data10 Jul 2023
- 2023Non-stationary Reinforcement Learning under General Function Approximation1 Jun 2023
- 2023Logarithmic Switching Cost in Reinforcement Learning beyond Linear MDPs24 Feb 2023
- 2022A Review of Off-Policy Evaluation in Reinforcement Learning13 Dec 2022
- 2022Offline Stochastic Shortest Path: Learning, Evaluation and Towards Optimality10 Jun 2022
- 2022Sample Complexity of Nonparametric Off-Policy Evaluation on Low-Dimensional Manifolds using Deep Networks6 Jun 2022