The thesis compiles work on graph bandits (spectral smoothness, side observations, influence maximization) and structured bandits (kernel, polymatroid, function optimization with unknown smoothness, infinite arms) to improve practicality.
Unimodal bandits: Regret lower bounds and optimal algorithms
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
-
Bandits on graphs and structures
The thesis compiles work on graph bandits (spectral smoothness, side observations, influence maximization) and structured bandits (kernel, polymatroid, function optimization with unknown smoothness, infinite arms) to improve practicality.