Importance weighting without importance weights: an efficient algorithm for combinatorial semi-bandits (Q2834482)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Importance weighting without importance weights: an efficient algorithm for combinatorial semi-bandits |
scientific article; zbMATH DE number 6655070
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Importance weighting without importance weights: an efficient algorithm for combinatorial semi-bandits |
scientific article; zbMATH DE number 6655070 |
Statements
22 November 2016
0 references
online learning
0 references
combinatorial optimization
0 references
bandit problems
0 references
semi-bandit feedback
0 references
follow the perturbed leader
0 references
importance weighting
0 references
0.8108251
0 references
0.80471957
0 references
0.8021823
0 references
0.79836816
0 references
0.79818404
0 references
0.79708576
0 references
0.79421586
0 references
0.7904231
0 references
Importance weighting without importance weights: an efficient algorithm for combinatorial semi-bandits (English)
0 references
