AI Paper Atlas

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

Projection-free Decentralized Online Learning for Submodular Maximization over Time-Varying Networks

Junlong Zhu, Qingtao Wu, Mingchuan Zhang, Ruijuan Zheng, Keqin Li

JMLR 2021 · Bandits and online learning › Online convex optimization and games · approach: Parameter-free non-stationary online learning · 8 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 Meta-Frank-Wolfe (DMFW) instead of distributed online gradient descent (DOGD) or DOSFWdecentralized online submodular maximization, 100 nodes, complete graph · MovieLens and Jester(1-1/e)-regret / TImproved
increase the number of nodes (ablation)DMFW · MovieLens and Jester(1-1/e)-regret / THurt
use complete graph instead of cycle or Watts-Strogatz topology (better connectivity) (ablation)DMFW, 100 nodes · MovieLens and Jester(1-1/e)-regret / TImproved
run DMFW decentralized rather than centralized MFWDMFW · MovieLens and Jester(1-1/e)-regret / TNo 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