AI Paper Atlas

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

Online Learning with Recency: Algorithms for Sliding-window Streaming Multi-armed Bandits

Vladimir Braverman, Chen Wang, Liudeng Wang, Samson Zhou

ICML 2026 · Bandits and online learning › Multi-armed bandits · approach: Pure exploration algorithms · 0 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
increase memory from 0.05W to 0.3W (ablation)eps-exploration algorithm · synthetic eps-explorationerror of returned arm: error exceeded 0.6 -> below 0.3Improved
use sliding-window algorithm instead of adapted streaming top-k baselineeps-exploration · synthetic eps-explorationerror of returned arm: 0.6 -> 0.3 (error reduced by 50%)Improved
increase memory from 0.05W to W (ablation)regret minimization algorithm · synthetic regret minimizationtotal regret: decreased by more than 50%Improved
increase memory of the baseline streaming algorithms (ablation)top-k baseline · synthetic n=1000, W=50error and regretNo 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