Top-m identification for linear bandits

arXiv2103.10070MaRDI QIDQ6363137

Emilie Kaufmann, Andrée Delahaye-Duriez, Clémence Réda

Publication date: 18 March 2021

Abstract: Motivated by an application to drug repurposing, we propose the first algorithms to tackle the identification of the m $ge$ 1 arms with largest means in a linear bandit model, in the fixed-confidence setting. These algorithms belong to the generic family of Gap-Index Focused Algorithms (GIFA) that we introduce for Top-m identification in linear bandits. We propose a unified analysis of these algorithms, which shows how the use of features might decrease the sample complexity. We further validate these algorithms empirically on simulated data and on a simple drug repurposing task.

Has companion code repository: https://github.com/clreda/linear-top-m

This page was built for publication: Top-m identification for linear bandits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6363137)