COLDB and CONDB are the first algorithms to combine online user clustering with dueling (preference) bandits, with regret bounds that improve as users are grouped into fewer clusters.
Ee-net: Exploitation-exploration neural networks in contextual bandits
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Online Clustering of Dueling Bandits
COLDB and CONDB are the first algorithms to combine online user clustering with dueling (preference) bandits, with regret bounds that improve as users are grouped into fewer clusters.