Skip to content

Latest commit

 

History

History
54 lines (54 loc) · 2.21 KB

2024-04-18-battellani24a.md

File metadata and controls

54 lines (54 loc) · 2.21 KB
title software abstract layout series publisher issn id month tex_title firstpage lastpage page order cycles bibtex_author author date address container-title volume genre issued pdf extras
Dissimilarity Bandits
We study a novel sequential decision-making setting, namely the dissimilarity bandits. At each round, the learner pulls an arm that provides a stochastic d-dimensional observation vector. The learner aims to identify the pair of arms with the maximum dissimilarity, where such an index is computed over pairs of expected observation vectors. We propose Successive Elimination for Dissimilarity (SED), a fixed-confidence best-pair identification algorithm based on sequential elimination. SED discards individual arms when there is statistical evidence that they cannot belong to a pair of most dissimilar arms and, thus, effectively exploits the structure of the setting by reusing the estimates of the expected observation vectors. We provide results on the sample complexity of SED, depending on {HP}, a novel index characterizing the complexity of identifying the pair of the most dissimilar arms. Then, we provide a sample complexity lower bound, highlighting the challenges of the identification problem for dissimilarity bandits, which is almost matched by our SED. Finally, we compare our approach over synthetically generated data and a realistic environmental monitoring domain against classical and combinatorial best-arm identification algorithms for the cases $d=1$ and $d>1$.
inproceedings
Proceedings of Machine Learning Research
PMLR
2640-3498
battellani24a
0
Dissimilarity Bandits
3637
3645
3637-3645
3637
false
Battellani, Paolo and Maria Metelli, Alberto and Trov\`{o}, Francesco
given family
Paolo
Battellani
given family
Alberto
Maria Metelli
given family
Francesco
Trovò
2024-04-18
Proceedings of The 27th International Conference on Artificial Intelligence and Statistics
238
inproceedings
date-parts
2024
4
18