Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration

4 June 2017

Papers citing "Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration"

8 / 8 papers shown

Title
Cost-Aware Optimal Pairwise Pure Exploration Di Wu Chengshuai Shi Ruida Zhou Cong Shen 41 0 0 10 Mar 2025
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
Mixture Martingales Revisited with Applications to Sequential Tests and Confidence Intervals E. Kaufmann Wouter M. Koolen 34 117 0 28 Nov 2018
Sequential Test for the Lowest Mean: From Thompson to Murphy Sampling E. Kaufmann Wouter M. Koolen Aurélien Garivier 16 25 0 04 Jun 2018
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