Research map / Graph learning / Graph algorithms and clustering
Beyond Exponential Graph: Communication-Efficient Topologies for Decentralized Learning via Finite-time Convergence
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
- Communication-Efficient Topologies for Decentralized Learning with $O(1)$ Consensus Rate (NeurIPS 2022 · similarity 0.93)
- Exponential Graph is Provably Efficient for Decentralized Deep Training (NeurIPS 2021 · similarity 0.91)
- Revisiting 1-peer exponential graph for enhancing decentralized learning efficiency (NeurIPS 2025 · similarity 0.91)
- Bottleneck Communication Delay Minimization for Communication-Efficient Decentralized Learning (ICML 2026 · similarity 0.90)
- Revisiting Differentially Private Algorithms for Decentralized Online Learning (ICML 2025 · similarity 0.88)
- Scalable Decentralized Learning with Teleportation (ICLR 2025 · similarity 0.88)
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.