Research map / Bandits and online learning / Multi-armed bandits
Contextual Combinatorial Multi-armed Bandits with Volatile Arms and Submodular Reward
Lixing Chen, Jie Xu, Zhuo Lu
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 changed | Where | Measured | Effect |
|---|---|---|---|
| make the selection submodularity-aware (CC-MAB vs CC-MAB-NS) (ablation) | CC-MAB · Yelp crowdsourcing | cumulative reward: 0.0% -> 17.1% | Improved |
| set p=1 so reward is non-submodular (ablation) | CC-MAB vs CC-MAB-NS · Yelp crowdsourcing, Dixit-Stiglitz reward | cumulative reward: 0.0% | No clear effect |
| increase submodularity strength p above 1 | CC-MAB-NS · Yelp crowdsourcing | cumulative reward loss vs CC-MAB: 0.0% -> 17.1% | Hurt |
| use context information of arms (CC-MAB, k-LinUCB, CC-MAB-NS vs UCB, Random) | bandit selection · Yelp crowdsourcing | cumulative reward | Improved |
| increase budget B from 10 toward 100 | all algorithms · Yelp crowdsourcing, 200 rounds | cumulative reward | Improved |
| submodularity-aware selection saturates earlier in budget | Oracle and CC-MAB · Yelp crowdsourcing, 200 rounds | budget at saturation: B = 50 vs B = 90 | Improved |
| increase budget B | CC-MAB · Yelp crowdsourcing | regret | Improved |
| compare CC-MAB to Oracle at all budgets | CC-MAB · Yelp crowdsourcing | cumulative reward | No clear effect |
Closest papers by meaning
- Combinatorial Stochastic-Greedy Bandit (AAAI 2024 · similarity 0.90)
- Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation (NeurIPS 2026 · similarity 0.90)
- On Multi-Armed Bandit with Impatient Arms (ICML 2024 · similarity 0.89)
- Online Clustering of Dueling Bandits (ICML 2025 · similarity 0.89)
- Pairwise Elimination with Instance-Dependent Guarantees for Bandits with Cost Subsidy (ICLR 2025 · similarity 0.88)
- Forced Exploration in Bandit Problems (AAAI 2024 · 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.
