Regret lower bound and optimal algorithm for high-dimensional contextual linear bandit (Q2074307)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Regret lower bound and optimal algorithm for high-dimensional contextual linear bandit |
scientific article |
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
