Sample complexity of partition identification using multi-armed bandits

v1v2 (latest)

Sample complexity of partition identification using multi-armed bandits

14 November 2018

Subhashini Krishnasamy

ArXiv (abs)PDF HTML

Papers citing "Sample complexity of partition identification using multi-armed bandits"

10 / 10 papers shown

Title
Non-Asymptotic Analysis of (Sticky) Track-and-Stop Riccardo Poiani Martino Bernasconi A. Celli 33 0 0 28 May 2025
Pure Exploration with Infinite Answers Riccardo Poiani Martino Bernasconi A. Celli 32 0 0 28 May 2025
Best Arm Identification with Contextual Information under a Small Gap Masahiro Kato Masaaki Imaizumi Takuya Ishihara T. Kitagawa 71 2 0 15 Sep 2022
Optimal Best Arm Identification in Two-Armed Bandits with a Fixed Budget under a Small Gap Masahiro Kato Kaito Ariu Masaaki Imaizumi and Masahiro Nomura Chao Qin 93 3 0 12 Jan 2022
Best Arm Identification under Additive Transfer Bandits Ojash Neopane Aaditya Ramdas Aarti Singh 52 2 0 08 Dec 2021
The Role of Contextual Information in Best Arm Identification Masahiro Kato Kaito Ariu 79 18 0 26 Jun 2021
Bandits with many optimal arms R. D. Heide J. Cheshire Pierre Ménard Alexandra Carpentier 50 21 0 23 Mar 2021
Greedy k-Center from Noisy Distance Samples Neharika Jali Nikhil Karamchandani Sharayu Moharir 60 2 0 03 Nov 2020
Optimal Best-Arm Identification Methods for Tail-Risk Measures Shubhada Agrawal Wouter M. Koolen Sandeep Juneja 41 17 0 17 Aug 2020
Mixture Martingales Revisited with Applications to Sequential Tests and Confidence Intervals E. Kaufmann Wouter M. Koolen 128 123 0 28 Nov 2018