59 citations · 115 across the 3 of their papers we have counts for
4 papers · 1 filter
Online Learning with Feedback Graphs: Beyond Bandits
Noga Alon, Nicolò Cesa-Bianchi, Ofer Dekel +1
We study a general class of online learning problems where the feedback is specified by a graph. This class includes online prediction with expert advice and the multi-armed bandit…
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
Sébastien Bubeck, Nicolò Cesa-Bianchi
Multi-armed bandit problems are the most basic examples of sequential decision problems with an exploration-exploitation trade-off. This is the balance between staying with the opt…
Towards minimax policies for online linear optimization with bandit feedback
Sébastien Bubeck, Nicolò Cesa-Bianchi, Sham M. Kakade
We address the online linear optimization problem with bandit feedback. Our contribution is twofold. First, we provide an algorithm (based on exponential weights) with a regret of…
Efficient Learning with Partially Observed Attributes
Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, Ohad Shamir
We describe and analyze efficient algorithms for learning a linear predictor from examples when the learner can only view a few attributes of each training example. This is the cas…