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

21 November 2017

Papers citing "Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm"

4 / 4 papers shown

Title
The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime Max Simchowitz Kevin Jamieson Benjamin Recht 128 66 0 16 Feb 2017
Efficient and Parsimonious Agnostic Active Learning Tzu-Kuo Huang Alekh Agarwal Daniel J. Hsu John Langford Robert Schapire 132 47 0 29 Jun 2015
Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices Yudong Chen Jiaming Xu 233 216 0 06 Feb 2014
On combinatorial testing problems L. Addario-Berry N. Broutin Luc Devroye Gábor Lugosi 115 114 0 24 Aug 2009