Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability (Q5868941)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7592363
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability |
scientific article; zbMATH DE number 7592363 |
Statements
Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability (English)
0 references
26 September 2022
0 references
contextual bandit
0 references
statistical learning
0 references
offline regression
0 references
computational efficiency
0 references
online-to-offline reduction
0 references
0.8052427768707275
0 references
0.8014963269233704
0 references
0.7724156975746155
0 references
0.7505403161048889
0 references
