AI Paper Atlas

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

The Multi-fidelity Multi-armed Bandit

Kirthevasan Kandasamy, Gautam Dasarathy, Barnabas Poczos, Jeff Schneider

NeurIPS 2016 · Bandits and online learning › Multi-armed bandits · approach: Non-stationary and structured-reward bandits · 10 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 multi-fidelity UCB (play cheap low fidelities to eliminate bad arms) instead of single-fidelity UCBMF-UCB vs UCB · Synthetic bandit simulations (Gaussian and Bernoulli problems)cumulative pseudo-regret vs capitalImproved
Replace classical UCB's uniform highest-fidelity play with fidelity switching (play cheaper fidelities for suboptimal arms)MF-UCB · Synthetic problems, per-fidelity play countsnumber of plays per fidelityImproved
Lower bound: MF-UCB matches the lower bound on arms in the set K_m^1 but may be loose on arms in K_m^2MF-UCB · Theoretical regret analysisregret vs lower boundMixed
Fidelity-switching threshold gamma_m set by psi^{-1}(cost ratio * psi(zeta_m))MF-UCB · Theoretical analysisregret boundNo clear effect

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