AI Paper Atlas

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

Better Bounds for the Distributed Experts Problem

David Woodruff, Samson Zhou

ICLR 2026 · Bandits and online learning › Online convex optimization and games · approach: Online allocation with constraints · 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
use the distributed exponential-scaling protocol instead of offline MWUdistributed experts protocol · HPO-B (models as experts, datasets as servers)rewardImproved
raise the communication threshold, p>1 (ablation)distributed experts protocol · HPO-Btotal communicationHurt
raise the communication threshold, p<1 (ablation)distributed experts protocol · HPO-Btotal communicationImproved

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