English

Risk-Averse Multi-Armed Bandit Problems under Mean-Variance Measure

Machine Learning 2017-08-16 v3

Abstract

The multi-armed bandit problems have been studied mainly under the measure of expected total reward accrued over a horizon of length TT. In this paper, we address the issue of risk in multi-armed bandit problems and develop parallel results under the measure of mean-variance, a commonly adopted risk measure in economics and mathematical finance. We show that the model-specific regret and the model-independent regret in terms of the mean-variance of the reward process are lower bounded by Ω(logT)\Omega(\log T) and Ω(T2/3)\Omega(T^{2/3}), respectively. We then show that variations of the UCB policy and the DSEE policy developed for the classic risk-neutral MAB achieve these lower bounds.

Keywords

Cite

@article{arxiv.1604.05257,
  title  = {Risk-Averse Multi-Armed Bandit Problems under Mean-Variance Measure},
  author = {Sattar Vakili and Qing Zhao},
  journal= {arXiv preprint arXiv:1604.05257},
  year   = {2017}
}
R2 v1 2026-06-22T13:35:06.937Z