Efficient and Sharp Off-Policy Evaluation in Robust Markov Decision Processes
Andrew Bennett, Nathan Kallus, Miruna Oprescu, Wen Sun, Kaiwen Wang
摘要
We study the evaluation of a policy under best- and worst-case perturbations to a Markov decision process (MDP), using transition observations from the original MDP, whether they are generated under the same or a different policy. This is an important problem when there is the possibility of a shift between historical and future environments, due to unmeasured confounding, distributional shift, or an adversarial environment. We propose a perturbation model that allows changes in the transition kernel densities up to a given multiplicative factor or its reciprocal, extending the classic marginal sensitivity model (MSM) for single time-step decision-making to infinite-horizon RL. We characterize the sharp bounds on policy value under this model , the tightest possible bounds based on transition observations from the original MDP and we study the estimation of these bounds from such transition observations. We develop an estimator with several important guarantees: it is semiparametrically efficient, and remains so even when certain necessary nuisance functions, such as worst-case Q-functions, are estimated at slow, nonparametric rates. Our estimator is also asymptotically normal, enabling straightforward statistical inference using Wald confidence intervals. Moreover, when certain nuisances are estimated inconsistently, the estimator still provides valid, albeit possibly not sharp, bounds on the policy value. We validate these properties in numerical simulations. The combination of accounting for environment shifts from train to test (robustness), being insensitive to nuisance-function estimation (orthogonality), and addressing the challenge of learning from finite samples (inference) together leads to credible and reliable policy evaluation.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- Efficient and Sharp Off-Policy Learning under Unobserved ConfoundingKonstantin Hess, Dennis Frauen, Valentyn Melnychuk, Stefan FeuerriegelICLR 2026 · 被引用 5 次
- Pessimistic Data Integration for Policy EvaluationXiangkun Wu, Ting Li, Gholamali Aminian, Armin Behnamnia 等NeurIPS 2025 · 被引用 2 次
它引用的顶会 Paper20
- Online Robust Reinforcement Learning with Model UncertaintyYue Wang, Shaofeng ZouNeurIPS 2021 · 被引用 157 次
- Robust Reinforcement Learning using Offline DataKishan Panaganti, Zaiyan Xu, Dileep Kalathil, Mohammad GhavamzadehNeurIPS 2022 · 被引用 130 次
- Off-policy Policy Evaluation For Sequential Decisions Under Unobserved ConfoundingHongseok Namkoong, Ramtin Keramati, Steve Yadlowsky, Emma BrunskillNeurIPS 2020 · 被引用 81 次
- Confounding-Robust Policy Evaluation in Infinite-Horizon Reinforcement LearningNathan Kallus, Angela ZhouNeurIPS 2020 · 被引用 78 次
- Robust Reinforcement Learning using Least Squares Policy Iteration with Provable Performance GuaranteesKishan Panaganti Badrinath, Dileep KalathilICML 2021 · 被引用 78 次
相关 Paper
- Model-Free and Model-Based Policy Evaluation when Causality is UncertainDavid Bruns-SmithICML 2021 · 被引用 14 次
- Semiparametrically Efficient Off-Policy Evaluation in Linear Markov Decision ProcessesChuhan Xie, Wenhao Yang, Zhihua ZhangICML 2023 · 被引用 8 次
- Distributionally Robust Policy Learning under Concept DriftsJingyuan Wang, Zhimei Ren, Ruohan Zhan, Zhengyuan ZhouICML 2025
- Sharp Bounds for Generalized Causal Sensitivity AnalysisDennis Frauen, Valentyn Melnychuk, Stefan FeuerriegelNeurIPS 2023 · 被引用 36 次
- Policy Gradient for Rectangular Robust Markov Decision ProcessesNavdeep Kumar, Esther Derman, Matthieu Geist, Kfir Y. Levy 等NeurIPS 2023 · 被引用 45 次
