Regret lower bound and optimal algorithm for high-dimensional contextual linear bandit (Q2074307)
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 7471515
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Regret lower bound and optimal algorithm for high-dimensional contextual linear bandit |
scientific article; zbMATH DE number 7471515 |
Statements
Regret lower bound and optimal algorithm for high-dimensional contextual linear bandit (English)
0 references
9 February 2022
0 references
contextual linear bandit
0 references
high-dimension
0 references
minimax regret
0 references
sparsity
0 references
upper confidence bound
0 references
0.7801520824432373
0 references
0.7607442140579224
0 references
0.760331392288208
0 references
0.7467219829559326
0 references
0.743779718875885
0 references
