Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm.

Tongyi Cao Akshay Krishnamurthy

Published in: COLT (2019)

Keyphrases

dynamic programming
theoretical analysis
np hard
learning algorithm
search space
average case
objective function
optimal solution
computational complexity
worst case
training data
convergence rate