Continuous Mean-Covariance Bandits
Yihan Du, Siwei Wang, Zhixuan Fang, Longbo Huang
Abstract
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 rigorous regret analysis, and provide nearly matching lower bounds to validate their optimalities (in terms of the number of timesteps T ). 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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on1
Related papers
- Mixed-Effects Contextual BanditsKyungbok Lee, Myunghee Cho Paik, Min-hwan Oh, Gi-Soo KimAAAI 2024 · 2 citations
- Adaptive Algorithms for Multi-armed Bandit with Composite and Anonymous FeedbackSiwei Wang, Haoyun Wang, Longbo HuangAAAI 2021 · 11 citations
- Pareto Optimal Risk-Agnostic Distributional Bandits with Heavy-Tail RewardsKyungjae Lee, Dohyeong Kim, Taehyun Cho, Chaeyeon Kim et al.NeurIPS 2025
- A One-Size-Fits-All Solution to Conservative Bandit ProblemsYihan Du, Siwei Wang, Longbo HuangAAAI 2021 · 5 citations
- Distributionally-Aware Kernelized Bandit Problems for Risk AversionSho TakemoriICML 2022
