AI Paper Atlas

Research map / Bandits and online learning / Contextual bandits and Thompson sampling

Cascading Contextual Assortment Bandits

Hyunjun Choi, Rajan Udwani, Min-hwan Oh

NeurIPS 2023 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Oracle-efficient contextual bandits · 1 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use UCB-CCA or UCB-CCA+ (MNL choice model) instead of C3-UCB (linear click model)cascading contextual assortment bandit · Simulation N=10,K=2,M=2,d=5 and N=15,K=2,M=2,d=10cumulative regretImproved
Use contextual UCB-CCA instead of non-contextual CombCascadecascading contextual assortment bandit · Simulation N=10,K=2,M=2,d=5 and N=15,K=2,M=2,d=10cumulative regretImproved
Use UCB-CCA+ instead of UCB-CCAUCB-CCA · Simulation N=10,K=2,M=2,d=5 and N=15,K=2,M=2,d=10cumulative regretNo clear effect
Remove dependence on cascade length K and on p* in the regret bound via a max-based analysisUCB-CCA regret bound · Theoryregret boundImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy