A contextual dueling bandit algorithm asks users to compare each new item against a past item for free, achieving O(sqrt(T)) regret after a short random exploration phase.
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
CONDITIONAL 1representative citing papers
citing papers explorer
-
Recycling History: Efficient Recommendations from Contextual Dueling Bandits
A contextual dueling bandit algorithm asks users to compare each new item against a past item for free, achieving O(sqrt(T)) regret after a short random exploration phase.