A Fast Algorithm for PAC Combinatorial Pure Exploration.

Noa Ben-David Sivan Sabato

Published in: AAAI (2022)

Keyphrases

upper bound
sample complexity
lower bound
special case
visual exploration
neural network
machine learning
case study
similarity measure
optimal solution
pac learning
temporal analysis