Co-occurring keywords · papers mentioning both
Papers
A Fast Algorithm for PAC Combinatorial Pure Exploration
AAAI 2022
Combinatorial Pure Exploration with Bottleneck Reward Function
NeurIPS 2021
Combinatorial Pure Exploration with Full-Bandit or Partial Linear Feedback
AAAI 2021
Combinatorial Pure Exploration for Dueling Bandit
ICML 2020
Making the Cut: A Bandit-based Approach to Tiered Interviewing
NeurIPS 2019
Improved Learning Complexity in Combinatorial Pure Exploration Bandits
AISTATS 2016
Combinatorial Pure Exploration of Multi-Armed Bandits
NeurIPS 2014