Research map / Bandits and online learning / Online convex optimization and games
Asynchronous Decentralized Online Learning
Jiyan Jiang, Wenpeng Zhang, Jinjie GU, Wenwu Zhu
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 changed | Where | Measured | Effect |
|---|---|---|---|
| use asynchronous AD-OGP instead of synchronous D-OGP | decentralized online gradient-push · pokerhand, 64-node Watts-Strogatz | running time | Improved |
| use asynchronous AD-OGP instead of synchronous D-OGP | decentralized online gradient-push · pokerhand, varying delay levels | average loss | No clear effect |
| add asymmetric push-sum gossiping instead of symmetric gossiping (ablation) | AD-OGP · pokerhand, 64-node Watts-Strogatz, Dm=1 and 100 | average loss | Improved |
| add instantaneous model averaging instead of blocked averaging (ablation) | AD-OGP · pokerhand, 64-node Watts-Strogatz, Dl=1 and 100 | average loss | Improved |
| increase number of learners | AD-OGP · pokerhand | average loss | Hurt |
| use less connected network topology (ring vs complete) | AD-OGP · pokerhand | average loss | Hurt |
| increase processing delay level Dp from 1 to 100 | AD-OGP · pokerhand | average loss | Hurt |
| increase message delay level Dm from 1 to 100 | AD-OGP · pokerhand | average loss | Hurt |
Closest papers by meaning
- Asynchronous Decentralized SGD with Quantized and Local Updates (NeurIPS 2021 · similarity 0.90)
- Revisiting Differentially Private Algorithms for Decentralized Online Learning (ICML 2025 · similarity 0.88)
- Decentralized Online Convex Optimization with Unknown Feedback Delays (AAAI 2026 · similarity 0.88)
- A Delay-tolerant Proximal-Gradient Algorithm for Distributed Learning (ICML 2018 · similarity 0.88)
- On the Optimal Time Complexities in Decentralized Stochastic Asynchronous Optimization (NeurIPS 2024 · similarity 0.87)
- Revisiting Decentralized Online Convex Optimization with Compressed Communication (NeurIPS 2026 · similarity 0.87)
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.
