mlsanityData to 7 Oct 2026

Stateful Offline Contextual Policy Evaluation and Learning

arXiv 2110.10081 ↗First posted 19 Oct 2021cs.LG stat.MLcited by 6

Not on the map. Why?

Abstract (arXiv)

We study off-policy evaluation and learning from sequential data in a structured class of Markov decision processes that arise from repeated interactions with an exogenous sequence of arrivals with contexts, which generate unknown individual-level responses to agent actions. This model can be thought of as an offline generalization of contextual bandits with resource constraints. We formalize the relevant causal structure of problems such as dynamic personalized pricing and other operations management problems in the presence of potentially high-dimensional user types. The key insight is that an individual-level response is often not causally affected by the state variable and can therefore easily be generalized across timesteps and states. When this is true, we study implications for (doubly robust) off-policy evaluation and learning by instead leveraging single time-step evaluation, estimating the expectation over a single arrival via data from a population, for fitted-value iteration in a marginal MDP. We study sample complexity and analyze error amplification that leads to the persistence, rather than attenuation, of confounding error over time. In simulations of dynamic and capacitated pricing, we show improved out-of-sample policy performance in this class of relevant problems.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 27 of its 70 references that are in the map. First posted on arXiv 19 Oct 2021.

Builds on

27 of 70 references.

References · 27

  1. 2016OpenAI Gymcited by 1,684
  2. 2018Is Q-learning Provably Efficient?cited by 485
  3. 2015Doubly Robust Off-policy Value Evaluation for Reinforcement Learningcited by 337
  4. 2016Data-Efficient Off-Policy Policy Evaluation for Reinforcement Learningcited by 285
  5. 2019Information-Theoretic Considerations in Batch Reinforcement Learningcited by 285
  6. 2019Batch Policy Learning under Constraintscited by 242
  7. 2013Bandits with Knapsackscited by 163
  8. 2015Doubly Robust Policy Evaluation and Optimizationcited by 158
  9. 2020Minimax-Optimal Off-Policy Evaluation with Linear Function Approximationcited by 120
  10. 2019Towards Optimal Off-Policy Evaluation for Reinforcement Learning with Marginalized Importance Samplingcited by 118
  11. 2019Double Reinforcement Learning for Efficient Off-Policy Evaluation in Markov Decision Processescited by 118
  12. 2018Offline Multi-Action Policy Learning: Generalization and Optimizationcited by 64
15 more
  1. 2016Dynamic Pricing in High-dimensionscited by 55
  2. 2019Learning When-to-Treat Policiescited by 49
  3. 2019Doubly Robust Bias Reduction in Infinite Horizon Off-Policy Estimationcited by 48
  4. 2015An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectivescited by 43
  5. 2021Semiparametric counterfactual density estimationcited by 42
  6. 2014Approximate Policy Iteration Schemes: A Comparisoncited by 39
  7. 2016Dynamic Pricing with Demand Covariatescited by 30
  8. 2021Fast Rates for the Regret of Offline Reinforcement Learningcited by 26
  9. 2019Learning in structured MDPs with convex cost functions: Improved regret bounds for inventory managementcited by 22
  10. 2020Steady State Analysis of Episodic Reinforcement Learningcited by 21
  11. 2017Policy Learning with Observational Datacited by 19
  12. 2018A Re-solving Heuristic with Uniformly Bounded Loss for Network Revenue Managementcited by 18
  13. 2019Semi-parametric dynamic contextual pricingcited by 17
  14. 2019More Efficient Off-Policy Evaluation through Regularized Targeted Learningcited by 17
  15. 2020Lookahead-Bounded Q-Learningcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 2; 2023: 1; 2024: 2; 2025: 0; 2026: 1.

6 papers.