Research map / Graph learning / Graph algorithms and clustering
Exponential Graph is Provably Efficient for Decentralized Deep Training
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.
Closest papers by meaning
- Beyond Exponential Graph: Communication-Efficient Topologies for Decentralized Learning via Finite-time Convergence (NeurIPS 2023 · similarity 0.91)
- Communication-efficient SGD: From Local SGD to One-Shot Averaging (NeurIPS 2021 · similarity 0.89)
- Revisiting 1-peer exponential graph for enhancing decentralized learning efficiency (NeurIPS 2025 · similarity 0.89)
- Communication-efficient Distributed SGD with Sketching (NeurIPS 2019 · similarity 0.88)
- LOSCAR-SGD: Local SGD with Communication-Computation Overlap and Delay-Corrected Sparse Model Averaging (NeurIPS 2026 · similarity 0.87)
- Scalable Decentralized Learning with Teleportation (ICLR 2025 · similarity 0.86)
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.