23 citations · 48 across the 5 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2025
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…
cs.LG2019★ 12 cited
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…