Research map / Bandits and online learning / Multi-armed bandits
Censored Semi-Bandits: A Framework for Resource Allocation with Censored Feedback
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 |
|---|---|---|---|
| Increase the resource amount Q | CSB-ST on Instance 1 · Synthetic Instance 1 | regret | Hurt |
| Decrease the common threshold θ_c | CSB-ST on Instance 1 · Synthetic Instance 1 | regret | Hurt |
| Use Thompson Sampling rather than a UCB-type index | CSB-DT · Synthetic Instance 2 | regret | Helped |
Closest papers by meaning
- Finding Optimal Arms in Non-stochastic Combinatorial Bandits with Semi-bandit Feedback and Finite Budget (NeurIPS 2022 · similarity 0.91)
- Combinatorial Bandits for Maximum Value Reward Function under Value-Index Feedback (ICLR 2024 · similarity 0.90)
- Combinatorial semi-bandit with known covariance (NeurIPS 2016 · similarity 0.89)
- Causal Bandits: The Pareto Optimal Frontier of Adaptivity, a Reduction to Linear Bandits, and Limitations around Unknown Marginals (ICML 2024 · similarity 0.88)
- Adversarial Combinatorial Semi-bandits with Graph Feedback (ICML 2025 · similarity 0.88)
- Near-Optimal Stochastic Linear Bandits with Delay (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.