mlsanityData to 7 Oct 2026

Hyperparameter Selection Methods for Fitted Q-Evaluation with Error Guarantee

arXiv 2201.02300 ↗First posted 7 Jan 2022stat.ML cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

We are concerned with the problem of hyperparameter selection for the fitted Q-evaluation (FQE). FQE is one of the state-of-the-art method for offline policy evaluation (OPE), which is essential to the reinforcement learning without environment simulators. However, like other OPE methods, FQE is not hyperparameter-free itself and that undermines the utility in real-life applications. We address this issue by proposing a framework of approximate hyperparameter selection (AHS) for FQE, which defines a notion of optimality (called selection criteria) in a quantitative and interpretable manner without hyperparameters. We then derive four AHS methods each of which has different characteristics such as distribution-mismatch tolerance and time complexity. We also confirm in experiments that the error bound given by the theory matches empirical observations.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 12 of its 16 references that are in the map. First posted on arXiv 7 Jan 2022.

Builds on

12 of 16 references.

References · 12

  1. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
  2. 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,873
  3. 2020MOPO: Model-based Offline Policy Optimizationcited by 630
  4. 2019Batch Policy Learning under Constraintscited by 242
  5. 2018Algorithmic Framework for Model-based Deep Reinforcement Learning with Theoretical Guaranteescited by 138
  6. 2020Minimax-Optimal Off-Policy Evaluation with Linear Function Approximationcited by 120
  7. 2020Hyperparameter Selection for Offline Reinforcement Learningcited by 113
  8. 2020Batch Value-function Approximation with Only Realizabilitycited by 103
  9. 2020OR-Gym: A Reinforcement Learning Library for Operations Research Problemscited by 50
  10. 2019A Kernel Loss for Solving the Bellman Equationcited by 37
  11. 2020Accountable Off-Policy Evaluation With Kernel Bellman Statisticscited by 36
  12. 2021Towards Hyperparameter-free Policy Selection for Offline Reinforcement Learningcited by 32

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.