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. 1809.02235
  4. Cited By
A Bandit Approach to Multiple Testing with False Discovery Control

A Bandit Approach to Multiple Testing with False Discovery Control

6 September 2018
Kevin Jamieson
Lalit P. Jain
ArXivPDFHTML

Papers citing "A Bandit Approach to Multiple Testing with False Discovery Control"

15 / 15 papers shown
Title
Approximate Ranking from Pairwise Comparisons
Approximate Ranking from Pairwise Comparisons
Reinhard Heckel
Max Simchowitz
Kannan Ramchandran
Martin J. Wainwright
54
39
0
04 Jan 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
57
8
0
21 Nov 2017
Good Arm Identification via Bandit Feedback
Good Arm Identification via Bandit Feedback
H. Kano
Junya Honda
Kentaro Sakamaki
Kentaro Matsuura
Atsuyoshi Nakamura
Masashi Sugiyama
40
43
0
17 Oct 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
Optimal Rates and Tradeoffs in Multiple Testing
Optimal Rates and Tradeoffs in Multiple Testing
Maxim Rabinovich
Aaditya Ramdas
Michael I. Jordan
Martin J. Wainwright
63
20
0
15 May 2017
A unified treatment of multiple testing with prior knowledge using the
  p-filter
A unified treatment of multiple testing with prior knowledge using the p-filter
Aaditya Ramdas
Rina Foygel Barber
Martin J. Wainwright
Michael I. Jordan
52
95
0
18 Mar 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
Towards Instance Optimal Bounds for Best Arm Identification
Towards Instance Optimal Bounds for Best Arm Identification
Lijie Chen
Jian Li
Mingda Qiao
60
56
0
22 Aug 2016
An optimal algorithm for the Thresholding Bandit Problem
An optimal algorithm for the Thresholding Bandit Problem
A. Locatelli
Maurilio Gutzeit
Alexandra Carpentier
55
134
0
27 May 2016
Always Valid Inference: Bringing Sequential Analysis to A/B Testing
Always Valid Inference: Bringing Sequential Analysis to A/B Testing
Ramesh Johari
L. Pekelis
David Walsh
45
94
0
15 Dec 2015
On the Complexity of Best Arm Identification in Multi-Armed Bandit
  Models
On the Complexity of Best Arm Identification in Multi-Armed Bandit Models
E. Kaufmann
Olivier Cappé
Aurélien Garivier
188
1,025
0
16 Jul 2014
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
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
Distilled Sensing: Adaptive Sampling for Sparse Detection and Estimation
Distilled Sensing: Adaptive Sampling for Sparse Detection and Estimation
Jarvis Haupt
R. Castro
Robert D. Nowak
125
154
0
29 Jan 2010
1