AI Paper Atlas

Research map / Bandits and online learning / Multi-armed bandits

Firing Bandits: Optimizing Crowdfunding

Lalit Jain, Kevin Jamieson

ICML 2018 · Bandits and online learning › Multi-armed bandits · approach: Non-stationary and structured-reward bandits · 8 citations (OpenAlex)

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 changedWhereMeasuredEffect
Use linear boundary policy (a t - b, a single-flip rejection) instead of FiringUCBfiring bandits policy · F1 and F2coins fired: about 4x more coins fired than FIRINGUCBImproved
Replace UCB-style bracket search with monotone threshold stopping rule (FiringBanditsThreshold) (ablation)FiringUCB · F1 and F2coins fired: F1: 387038 vs 135190; F2: 11269 vs 6439Improved
Use naive UCB with a fixed pool of coins instead of FiringUCB (large k)naive UCB · F1 and F2coins fired: NaiveUCB-500000 beats FiringUCB on F1 (508438 vs 135190) but naive UCB with small k is far worse on F2 (2105 vs 6439 forMixed

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy