2016
ICML
ICML 2016
Anytime optimal algorithms in stochastic multi-armed bandits
Abstract
We introduce an anytime algorithm for stochastic multi-armed bandit with optimal distribution free and distribution dependent bounds (for a specific family of parameters). The performances of this algorithm (as well as another one motivated by the conjectured optimal bound) are evaluated empirically. A similar analysis is provided with full information, to serve as a benchmark.
🌉
Interdisciplinary Bridge
- Machine Learning and Mathematics & Optimization
🧭
Keyword Pioneer
- distribution free bound
🐣
Hot Topic Early Bird
- multi-armed bandit
🐝
Cross-Pollinator
- Artificial Intelligence, Computer Science, Data Science & Analytics, Deep Learning, Interdisciplinary, Knowledge & Reasoning, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning, Robotics, Security & Privacy