ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2008.06555
  4. Cited By
A New Perspective on Pool-Based Active Classification and
  False-Discovery Control

A New Perspective on Pool-Based Active Classification and False-Discovery Control

14 August 2020
Lalit P. Jain
Kevin Jamieson
ArXivPDFHTML

Papers citing "A New Perspective on Pool-Based Active Classification and False-Discovery Control"

13 / 13 papers shown
Title
A Bandit Approach to Multiple Testing with False Discovery Control
A Bandit Approach to Multiple Testing with False Discovery Control
Kevin Jamieson
Lalit P. Jain
38
23
0
06 Sep 2018
Disagreement-Based Combinatorial Pure Exploration: Sample Complexity
  Bounds and an Efficient Algorithm
Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm
Tongyi Cao
A. Krishnamurthy
52
8
0
21 Nov 2017
A framework for Multi-A(rmed)/B(andit) testing with online FDR control
A framework for Multi-A(rmed)/B(andit) testing with online FDR control
Fanny Yang
Aaditya Ramdas
Kevin Jamieson
Martin J. Wainwright
31
63
0
16 Jun 2017
Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration
Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration
Lijie Chen
Anupam Gupta
Jiacheng Li
Mingda Qiao
Ruosong Wang
113
47
0
04 Jun 2017
The Simulator: Understanding Adaptive Sampling in the
  Moderate-Confidence Regime
The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime
Max Simchowitz
Kevin Jamieson
Benjamin Recht
128
66
0
16 Feb 2017
Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection
Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection
Lijie Chen
Jian Li
Mingda Qiao
44
61
0
13 Feb 2017
Pure Exploration of Multi-armed Bandit Under Matroid Constraints
Pure Exploration of Multi-armed Bandit Under Matroid Constraints
Lijie Chen
Anupam Gupta
Jian Li
71
50
0
23 May 2016
Efficient and Parsimonious Agnostic Active Learning
Efficient and Parsimonious Agnostic Active Learning
Tzu-Kuo Huang
Alekh Agarwal
Daniel J. Hsu
John Langford
Robert Schapire
132
47
0
29 Jun 2015
lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits
lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits
Kevin Jamieson
Matthew Malloy
Robert D. Nowak
Sébastien Bubeck
84
415
0
27 Dec 2013
Concentration inequalities for sampling without replacement
Concentration inequalities for sampling without replacement
Rémi Bardenet
Odalric-Ambrym Maillard
68
167
0
16 Sep 2013
Adaptive sensing performance lower bounds for sparse signal detection
  and support estimation
Adaptive sensing performance lower bounds for sparse signal detection and support estimation
R. Castro
335
33
0
04 Jun 2012
The Geometry of Generalized Binary Search
The Geometry of Generalized Binary Search
Robert D. Nowak
88
108
0
22 Oct 2009
Importance Weighted Active Learning
Importance Weighted Active Learning
A. Beygelzimer
S. Dasgupta
John Langford
92
364
0
29 Dec 2008
1