Efficient Pure Exploration for Combinatorial Bandits with Semi-Bandit Feedback

21 January 2021

Papers citing "Efficient Pure Exploration for Combinatorial Bandits with Semi-Bandit Feedback"

8 / 8 papers shown

Title
Non-Asymptotic Analysis of (Sticky) Track-and-Stop Riccardo Poiani Martino Bernasconi A. Celli 25 0 0 28 May 2025
Pure Exploration with Infinite Answers Riccardo Poiani Martino Bernasconi A. Celli 29 0 0 28 May 2025
On the Low-Complexity of Fair Learning for Combinatorial Multi-Armed Bandit Xiaoyi Wu Bo Ji Bin Li FaML 107 0 0 01 Jan 2025
Active Exploration via Experiment Design in Markov Chains Mojmír Mutný Tadeusz Janik Andreas Krause 87 16 0 29 Jun 2022
Thompson Sampling for (Combinatorial) Pure Exploration Siwei Wang Jun Zhu 30 6 0 18 Jun 2022
Top Two Algorithms Revisited Marc Jourdan Rémy Degenne Dorian Baudry R. D. Heide E. Kaufmann 79 42 0 13 Jun 2022
$Choosing Answers in $\varepsilon$-Best-Answer Identification for Linear Bandits$ Choosing Answers in $\varepsilon$ -Best-Answer Identification for Linear Bandits Marc Jourdan Rémy Degenne 37 1 0 09 Jun 2022
$On the complexity of All $\varepsilon$-Best Arms Identification$ On the complexity of All $\varepsilon$ -Best Arms Identification Aymen Al Marjani Tomás Kocák Aurélien Garivier 90 4 0 13 Feb 2022