3.4k citations · 4.9k across the 135 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.LG2015
Cheap Bandits
Manjesh Kumar Hanawal, Venkatesh Saligrama, Michal Valko +1
We consider stochastic sequential learning problems where the learner can observe the \textit{average reward of several actions}. Such a setting is interesting in many applications…
cs.LG2015★ 31 cited
Simple regret for infinitely many armed bandits
Alexandra Carpentier, Michal Valko
We consider a stochastic bandit problem with infinitely many arms. In this setting, the learner has no chance of trying all the arms even once and has to dedicate its limited numbe…