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
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:40, 5 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
