An improved upper bound on the expected regret of UCB-type policies for a matching-selection bandit problem (Q1785430): 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.1016/j.orl.2015.08.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1640961991 / rank | |||
Normal rank | |||
Revision as of 20:11, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved upper bound on the expected regret of UCB-type policies for a matching-selection bandit problem |
scientific article |
Statements
An improved upper bound on the expected regret of UCB-type policies for a matching-selection bandit problem (English)
0 references
28 September 2018
0 references
multi-armed bandit problem
0 references
matching
0 references
regret analysis
0 references
combinatorial bandit
0 references
online learning
0 references
