Limited-adaptivity slate GLM bandit algorithms achieve the same regret as a fully adaptive algorithm, up to constants, under a diversity assumption.
Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing , pages=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Contextual Slate GLM Bandits with Limited Adaptivity
Limited-adaptivity slate GLM bandit algorithms achieve the same regret as a fully adaptive algorithm, up to constants, under a diversity assumption.