2 citations · 6 across the 3 of their papers we have counts for
3 papers
Be Greedy in Multi-Armed Bandits
Matthieu Jedor, Jonathan Louëdec, Vianney Perchet
The Greedy algorithm is the simplest heuristic in sequential decision problem that carelessly takes the locally optimal choice at each round, disregarding any advantages of explori…
Lifelong Learning in Multi-Armed Bandits
Matthieu Jedor, Jonathan Louëdec, Vianney Perchet
Continuously learning and leveraging the knowledge accumulated from prior tasks in order to improve future performance is a long standing machine learning problem. In this paper, w…
Categorized Bandits
Matthieu Jedor, Jonathan Louedec, Vianney Perchet
We introduce a new stochastic multi-armed bandit setting where arms are grouped inside ``ordered'' categories. The motivating example comes from e-commerce, where a customer typica…