For distributions with a known bound on an increasing convex moment, the AL1 algorithm identifies the best arm with probability at least 1-δ using asymptotically minimal expected samples as δ goes to 0.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Optimal $\delta$-Correct Best-Arm Selection for Heavy-Tailed Distributions
For distributions with a known bound on an increasing convex moment, the AL1 algorithm identifies the best arm with probability at least 1-δ using asymptotically minimal expected samples as δ goes to 0.