AI Paper Atlas

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

Exploration Through Reward Biasing: Reward-Biased Maximum Likelihood Estimation for Stochastic Multi-Armed Bandits

ICML 2020 · Bandits and online learning › Multi-armed bandits · approach: Optimal stochastic bandit algorithms · 5 citations (OpenAlex)

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 changedWhereMeasuredEffect
Bias the likelihood toward parameters with higher possible rewardRBMLE · Exponential-family and sub-Gaussian banditsregret: O(log(T))Helped
Choose the bias growth rate as α(t)=Cα log t with a sufficiently large CαRBMLE · Gaussian and sub-Gaussian banditsregret: O(log(T))Helped
Estimate the minimum gap adaptively when selecting the bias growth rateRBMLE · Gaussian and sub-Gaussian banditsregret: O(log(T))Helped
Use RBMLE rather than integral-estimating IDS or VIDSBandit algorithms · Bernoulli, Gaussian, and Exponential banditscomputation time per decision: orders of magnitude less computation timeHelped
Use knowledge-gradient methods on discrete Bernoulli rewardsKG, KGMin, and KGMN · Bernoulli banditscumulative regretHurt

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