Cascading Bandits With Feedback
R Sri Prakash, Nikhil Karamchandani, Sharayu Moharir

TL;DR
This paper analyzes a cascade bandit model for edge inference, comparing four policies and highlighting the importance of adaptivity for minimizing regret in uncertain environments.
Contribution
It provides theoretical regret guarantees for four decision policies in cascade bandits with feedback, emphasizing the benefits of adaptive strategies over fixed ones.
Findings
LCB and Thompson Sampling achieve constant O(1) regret.
Explore-then-Commit and Action Elimination incur higher, suboptimal regret.
Simulations confirm the importance of adaptivity for efficient edge inference.
Abstract
Motivated by the challenges of edge inference, we study a variant of the cascade bandit model in which each arm corresponds to an inference model with an associated accuracy and error probability. We analyse four decision-making policies-Explore-then-Commit, Action Elimination, Lower Confidence Bound (LCB), and Thompson Sampling-and provide sharp theoretical regret guarantees for each. Unlike in classical bandit settings, Explore-then-Commit and Action Elimination incur suboptimal regret because they commit to a fixed ordering after the exploration phase, limiting their ability to adapt. In contrast, LCB and Thompson Sampling continuously update their decisions based on observed feedback, achieving constant O(1) regret. Simulations corroborate these theoretical findings, highlighting the crucial role of adaptivity for efficient edge inference under uncertainty.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
