23 citations · 48 across the 5 of their papers we have counts for
5 papers
The Batch Complexity of Bandit Pure Exploration
Adrienne Tuynman, Rémy Degenne
In a fixed-confidence pure exploration problem in stochastic multi-armed bandits, an algorithm iteratively samples arms and should stop as early as possible and return the correct…
Structure Adaptive Algorithms for Stochastic Bandits
Rémy Degenne, Han Shao, Wouter M. Koolen
We study reward maximisation in a wide class of structured stochastic multi-armed bandit problems, where the mean rewards of arms satisfy some given structural constraints, e.g. li…
Gamification of Pure Exploration for Linear Bandits
Rémy Degenne, Pierre Ménard, Xuedong Shang +1
We investigate an active pure-exploration setting, that includes best-arm identification, in the context of linear stochastic bandits. While asymptotically optimal algorithms exist…
Non-Asymptotic Pure Exploration by Solving Games
Rémy Degenne, Wouter M. Koolen, Pierre Ménard
Pure exploration (aka active testing) is the fundamental task of sequentially gathering information to answer a query about a stochastic environment. Good algorithms make few mista…
Pure Exploration with Multiple Correct Answers
Rémy Degenne, Wouter M. Koolen
We determine the sample complexity of pure exploration bandit problems with multiple good answers. We derive a lower bound using a new game equilibrium argument. We show how contin…