Introduces implicit exploration to achieve near-optimal regret in bandit problems with side observations and a related combinatorial setting without prior knowledge of the feedback structure.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient learning by implicit exploration in bandit problems with side observations
Introduces implicit exploration to achieve near-optimal regret in bandit problems with side observations and a related combinatorial setting without prior knowledge of the feedback structure.