12 citations · 60 across the 20 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
stat.ML2019★ 2 cited
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…
stat.ML2019★ 10 cited
Gradient Ascent for Active Exploration in Bandit Problems
Pierre Ménard
We present a new algorithm based on an gradient ascent for a general Active Exploration bandit problem in the fixed confidence setting. This problem encompasses several well studie…