Risk averse non-stationary multi-armed bandits
Not on the map. Why?
Abstract (arXiv)
This paper tackles the risk averse multi-armed bandits problem when incurred losses are non-stationary. The conditional value-at-risk (CVaR) is used as the objective function. Two estimation methods are proposed for this objective function in the presence of non-stationary losses, one relying on a weighted empirical distribution of losses and another on the dual representation of the CVaR. Such estimates can then be embedded into classic arm selection methods such as epsilon-greedy policies. Simulation experiments assess the performance of the arm selection algorithms based on the two novel estimation approaches, and such policies are shown to outperform naive benchmarks not taking non-stationarity into account.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 9 of its 23 references that are in the map. First posted on arXiv 28 Sep 2021.
Builds on
9 of 23 references.
References · 9
- 2019A Survey on Practical Applications of Multi-Armed and Contextual Banditscited by 45
- 2014Exploration vs Exploitation vs Safety: Risk-averse Multi-Armed Banditscited by 26
- 2020Optimal Thompson Sampling strategies for support-aware CVaR banditscited by 26
- 2018Concentration bounds for empirical conditional value-at-risk: The unbounded casecited by 13
- 2020Risk-Constrained Thompson Sampling for CVaR Banditscited by 10
- 2020Statistically Robust, Risk-Averse Best Arm Identification in Multi-Armed Banditscited by 4
- 2021Bias-Corrected Peaks-Over-Threshold Estimation of the CVaRcited by 3
- 2019Concentration bounds for CVaR estimation: The cases of light-tailed and heavy-tailed distributionscited by 2
- 2019Risk-Averse Action Selection Using Extreme Value Theory Estimates of the CVaRcited by 2
Built on by
Citing papers per year: 2022: 1.
1 paper.
- 2022Choquet regularization for reinforcement learningcited by 2
- 2022Choquet regularization for reinforcement learning17 Aug 2022