Cascading Bandits with Noisy Observations: Algorithms and Regret Bounds
We propose a novel stochastic cascading bandit setup where probing an ordered shortlist of $K$ out of $L$ arms incurs position-dependent costs, and the learner observes only noisy feedback regarding each arm's true output.
By Yashaswini Kaluguri, Nikhil KaramchandaniarXiv - stat.ML
Read the full story
Originally published by arXiv - stat.ML on Oct 22, 2026.
Comments
Sign in to join the discussion.