Continuous Mean-Covariance Bandits
Not on the map. Why?
Abstract (arXiv)
Existing risk-aware multi-armed bandit models typically focus on risk measures of individual options such as variance. As a result, they cannot be directly applied to important real-world online decision making problems with correlated options. In this paper, we propose a novel Continuous Mean-Covariance Bandit (CMCB) model to explicitly take into account option correlation. Specifically, in CMCB, there is a learner who sequentially chooses weight vectors on given options and observes random feedback according to the decisions. The agent's objective is to achieve the best trade-off between reward and risk, measured with option covariance. To capture different reward observation scenarios in practice, we consider three feedback settings, i.e., full-information, semi-bandit and full-bandit feedback. We propose novel algorithms with optimal regrets (within logarithmic factors), and provide matching lower bounds to validate their optimalities. The experimental results also demonstrate the superiority of our algorithms. To the best of our knowledge, this is the first work that considers option correlation in risk-aware bandits and explicitly quantifies how arbitrary covariance structures impact the learning performance. The novel analytical techniques we developed for exploiting the estimated covariance to build concentration and bounding the risk of selected actions based on sampling strategy properties can likely find applications in other bandit analysis and be of independent interests.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 9 of its 41 references that are in the map. First posted on arXiv 24 Feb 2021.
Builds on
9 of 41 references.
References · 9
- 2015Multi-armed Bandit Models for the Optimal Design of Clinical Trials: Benefits and Challengescited by 113
- 2016An optimal algorithm for the Thresholding Bandit Problemcited by 62
- 2016Conservative Contextual Linear Banditscited by 56
- 2020Thompson Sampling Algorithms for Mean-Variance Banditscited by 27
- 2014Exploration vs Exploitation vs Safety: Risk-averse Multi-Armed Banditscited by 26
- 2016Combinatorial semi-bandit with known covariancecited by 24
- 2016Risk-Averse Multi-Armed Bandit Problems under Mean-Variance Measurecited by 20
- 2019Distribution oblivious, risk-aware algorithms for multi-armed bandits with unbounded rewardscited by 19
- 2016Phased Exploration with Greedy Exploitation in Stochastic Combinatorial Partial Monitoring Gamescited by 4
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 0; 2025: 1.
2 papers.