Cascading bandits can be made robust to adversarial click corruption using multi-instance position-based elimination, with regret logarithmic in time and linear in the corruption budget.
Thompson sampling algorithms for cascading bandits
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
baseline 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
baseline 1polarities
baseline 1representative citing papers
citing papers explorer
-
Cascading Bandits Robust to Adversarial Corruptions
Cascading bandits can be made robust to adversarial click corruption using multi-instance position-based elimination, with regret logarithmic in time and linear in the corruption budget.