Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability (Q5868941)
From MaRDI portal
scientific article; zbMATH DE number 7592363
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
