UCB revisited: improved regret bounds for the stochastic multi-armed bandit problem (Q653803): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10998-010-3055-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1975779216 / rank | |||
Normal rank | |||
Revision as of 01:38, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | UCB revisited: improved regret bounds for the stochastic multi-armed bandit problem |
scientific article |
Statements
UCB revisited: improved regret bounds for the stochastic multi-armed bandit problem (English)
0 references
19 December 2011
0 references
A modification of the UCB algorithm developed for the stochastic multi-armed bandit problem by \textit{P. Auer, N. Cesa-Bianchi} and \textit{P. Fischer} [Mach. Learn. 47, No. 2--3, 235--256 (2002; Zbl 1012.68093)] is presented, which leads to an improvement of the regret bounds of the original UCB algorithm. Both cases of known as well as unknown horizon T are considered.
0 references
stochastic multi-armed bandit problem
0 references
UCB algorithm
0 references
regret bounds
0 references
