A Vrbo team used daily Thompson sampling to rank four recommendation models by click-through rate, but the A/B validation they report is for a previous campaign's winner, not the current one.
Optimally Confident UCB: Improved Regret for Finite-Armed Bandits
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
I present the first algorithm for stochastic finite-armed bandits that simultaneously enjoys order-optimal problem-dependent regret and worst-case regret. Besides the theoretical results, the new algorithm is simple, efficient and empirically superb. The approach is based on UCB, but with a carefully chosen confidence parameter that optimally balances the risk of failing confidence intervals against the cost of excessive optimism.
fields
cs.IR 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Accelerated learning from recommender systems using multi-armed bandit
A Vrbo team used daily Thompson sampling to rank four recommendation models by click-through rate, but the A/B validation they report is for a previous campaign's winner, not the current one.