Batched bandit problems
From MaRDI portal
Publication:282463
DOI10.1214/15-AOS1381zbMath1338.62180arXiv1505.00369OpenAlexW1958090791MaRDI QIDQ282463
Sylvain Chassang, Erik Snowberg, Vianney Perchet, Philippe Rigollet
Publication date: 12 May 2016
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.00369
sample size determinationbatchesgrouped clinical trialsmulti-armed bandit problemsmulti-phase allocationregret boundsswitching cost
Applications of statistics to biology and medical sciences; meta analysis (62P10) Minimax procedures in statistical decision theory (62C20) Sequential statistical design (62L05)
Related Items (13)
Functional Sequential Treatment Allocation ⋮ Bayesian adaptive bandit-based designs using the Gittins index for multi-armed trials with normally distributed endpoints ⋮ Batched bandit problems ⋮ Greedy Algorithm Almost Dominates in Smoothed Contextual Bandits ⋮ Rejoinder ⋮ Online learning of energy consumption for navigation of electric vehicles ⋮ Customization of J. Bather's UCB strategy for a Gaussian multiarmed bandit ⋮ Learning the distribution with largest mean: two bandit frameworks ⋮ Gaussian two-armed bandit: limiting description ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Learning Unknown Service Rates in Queues: A Multiarmed Bandit Approach ⋮ Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Batched bandit problems
- The multi-armed bandit problem with covariates
- Kullback-Leibler upper confidence bounds for optimal sequential allocation
- UCB revisited: improved regret bounds for the stochastic multi-armed bandit problem
- Asymptotically efficient adaptive allocation rules
- Optimal few-stage designs
- Sequential experimentation in clinical trials. Design and analysis
- Multistage bandit problems
- Asymptotically optimal multistage tests of simple hypotheses
- Regret Minimization for Reserve Prices in Second-Price Auctions
- A Sequential Design for the Two Armed Bandit
- An Asymptotic Minimax Theorem for the Two Armed Bandit Problem
- A Learning Approach for Interactive Marketing to a Customer Segment
- Some Remarks on the Two-Armed Bandit
- On the Non-Existence of Tests of "Student's" Hypothesis Having Power Functions Independent of $\sigma$
- Some aspects of the sequential design of experiments
- TWO-STAGE PROCEDURES FOR ESTIMATING THE DIFFERENCE BETWEEN MEANS
- SOME PROBLEMS OF OPTIMUM SAMPLING
- A Two-Sample Test for a Linear Hypothesis Whose Power is Independent of the Variance
- Introduction to nonparametric estimation
- Finite-time analysis of the multiarmed bandit problem
This page was built for publication: Batched bandit problems