Regret bounds for sleeping experts and bandits
Open Access
- 29 April 2010
- journal article
- research article
- Published by Springer Nature in Machine Learning
- Vol. 80 (2-3) , 245-272
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Efficient algorithms for online decision problemsJournal of Computer and System Sciences, 2005
- From External to Internal RegretLecture Notes in Computer Science, 2005
- Finite-time Analysis of the Multiarmed Bandit ProblemMachine Learning, 2002
- The Nonstochastic Multiarmed Bandit ProblemSIAM Journal on Computing, 2002
- Adaptive Game Playing Using Multiplicative WeightsGames and Economic Behavior, 1999
- How to use expert adviceJournal of the ACM, 1997
- Using and combining predictors that specialize1997
- A dynamic allocation index for the discounted multiarmed bandit problemBiometrika, 1979
- Weighted sums of certain dependent random variablesTohoku Mathematical Journal, 1967
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963