arxiv
PublishedOctober 22, 2026 at 4:00 AM
Cascading Bandits with Noisy Observations: Algorithms and Regret Bounds
Publisher summary· verbatim
arXiv:2610.29381v1 Announce Type: new Abstract: 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. We identify a sub-class of no
Stay posted· Newsletter
Three short emails a week: Monday, Wednesday and Friday. Top movers, new models and the most-referenced story.
Your email is used only to send The Bubble Brief. Privacy policy
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivHow to Use Parallel Data for Multilingual Pretraining5harxivKIRA: A Full-Stack Reading Screening System with Dual-Pathway Analysis for Children5harxivBuilding AI Research Teams for Autonomous Discovery of Linear Attention Architectures5harxivCSD: Common-Support Distillation for Cross-Tokenizer Knowledge Transfer5hThe Bubble Brief
MON · WED · FRIRead AI insights every Monday, Wednesday and Friday — top movers, new models, story of the week.
Your email is used only to send The Bubble Brief. Privacy policy
Originally published on arxiv ↗