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. 1702.05186
  4. Cited By
The Simulator: Understanding Adaptive Sampling in the
  Moderate-Confidence Regime
v1v2 (latest)

The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime

16 February 2017
Max Simchowitz
Kevin Jamieson
Benjamin Recht
ArXiv (abs)PDFHTML

Papers citing "The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime"

47 / 47 papers shown
Title
On the Problem of Best Arm Retention
On the Problem of Best Arm Retention
Houshuang Chen
Yuchen He
Chihao Zhang
81
0
0
16 Apr 2025
Evolution of Information in Interactive Decision Making: A Case Study for Multi-Armed Bandits
Yuzhou Gu
Yanjun Han
Jian Qian
90
0
0
01 Mar 2025
Best-Arm Identification in Unimodal Bandits
Best-Arm Identification in Unimodal Bandits
Riccardo Poiani
Marc Jourdan
E. Kaufmann
Rémy Degenne
212
1
0
04 Nov 2024
Learning-augmented Maximum Independent Set
Learning-augmented Maximum Independent Set
Vladimir Braverman
Prathamesh Dharangutte
Vihan Shah
Chen Wang
108
5
0
16 Jul 2024
Testing the Feasibility of Linear Programs with Bandit Feedback
Testing the Feasibility of Linear Programs with Bandit Feedback
Aditya Gangrade
Aditya Gopalan
Venkatesh Saligrama
Clayton Scott
77
2
0
21 Jun 2024
Optimal Multi-Fidelity Best-Arm Identification
Optimal Multi-Fidelity Best-Arm Identification
Riccardo Poiani
Rémy Degenne
Emilie Kaufmann
Alberto Maria Metelli
Marcello Restelli
168
2
0
05 Jun 2024
Active Preference Learning for Ordering Items In- and Out-of-sample
Active Preference Learning for Ordering Items In- and Out-of-sample
Herman Bergström
Emil Carlsson
Devdatt Dubhashi
Fredrik D. Johansson
81
0
0
05 May 2024
Adaptive Algorithms for Relaxed Pareto Set Identification
Adaptive Algorithms for Relaxed Pareto Set Identification
Cyrille Kone
E. Kaufmann
Laura Richert
82
8
0
01 Jul 2023
On the Existence of a Complexity in Fixed Budget Bandit Identification
On the Existence of a Complexity in Fixed Budget Bandit Identification
Rémy Degenne
74
17
0
16 Mar 2023
Adaptive Data Depth via Multi-Armed Bandits
Adaptive Data Depth via Multi-Armed Bandits
Tavor Z. Baharav
T. Lai
50
1
0
08 Nov 2022
Revisiting Simple Regret: Fast Rates for Returning a Good Arm
Revisiting Simple Regret: Fast Rates for Returning a Good Arm
Yao Zhao
Connor James Stephens
Csaba Szepesvári
Kwang-Sung Jun
92
14
0
30 Oct 2022
PopArt: Efficient Sparse Regression and Experimental Design for Optimal
  Sparse Linear Bandits
PopArt: Efficient Sparse Regression and Experimental Design for Optimal Sparse Linear Bandits
Kyoungseok Jang
Chicheng Zhang
Kwang-Sung Jun
172
14
0
25 Oct 2022
Non-Asymptotic Analysis of a UCB-based Top Two Algorithm
Non-Asymptotic Analysis of a UCB-based Top Two Algorithm
Marc Jourdan
Rémy Degenne
120
9
0
11 Oct 2022
Active Learning with Safety Constraints
Active Learning with Safety Constraints
Romain Camilleri
Andrew Wagenmaker
Jamie Morgenstern
Lalit P. Jain
Kevin Jamieson
66
14
0
22 Jun 2022
Information-Directed Selection for Top-Two Algorithms
Information-Directed Selection for Top-Two Algorithms
Wei You
Chao Qin
Zihao Wang
Shuoguang Yang
103
14
0
24 May 2022
Approximate Top-$m$ Arm Identification with Heterogeneous Reward
  Variances
Approximate Top-mmm Arm Identification with Heterogeneous Reward Variances
Ruida Zhou
Chao Tian
32
5
0
11 Apr 2022
On the complexity of All $\varepsilon$-Best Arms Identification
On the complexity of All ε\varepsilonε-Best Arms Identification
Aymen Al Marjani
Tomás Kocák
Aurélien Garivier
97
4
0
13 Feb 2022
Almost Optimal Variance-Constrained Best Arm Identification
Almost Optimal Variance-Constrained Best Arm Identification
Yunlong Hou
Vincent Y. F. Tan
Zixin Zhong
74
13
0
25 Jan 2022
Best Arm Identification under Additive Transfer Bandits
Best Arm Identification under Additive Transfer Bandits
Ojash Neopane
Aaditya Ramdas
Aarti Singh
44
2
0
08 Dec 2021
Dealing With Misspecification In Fixed-Confidence Linear Top-m
  Identification
Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification
Clémence Réda
Andrea Tirinzoni
Rémy Degenne
64
10
0
02 Nov 2021
Online Sign Identification: Minimization of the Number of Errors in
  Thresholding Bandits
Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits
Reda Ouhamma
Rémy Degenne
Pierre Gaillard
Vianney Perchet
35
3
0
18 Oct 2021
Best-Arm Identification in Correlated Multi-Armed Bandits
Best-Arm Identification in Correlated Multi-Armed Bandits
Samarth Gupta
Gauri Joshi
Osman Yağan
31
8
0
10 Sep 2021
A Non-asymptotic Approach to Best-Arm Identification for Gaussian
  Bandits
A Non-asymptotic Approach to Best-Arm Identification for Gaussian Bandits
Antoine Barrier
Aurélien Garivier
Tomávs Kocák
41
8
0
27 May 2021
Task-Optimal Exploration in Linear Dynamical Systems
Task-Optimal Exploration in Linear Dynamical Systems
Andrew Wagenmaker
Max Simchowitz
Kevin Jamieson
86
18
0
10 Feb 2021
Efficient Pure Exploration for Combinatorial Bandits with Semi-Bandit
  Feedback
Efficient Pure Exploration for Combinatorial Bandits with Semi-Bandit Feedback
Marc Jourdan
Mojmír Mutný
Johannes Kirschner
Andreas Krause
105
32
0
21 Jan 2021
Robust Outlier Arm Identification
Robust Outlier Arm Identification
Yinglun Zhu
S. Katariya
Robert D. Nowak
24
3
0
21 Sep 2020
A New Perspective on Pool-Based Active Classification and
  False-Discovery Control
A New Perspective on Pool-Based Active Classification and False-Discovery Control
Lalit P. Jain
Kevin Jamieson
39
12
0
14 Aug 2020
An Empirical Process Approach to the Union Bound: Practical Algorithms
  for Combinatorial and Linear Bandits
An Empirical Process Approach to the Union Bound: Practical Algorithms for Combinatorial and Linear Bandits
Julian Katz-Samuels
Lalit P. Jain
Zohar Karnin
Kevin Jamieson
186
67
0
21 Jun 2020
The Influence of Shape Constraints on the Thresholding Bandit Problem
The Influence of Shape Constraints on the Thresholding Bandit Problem
J. Cheshire
Pierre Menard
Alexandra Carpentier
112
11
0
17 Jun 2020
Finding All ε-Good Arms in Stochastic Bandits
Finding All ε-Good Arms in Stochastic Bandits
Blake Mason
Lalit P. Jain
Ardhendu Shekhar Tripathy
Robert D. Nowak
62
7
0
16 Jun 2020
Crush Optimism with Pessimism: Structured Bandits Beyond Asymptotic
  Optimality
Crush Optimism with Pessimism: Structured Bandits Beyond Asymptotic Optimality
Kwang-Sung Jun
Chicheng Zhang
393
10
0
15 Jun 2020
Query complexity of heavy hitter estimation
Query complexity of heavy hitter estimation
Sahasrajit Sarmasarkar
Kota Srinivas Reddy
Nikhil Karamchandani
49
1
0
29 May 2020
Collaborative Top Distribution Identifications with Limited Interaction
Collaborative Top Distribution Identifications with Limited Interaction
Nikolai Karpov
Qin Zhang
Yuanshuo Zhou
74
27
0
20 Apr 2020
Sequential Mode Estimation with Oracle Queries
Sequential Mode Estimation with Oracle Queries
Dhruti Shah
Tuhinangshu Choudhury
Nikhil Karamchandani
Aditya Gopalan
47
6
0
19 Nov 2019
Non-Asymptotic Pure Exploration by Solving Games
Non-Asymptotic Pure Exploration by Solving Games
Rémy Degenne
Wouter M. Koolen
Pierre Ménard
93
101
0
25 Jun 2019
The True Sample Complexity of Identifying Good Arms
The True Sample Complexity of Identifying Good Arms
Julian Katz-Samuels
Kevin Jamieson
149
42
0
15 Jun 2019
Gradient Ascent for Active Exploration in Bandit Problems
Gradient Ascent for Active Exploration in Bandit Problems
Pierre Ménard
46
23
0
20 May 2019
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
62
23
0
06 Sep 2018
PAC Battling Bandits in the Plackett-Luce Model
PAC Battling Bandits in the Plackett-Luce Model
Aadirupa Saha
Aditya Gopalan
69
34
0
12 Aug 2018
Sequential Test for the Lowest Mean: From Thompson to Murphy Sampling
Sequential Test for the Lowest Mean: From Thompson to Murphy Sampling
E. Kaufmann
Wouter M. Koolen
Aurélien Garivier
79
27
0
04 Jun 2018
Approximate Ranking from Pairwise Comparisons
Approximate Ranking from Pairwise Comparisons
Reinhard Heckel
Max Simchowitz
Kannan Ramchandran
Martin J. Wainwright
81
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
76
8
0
21 Nov 2017
A KL-LUCB Bandit Algorithm for Large-Scale Crowdsourcing
A KL-LUCB Bandit Algorithm for Large-Scale Crowdsourcing
Bob Mankoff
Robert D. Nowak
Ervin Tánczos
44
5
0
11 Sep 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
54
63
0
16 Jun 2017
Structured Best Arm Identification with Fixed Confidence
Structured Best Arm Identification with Fixed Confidence
Ruitong Huang
Mohammad M. Ajallooeian
Csaba Szepesvári
Martin Müller
85
25
0
16 Jun 2017
Practical Algorithms for Best-K Identification in Multi-Armed Bandits
Practical Algorithms for Best-K Identification in Multi-Armed Bandits
Haotian Jiang
Jian Li
Mingda Qiao
40
14
0
19 May 2017
On the Gap Between Strict-Saddles and True Convexity: An Omega(log d)
  Lower Bound for Eigenvector Approximation
On the Gap Between Strict-Saddles and True Convexity: An Omega(log d) Lower Bound for Eigenvector Approximation
Max Simchowitz
A. Alaoui
Benjamin Recht
78
13
0
14 Apr 2017
1