Search Results for author:
Found 3 papers, 1 papers with code
Regret in Online Combinatorial Optimization
We also recover the optimal bounds for the full information setting.
Algorithms for Infinitely Many-Armed Bandits
We consider multi-armed bandit problems where the number of arms is larger than the possible number of experiments.
Progressive mixture rules are deviation suboptimal
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.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
