AI Paper Atlas

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

Projection-free Distributed Online Learning in Networks

ICML 2017 · Bandits and online learning › Online convex optimization and games · approach: Parameter-free non-stationary online learning · 48 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
replace projection with linear optimization step (conditional gradient) in distributed online learningD-OCG vs D-OGD and D-ODA · multiclass classification on two LIBSVM datasets, complete graph with 9 nodesrunning time to reach average lossHelped
use distributed online conditional gradient (D-OCG) instead of centralized OCG with 1 nodeD-OCG · multiclass classification, complete graphaverage lossNo clear effect
increase network size (complete graphs with more nodes)D-OCG · aloi, complete graphs with varying node countaverage loss decrease speedHurt
improve graph connectivity (complete, Watts-Strogatz, cycle at 16 nodes) (ablation)D-OCG · aloi, 16 nodesconvergence speed of average lossHelped

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