Information-Directed Selection for Top-Two Algorithms

v1v2v3 (latest)

Information-Directed Selection for Top-Two Algorithms

24 May 2022

ArXiv (abs)PDF HTML

Papers citing "Information-Directed Selection for Top-Two Algorithms"

11 / 11 papers shown

Title
On the Problem of Best Arm Retention Houshuang Chen Yuchen He Chihao Zhang 64 0 0 16 Apr 2025
Best-Arm Identification in Unimodal Bandits Riccardo Poiani Marc Jourdan E. Kaufmann Rémy Degenne 178 1 0 04 Nov 2024
Bandit Pareto Set Identification: the Fixed Budget Setting Cyrille Kone Emilie Kaufmann Laura Richert 68 3 0 07 Nov 2023
Top Two Algorithms Revisited Marc Jourdan Rémy Degenne Dorian Baudry R. D. Heide E. Kaufmann 54 42 0 13 Jun 2022
On Elimination Strategies for Bandit Fixed-Confidence Identification Andrea Tirinzoni Rémy Degenne 77 7 0 22 May 2022
Asymptotically Optimal Sampling Policy for Selecting Top-m Alternatives Gongbo Zhang Yijie Peng Jianghua Zhang Enlu Zhou 14 11 0 30 Nov 2021
Optimal Best-arm Identification in Linear Bandits Yassir Jedra Alexandre Proutiere 62 77 0 29 Jun 2020
Non-Asymptotic Pure Exploration by Solving Games Rémy Degenne Wouter M. Koolen Pierre Ménard 77 101 0 25 Jun 2019
Improving the Expected Improvement Algorithm Chao Qin Diego Klabjan Daniel Russo 80 137 0 29 May 2017
The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime Max Simchowitz Kevin Jamieson Benjamin Recht 130 66 0 16 Feb 2017
On the Complexity of Best Arm Identification in Multi-Armed Bandit Models E. Kaufmann Olivier Cappé Aurélien Garivier 193 1,025 0 16 Jul 2014