mlsanityData to 14 Oct 2026

Optimal Policy Learning with Observational Data in Multi-Action Scenarios: Estimation, Risk Preference, and Potential Failures

arXiv 2403.20250 ↗First posted 29 Mar 2024stat.ML cs.AI cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

This paper deals with optimal policy learning (OPL) with observational data, i.e. data-driven optimal decision-making, in multi-action (or multi-arm) settings, where a finite set of decision options is available. It is organized in three parts, where I discuss respectively: estimation, risk preference, and potential failures. The first part provides a brief review of the key approaches to estimating the reward (or value) function and optimal policy within this context of analysis. Here, I delineate the identification assumptions and statistical properties related to offline optimal policy learning estimators. In the second part, I delve into the analysis of decision risk. This analysis reveals that the optimal choice can be influenced by the decision maker's attitude towards risks, specifically in terms of the trade-off between reward conditional mean and conditional variance. Here, I present an application of the proposed model to real data, illustrating that the average regret of a policy with multi-valued treatment is contingent on the decision-maker's attitude towards risk. The third part of the paper discusses the limitations of optimal data-driven decision-making by highlighting conditions under which decision-making can falter. This aspect is linked to the failure of the two fundamental assumptions essential for identifying the optimal choice: (i) overlapping, and (ii) unconfoundedness. Some conclusions end the paper.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 14 of its 47 references that are in the map. First posted on arXiv 29 Mar 2024.

Builds on

14 of 47 references.

References · 14

  1. 2019Introduction to Multi-Armed Banditscited by 481
  2. 2018Online Learning: A Comprehensive Surveycited by 205
  3. 2014Taming the Monster: A Fast and Simple Algorithm for Contextual Banditscited by 201
  4. 2018Offline Multi-Action Policy Learning: Generalization and Optimizationcited by 65
  5. 2021Imitation Learning: Progress, Taxonomies and Challengescited by 58
  6. 2020Self-Supervised Reinforcement Learning for Recommender Systemscited by 49
  7. 2015Residual Weighted Learning for Estimating Individualized Treatment Rulescited by 38
  8. 2016Recursive Partitioning for Personalization using Observational Datacited by 28
  9. 2023Randomized Gaussian Process Upper Confidence Bound with Tighter Bayesian Regret Boundscited by 16
  10. 2021High-Confidence Off-Policy (or Counterfactual) Variance Estimationcited by 8
  11. 2021Convergence Guarantees for Deep Epsilon Greedy Policy Learningcited by 6
  12. 2021Deep Upper Confidence Bound Algorithm for Contextual Bandit Ranking of Information Selectioncited by 3
2 more
  1. 2018Identifying Effects of Multivalued Treatmentscited by 2
  2. 2019Performance Effectiveness of Multimedia Information Search Using the Epsilon-Greedy Algorithmcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.