A minimax and asymptotically optimal algorithm for stochastic bandits (Q4645646): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (2 intermediate revisions by the same user not shown) | |||
| label / en | label / en | ||
A minimax and asymptotically optimal algorithm for stochastic bandits | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv classification | |||
stat.ML | |||
| Property / arXiv classification: stat.ML / rank | |||
Normal rank | |||
| Property / arXiv classification | |||
cs.LG | |||
| Property / arXiv classification: cs.LG / rank | |||
Normal rank | |||
| Property / arXiv classification | |||
math.ST | |||
| Property / arXiv classification: math.ST / rank | |||
Normal rank | |||
| Property / arXiv classification | |||
stat.TH | |||
| Property / arXiv classification: stat.TH / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1702.07211 / rank | |||
Normal rank | |||
Latest revision as of 19:26, 19 April 2024
scientific article; zbMATH DE number 6999898
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A minimax and asymptotically optimal algorithm for stochastic bandits |
scientific article; zbMATH DE number 6999898 |
Statements
10 January 2019
0 references
stochastic multi-armed bandits
0 references
regret analysis
0 references
upper confidence bound (UCB)
0 references
minimax optimality
0 references
asymptotic optimality
0 references
stat.ML
0 references
cs.LG
0 references
math.ST
0 references
stat.TH
0 references
