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

April 18, 2016 ยท Declared Dead ยท ๐Ÿ› IEEE Journal on Selected Topics in Signal Processing

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Sattar Vakili, Qing Zhao arXiv ID 1604.05257 Category cs.LG: Machine Learning Citations 94 Venue IEEE Journal on Selected Topics in Signal Processing Last Checked 4 months ago
Abstract
The multi-armed bandit problems have been studied mainly under the measure of expected total reward accrued over a horizon of length $T$. 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 $ฮฉ(\log T)$ and $ฮฉ(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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Machine Learning

Died the same way โ€” ๐Ÿ‘ป Ghosted