Optimal Multi-Fidelity Best-Arm Identification
Document type :
Communication dans un congrès avec actes
Title :
Optimal Multi-Fidelity Best-Arm Identification
Author(s) :
Poiani, Riccardo [Auteur]
Politecnico di Milano [Milan] [POLIMI]
Degenne, Rémy [Auteur]
Scool [Scool]
Kaufmann, Emilie [Auteur]
Centre National de la Recherche Scientifique [CNRS]
Scool [Scool]
Metelli, Alberto Maria [Auteur]
Politecnico di Milano [Milan] [POLIMI]
Restelli, Marcello [Auteur]
Politecnico di Milano [Milan] [POLIMI]
Politecnico di Milano [Milan] [POLIMI]
Degenne, Rémy [Auteur]
Scool [Scool]
Kaufmann, Emilie [Auteur]

Centre National de la Recherche Scientifique [CNRS]
Scool [Scool]
Metelli, Alberto Maria [Auteur]
Politecnico di Milano [Milan] [POLIMI]
Restelli, Marcello [Auteur]
Politecnico di Milano [Milan] [POLIMI]
Conference title :
Advances in Neural Information Processing Systems (NeurIPS)
City :
Vancouver (BC)
Country :
Canada
Start date of the conference :
2024-12-10
Publication date :
2024-12-10
HAL domain(s) :
Statistiques [stat]/Machine Learning [stat.ML]
English abstract : [en]
In bandit best-arm identification, an algorithm is tasked with finding the arm with highest mean reward with a specified accuracy as fast as possible. We study multi-fidelity best-arm identification, in which the algorithm ...
Show more >In bandit best-arm identification, an algorithm is tasked with finding the arm with highest mean reward with a specified accuracy as fast as possible. We study multi-fidelity best-arm identification, in which the algorithm can choose to sample an arm at a lower fidelity (less accurate mean estimate) for a lower cost. Several methods have been proposed for tackling this problem, but their optimality remain elusive, notably due to loose lower bounds on the total cost needed to identify the best arm. Our first contribution is a tight, instance-dependent lower bound on the cost complexity. The study of the optimization problem featured in the lower bound provides new insights to devise computationally efficient algorithms, and leads us to propose a gradient-based approach with asymptotically optimal cost complexity. We demonstrate the benefits of the new algorithm compared to existing methods in experiments. Our theoretical and empirical findings also shed light on an intriguing concept of optimal fidelity for each arm.Show less >
Show more >In bandit best-arm identification, an algorithm is tasked with finding the arm with highest mean reward with a specified accuracy as fast as possible. We study multi-fidelity best-arm identification, in which the algorithm can choose to sample an arm at a lower fidelity (less accurate mean estimate) for a lower cost. Several methods have been proposed for tackling this problem, but their optimality remain elusive, notably due to loose lower bounds on the total cost needed to identify the best arm. Our first contribution is a tight, instance-dependent lower bound on the cost complexity. The study of the optimization problem featured in the lower bound provides new insights to devise computationally efficient algorithms, and leads us to propose a gradient-based approach with asymptotically optimal cost complexity. We demonstrate the benefits of the new algorithm compared to existing methods in experiments. Our theoretical and empirical findings also shed light on an intriguing concept of optimal fidelity for each arm.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
ANR Project :
Collections :
Source :
Files
- document
- Open access
- Access the document
- mf_paper.pdf
- Open access
- Access the document
- 2406.03033
- Open access
- Access the document