Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Contextual Combinatorial Cascading Bandits
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (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 changed | Where | Measured | Effect |
|---|---|---|---|
| Use contextual features (C3-UCB) instead of context-free CombCascade | contextual cascading bandit on synthetic data · Synthetic Data, L=200, K=4, d=20 | cumulative regret | Helped |
| Use contextual features (outer product of user and movie features) instead of CombCascade | movie recommendation on MovieLens · MovieLens, L=400, K=4, d=400 | cumulative reward ratio vs CombCascade: 3.52x (γ=1) and 3.736x (γ=0.9) | Helped |
Closest papers by meaning
- Cascading Reinforcement Learning (ICLR 2024 · similarity 0.92)
- Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation (NeurIPS 2026 · similarity 0.90)
- Stochastic contextual bandits with graph feedback: from independence number to MAS number (NeurIPS 2024 · similarity 0.89)
- From Contextual Combinatorial Semi-Bandits to Bandit List Classification: Improved Sample Complexity with Sparse Rewards (NeurIPS 2025 · similarity 0.89)
- Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Bandit (NeurIPS 2024 · similarity 0.88)
- Active Context Selection Improves Simple Regret in Contextual Bandits (NeurIPS 2026 · similarity 0.88)
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.