Risk-Averse Multi-Armed Bandits with Unobserved Confounders: A Case Study in Emotion Regulation in Mobile Health
Not on the map. Why?
Abstract (arXiv)
In this paper, we consider a risk-averse multi-armed bandit (MAB) problem where the goal is to learn a policy that minimizes the risk of low expected return, as opposed to maximizing the expected return itself, which is the objective in the usual approach to risk-neutral MAB. Specifically, we formulate this problem as a transfer learning problem between an expert and a learner agent in the presence of contexts that are only observable by the expert but not by the learner. Thus, such contexts are unobserved confounders (UCs) from the learner's perspective. Given a dataset generated by the expert that excludes the UCs, the goal for the learner is to identify the true minimum-risk arm with fewer online learning steps, while avoiding possible biased decisions due to the presence of UCs in the expert's data.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 7 of its 31 references that are in the map. First posted on arXiv 9 Sep 2022.
Builds on
7 of 31 references.
References · 7
- 2021Convex optimizationcited by 2,515
- 2013Probabilities of Causation: Bounds and Identificationcited by 90
- 2021Bounds on Causal Effects and Application to High Dimensional Datacited by 22
- 2016Risk-Averse Multi-Armed Bandit Problems under Mean-Variance Measurecited by 20
- 2020Offline Contextual Multi-armed Bandits for Mobile Health Interventions: A Case Study on Emotion Regulationcited by 13
- 2021Learning without Knowing: Unobserved Context in Continuous Transfer Reinforcement Learningcited by 4
- 2020Transfer Reinforcement Learning under Unobserved Contextual Informationcited by 3
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1.
2 papers.