MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Batched Bandit Problems

Author(s)
Perchet, Vianney; Rigollet, Philippe; Chassang, Sylvain; Snowberg, Erik
Thumbnail
DownloadRigollet_Batched bandit.pdf (326.4Kb)
OPEN_ACCESS_POLICY

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
Motivated by practical applications, chiefly clinical trials, we study the regret achievable for stochastic bandits under the constraint that the employed policy must split trials into a small number of batches. Our results show that a very small number of batches gives close to minimax optimal regret bounds. As a byproduct, we derive optimal policies with low switching cost for stochastic bandits.
Date issued
2015-09-24
URI
http://hdl.handle.net/1721.1/98879
Department
Massachusetts Institute of Technology. Department of Mathematics
Journal
forthcoming in Annals of Statistics
Publisher
Institute of Mathematical Statistics
Citation
Perchet, Vianney, Philippe Rigollet, Sylvain Chassang, and Erik Snowberg. "Batched Bandit Problems." Annals of Statistics (2015).
Version: Author's final manuscript
ISSN
0090-5364

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries homeMIT Libraries logo

MIT Libraries navigation

HomeSearchHours & locationsBorrow & requestResearch supportAbout the Libraries
MIT
Massachusetts Institute of Technology77 Massachusetts AvenueCambridge MA 02139-4307
All items in DSpace@MIT are protected by original copyright, with all rights reserved, unless otherwise indicated. Notify us about copyright concerns.