56 citations · 200 across the 32 of their papers we have counts for
4 papers · 2 filters
Asymptotically Optimal Information-Directed Sampling
Johannes Kirschner, Tor Lattimore, Claire Vernade +1
We introduce a simple and efficient algorithm for stochastic linear bandits with finitely many actions that is asymptotically optimal and (nearly) worst-case optimal in finite time…
The Elliptical Potential Lemma Revisited
Alexandra Carpentier, Claire Vernade, Yasin Abbasi-Yadkori
This note proposes a new proof and new perspectives on the so-called Elliptical Potential Lemma. This result is important in online learning, especially for linear stochastic bandi…
Stochastic bandits with arm-dependent delays
Anne Gael Manegueu, Claire Vernade, Alexandra Carpentier +1
Significant work has been recently dedicated to the stochastic delayed bandit setting because of its relevance in applications. The applicability of existing algorithms is however…
Non-Stationary Delayed Bandits with Intermediate Observations
Claire Vernade, Andras Gyorgy, Timothy Mann
Online recommender systems often face long delays in receiving feedback, especially when optimizing for some long-term metrics. While mitigating the effects of delays in learning i…