Proposes Slate-GLM-OFU and Slate-GLM-TS algorithms for logistic contextual slate bandits that achieve polynomial per-round time and sublinear regret under a diversity assumption.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient Algorithms for Logistic Contextual Slate Bandits with Bandit Feedback
Proposes Slate-GLM-OFU and Slate-GLM-TS algorithms for logistic contextual slate bandits that achieve polynomial per-round time and sublinear regret under a diversity assumption.