Research map / Bandits and online learning / Multi-armed bandits
Firing Bandits: Optimizing Crowdfunding
Lalit Jain, Kevin Jamieson
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 |
|---|---|---|---|
| Use linear boundary policy (a t - b, a single-flip rejection) instead of FiringUCB | firing bandits policy · F1 and F2 | coins fired: about 4x more coins fired than FIRINGUCB | Improved |
| Replace UCB-style bracket search with monotone threshold stopping rule (FiringBanditsThreshold) (ablation) | FiringUCB · F1 and F2 | coins fired: F1: 387038 vs 135190; F2: 11269 vs 6439 | Improved |
| Use naive UCB with a fixed pool of coins instead of FiringUCB (large k) | naive UCB · F1 and F2 | coins fired: NaiveUCB-500000 beats FiringUCB on F1 (508438 vs 135190) but naive UCB with small k is far worse on F2 (2105 vs 6439 for | Mixed |
Closest papers by meaning
- Strategic Multi-Armed Bandit Problems Under Debt-Free Reporting (NeurIPS 2024 · similarity 0.87)
- On Multi-Armed Bandit with Impatient Arms (ICML 2024 · similarity 0.86)
- Bandits Meet Mechanism Design to Combat Clickbait in Online Recommendation (ICLR 2024 · similarity 0.85)
- Optimizing the coalition gain in Online Auctions with Greedy Structured Bandits (NeurIPS 2024 · similarity 0.84)
- Testing the Feasibility of Linear Programs with Bandit Feedback (ICML 2024 · similarity 0.84)
- Mutli-Armed Bandits with Network Interference (NeurIPS 2024 · similarity 0.84)
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.
