Asymptotically optimal algorithms for budgeted multiple play bandits (Q2331676)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Asymptotically optimal algorithms for budgeted multiple play bandits |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Asymptotically optimal algorithms for budgeted multiple play bandits |
scientific article |
Statements
Asymptotically optimal algorithms for budgeted multiple play bandits (English)
0 references
30 October 2019
0 references
budgeted bandits
0 references
Kl-UCB
0 references
knapsack bandits
0 references
multiple-play bandits
0 references
Thompson sampling
0 references
0.8087009191513062
0 references
0.7967445254325867
0 references
0.792044460773468
0 references
0.7907764911651611
0 references
0.7881321907043457
0 references
