mlsanityData to 14 Oct 2026

Exploration vs Exploitation vs Safety: Risk-averse Multi-Armed Bandits

arXiv 1401.1123 ↗First posted 6 Jan 2014cs.LGcited by 26

Not on the map. Why?

Abstract (arXiv)

Motivated by applications in energy management, this paper presents the Multi-Armed Risk-Aware Bandit (MARAB) algorithm. With the goal of limiting the exploration of risky arms, MARAB takes as arm quality its conditional value at risk. When the user-supplied risk level goes to 0, the arm quality tends toward the essential infimum of the arm distribution density, and MARAB tends toward the MIN multi-armed bandit algorithm, aimed at the arm with maximal minimal value. As a first contribution, this paper presents a theoretical analysis of the MIN algorithm under mild assumptions, establishing its robustness comparatively to UCB. The analysis is supported by extensive experimental validation of MIN and MARAB compared to UCB and state-of-art risk-aware MAB algorithms on artificial and real-world problems.

Key facts. Cited by 26 papers in the map (data through 14 Oct 2026). First posted on arXiv 6 Jan 2014.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 11; 2022: 5; 2023: 2; 2024: 2; 2025: 3; 2026: 3.

26 papers.

Sort:

  1. 2021Learning to Map for Active Semantic Goal Navigationcited by 50
  2. 2021Reinforcement Learning with Dynamic Convex Risk Measurescited by 21
  3. 2021The Fragility of Optimized Bandit Algorithmscited by 17
  4. 2024Safe Active Learning for Time-Series Modeling with Gaussian Processescited by 12
  5. 2021A Unifying Theory of Thompson Sampling for Continuous Risk-Averse Banditscited by 9
  6. 2021Spectral risk-based learning using unbounded lossescited by 8
  7. 2021Model-Free Risk-Sensitive Reinforcement Learningcited by 7
  8. 2021ESCADA: Efficient Safety and Context Aware Dose Allocation for Precision Medicinecited by 5
  9. 2022The Survival Bandit Problemcited by 4
  10. 2022Safe Online Bid Optimization with Return on Investment and Budget Constraintscited by 3
  11. 2021Continuous Mean-Covariance Banditscited by 2
  12. 2021Thompson Sampling for Gaussian Entropic Risk Banditscited by 2
14 more
  1. 2021Risk-Aware Algorithms for Combinatorial Semi-Banditscited by 2
  2. 2021Risk averse non-stationary multi-armed banditscited by 1
  3. 2022Risk-averse Contextual Multi-armed Bandit Problem with Linear Payoffscited by 1
  4. 2022Risk-aware linear bandits with convex losscited by 1
  5. 2024Future Aware Safe Active Learning of Time Varying Systems using Gaussian Processescited by 1
  6. 2025Constrained Online Decision-Making: A Unified Frameworkcited by 1
  7. 2025Order Optimal Regret Bounds for Sharpe Ratio Optimization under Thompson Samplingcited by 1
  8. 2022Understanding the stochastic dynamics of sequential decision-making processes: A path-integral analysis of multi-armed banditscited by 0
  9. 2023Balancing Risk and Reward: An Automated Phased Release Strategycited by 0
  10. 2023A Risk-Averse Framework for Non-Stationary Stochastic Multi-Armed Banditscited by 0
  11. 2025Conformal bandits: bringing statistical validity and reward efficiency under weak arm separabilitycited by 0
  12. 2026Risk-Averse Wasserstein Distributionally Robust Online Learningcited by 0
  13. 2026Concave Statistical Utility Maximization Bandits via Influence-Function Gradientscited by 0
  14. 2026Conformal-Style Quantile Analyses for Stochastic Banditscited by 0