AI Paper Atlas

Research map / Bandits and online learning / Online convex optimization and games

On Robust Streaming for Learning with Experts: Algorithms and Lower Bounds

David Woodruff, Fred Zhang, Samson Zhou

NeurIPS 2023 · Bandits and online learning › Online convex optimization and games · approach: Online learning with feedback graphs

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 randomized pool-sampling algorithm instead of the deterministic pool algorithm against a white-box adversaryExperts algorithm with pools of k experts · Synthetic white-box adversary, n=100000number of mistakes: 1.98x to 3.29x more mistakesHurt
Vary target regret R from 0.05 to 0.35Deterministic and randomized pool algorithms · n=10000, M=20, T=1000number of mistakesNo clear effect
Increase T tenfold (1000 to 10000) and lower M to 10Randomized pool algorithm · n=100000mistake ratio vs deterministic: 1.98x -> 3.06xHurt

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