ResearchTrend.AI
Making the most of your day: online learning for optimal allocation of time
v1v2 (latest)

Making the most of your day: online learning for optimal allocation of time

Etienne Boursier
Tristan Garrec
Vianney Perchet
M. Scarsini
ArXiv (abs)PDFHTML

Papers citing "Making the most of your day: online learning for optimal allocation of time"

5 / 5 papers shown
Title
Budget-Constrained Bandits over General Cost and Reward Distributions
Budget-Constrained Bandits over General Cost and Reward Distributions
Semih Cayci
A. Eryilmaz
R. Srikant
45
31
0
29 Feb 2020
Resourceful Contextual Bandits
Resourceful Contextual Bandits
Ashwinkumar Badanidiyuru
John Langford
Aleksandrs Slivkins
91
119
0
27 Feb 2014
Bandits with Knapsacks
Bandits with Knapsacks
Ashwinkumar Badanidiyuru
Robert D. Kleinberg
Aleksandrs Slivkins
88
432
0
11 May 2013
The multi-armed bandit problem with covariates
The multi-armed bandit problem with covariates
Vianney Perchet
Philippe Rigollet
441
174
0
27 Oct 2011
Fast learning rates for plug-in classifiers
Fast learning rates for plug-in classifiers
Jean-Yves Audibert
Alexandre B. Tsybakov
572
465
0
17 Aug 2007

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.