1 code implementation • 20 Apr 2012 • Jean-Yves Audibert, Sébastien Bubeck, Gábor Lugosi
We also recover the optimal bounds for the full information setting.
no code implementations • NeurIPS 2008 • Yizao Wang, Jean-Yves Audibert, Rémi Munos
We consider multi-armed bandit problems where the number of arms is larger than the possible number of experiments.
no code implementations • NeurIPS 2007 • Jean-Yves Audibert
We consider the learning task consisting in predicting as well as the best function in a finite reference set G up to the smallest possible additive term.