
A New Perspective on PoolBased Active Classification and FalseDiscovery Control
In many scientific settings there is a need for adaptive experimental de...
read it

An Empirical Process Approach to the Union Bound: Practical Algorithms for Combinatorial and Linear Bandits
This paper proposes nearoptimal algorithms for the pureexploration lin...
read it

Estimating the number and effect sizes of nonnull hypotheses
We study the problem of estimating the distribution of effect sizes (the...
read it

Active Learning for Identification of Linear Dynamical Systems
We propose an algorithm to actively estimate the parameters of a linear ...
read it

Mosaic: A SampleBased Database System for Open World Query Processing
Data scientists have relied on samples to analyze populations of interes...
read it

Sequential Experimental Design for Transductive Linear Bandits
In this paper we introduce the transductive linear bandit problem: given...
read it

The True Sample Complexity of Identifying Good Arms
We consider two multiarmed bandit problems with n arms: (i) given an ϵ ...
read it

NonAsymptotic GapDependent Regret Bounds for Tabular MDPs
This paper establishes that optimistic algorithms attain gapdependent a...
read it

SysML: The New Frontier of Machine Learning Systems
Machine learning (ML) techniques are enjoying rapidly increasing adoptio...
read it

Exploiting Reuse in PipelineAware Hyperparameter Tuning
Hyperparameter tuning of multistage pipelines introduces a significant ...
read it

PureExploration for InfiniteArmed Bandits with General Arm Reservoirs
This paper considers a multiarmed bandit game where the number of arms ...
read it

Massively Parallel Hyperparameter Tuning
Modern learning models are characterized by large hyperparameter spaces....
read it

A Bandit Approach to Multiple Testing with False Discovery Control
We propose an adaptive sampling approach for multiple testing which aims...
read it

Adaptive Sampling for Convex Regression
In this paper, we introduce the first principled adaptivesampling proce...
read it

A framework for MultiA(rmed)/B(andit) testing with online FDR control
We propose an alternative framework to existing setups for controlling f...
read it

The Simulator: Understanding Adaptive Sampling in the ModerateConfidence Regime
We propose a novel technique for analyzing adaptive sampling called the ...
read it

Finite Sample Prediction and Recovery Bounds for Ordinal Embedding
The goal of ordinal embedding is to represent items as points in a lowd...
read it

Hyperband: A Novel BanditBased Approach to Hyperparameter Optimization
Performance of machine learning algorithms depends critically on identif...
read it

BestofK Bandits
This paper studies the BestofK Bandit game: At each time the player ch...
read it

Nonstochastic Best Arm Identification and Hyperparameter Optimization
Motivated by the task of hyperparameter optimization, we introduce the n...
read it

Sparse Dueling Bandits
The dueling bandit problem is a variation of the classical multiarmed b...
read it

lil' UCB : An Optimal Exploration Algorithm for MultiArmed Bandits
The paper proposes a novel upper confidence bound (UCB) procedure for id...
read it

On Finding the Largest Mean Among Many
Sampling from distributions to find the one with the largest mean arises...
read it
Kevin Jamieson
is this you? claim profile