mlsanityData to 14 Oct 2026

The Pareto Regret Frontier for Bandits

arXiv 1511.00048 ↗First posted 30 Oct 2015cs.LGcited by 14

Not on the map. Why?

Abstract (arXiv)

Given a multi-armed bandit problem it may be desirable to achieve a smaller-than-usual worst-case regret for some special actions. I show that the price for such unbalanced worst-case regret guarantees is rather high. Specifically, if an algorithm enjoys a worst-case regret of B with respect to some action, then there must exist another action for which the worst-case regret is at least Omega(nK/B), where n is the horizon and K the number of actions. I also give upper bounds in both the stochastic and adversarial settings showing that this result cannot be improved. For the stochastic case the pareto regret frontier is characterised exactly up to constant factors.

Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). First posted on arXiv 30 Oct 2015.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 4; 2022: 4; 2023: 0; 2024: 1; 2025: 2; 2026: 3.

14 papers.

Sort: