Research map / Bandits and online learning / Multi-armed bandits
Finding Optimal Arms in Non-stochastic Combinatorial Bandits with Semi-bandit Feedback and Finite Budget
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.
Closest papers by meaning
- Combinatorial Bandits for Maximum Value Reward Function under Value-Index Feedback (ICLR 2024 · similarity 0.93)
- Adversarial Combinatorial Semi-bandits with Graph Feedback (ICML 2025 · similarity 0.92)
- Oracle-Efficient Combinatorial Semi-Bandits (NeurIPS 2025 · similarity 0.91)
- Best Arm Identification in Generalized Linear Bandits via Hybrid Feedback (NeurIPS 2026 · similarity 0.91)
- Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation (NeurIPS 2026 · similarity 0.90)
- Combinatorial Stochastic-Greedy Bandit (AAAI 2024 · similarity 0.90)
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.