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

Tongyi Cao, Akshay Krishnamurthy

Browse the full COLT paper archive.