Pure Exploration of Multi-armed Bandit Under Matroid Constraints

23 May 2016

Papers citing "Pure Exploration of Multi-armed Bandit Under Matroid Constraints"

11 / 11 papers shown

Title
Matroid Semi-Bandits in Sublinear Time Ruo-Chun Tzeng Naoto Ohsaka Kaito Ariu 40 0 0 28 May 2024
Optimal Batched Best Arm Identification Tianyuan Jin Yu Yang Jing Tang Xiaokui Xiao Pan Xu 51 3 0 21 Oct 2023
Thompson Sampling for Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit Shintaro Nakamura Masashi Sugiyama 24 4 0 20 Aug 2023
A Fast Algorithm for PAC Combinatorial Pure Exploration Noa Ben-David Sivan Sabato 19 0 0 08 Dec 2021
An Empirical Process Approach to the Union Bound: Practical Algorithms for Combinatorial and Linear Bandits Julian Katz-Samuels Lalit P. Jain Zohar Karnin Kevin G. Jamieson 14 65 0 21 Jun 2020
Polynomial-time Algorithms for Multiple-arm Identification with Full-bandit Feedback Yuko Kuroki Liyuan Xu Atsushi Miyauchi Junya Honda Masashi Sugiyama 25 17 0 27 Feb 2019
Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications (Extended Version) Weiran Huang Jungseul Ok Liang-Sheng Li Wei Chen 18 61 0 04 May 2018
Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration Lijie Chen Anupam Gupta Jiacheng Li Mingda Qiao Ruosong Wang 24 47 0 04 Jun 2017
Practical Algorithms for Best-K Identification in Multi-Armed Bandits Haotian Jiang Jian Li Mingda Qiao 16 14 0 19 May 2017
Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection Lijie Chen Jian Li Mingda Qiao 18 58 0 13 Feb 2017
On the Optimal Sample Complexity for Best Arm Identification Lijie Chen Jian Li 24 59 0 12 Nov 2015