CoCoL: A Communication Efficient Decentralized Collaborative Method for Multi-Robot Systems
Not on the map. Why?
Abstract (arXiv)
Collaborative learning enhances the performance and adaptability of multi-robot systems in complex tasks but faces significant challenges due to high communication overhead and data heterogeneity inherent in multi-robot tasks. To this end, we propose CoCoL, a Communication efficient decentralized Collaborative Learning method tailored for multi-robot systems with heterogeneous local datasets. Leveraging a mirror descent framework, CoCoL achieves remarkable communication efficiency with approximate Newton-type updates by capturing the similarity between objective functions of robots, and reduces computational costs through inexact sub-problem solutions. Furthermore, the integration of a gradient tracking scheme ensures its robustness against data heterogeneity. Experimental results on three representative multi robot collaborative learning tasks show the superiority of the proposed CoCoL in significantly reducing both the number of communication rounds and total bandwidth consumption while maintaining state-of-the-art accuracy. These benefits are particularly evident in challenging scenarios involving non-IID (non-independent and identically distributed) data distribution, streaming data, and time-varying network topologies.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 26 of its 46 references that are in the map. First posted on arXiv 28 Aug 2025.
Builds on
26 of 46 references.
References · 26
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2020Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domainscited by 2,200
- 2017Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environmentscited by 1,558
- 2021The Surprising Effectiveness of PPO in Cooperative, Multi-Agent Gamescited by 942
- 2017Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descentcited by 502
- 2020A Unified Theory of Decentralized SGD with Changing Topology and Local Updatescited by 367
- 2013Communication Efficient Distributed Optimization using an Approximate Newton-type Methodcited by 132
- 2016NEXT: In-Network Nonconvex Optimizationcited by 107
- 2018Distributed Stochastic Gradient Tracking Methodscited by 106
- 2016AIDE: Fast and Communication Efficient Distributed Optimizationcited by 43
- 2022BEER: Fast O(1/T) Rate for Decentralized Nonconvex Optimization with Communication Compressioncited by 41
14 more
- 2023Decentralized Gradient Tracking with Local Stepscited by 32
- 2023CP-SLAM: Collaborative Neural Point-based SLAM Systemcited by 32
- 2014Multi-Agent Distributed Optimization via Inexact Consensus ADMMcited by 21
- 2022On the Performance of Gradient Tracking with Local Updatescited by 21
- 2021DiNNO: Distributed Neural Network Optimization for Multi-Robot Collaborative Learningcited by 16
- 2019Robust and Communication-Efficient Collaborative Learningcited by 14
- 2021Deep Reinforcement Learning for Decentralized Multi-Robot Exploration With Macro Actionscited by 13
- 2022Decentralized Natural Policy Gradient with Variance Reduction for Collaborative Multi-Agent Reinforcement Learningcited by 8
- 2024The Effectiveness of Local Updates for Decentralized Learning under Data Heterogeneitycited by 7
- 2024MAexp: A Generic Platform for RL-based Multi-Agent Explorationcited by 7
- 2021MDPGT: Momentum-based Decentralized Policy Gradient Trackingcited by 6
- 2023Distributed Optimization Methods for Multi-Robot Systems: Part I -- A Tutorialcited by 5
- 2018A Primal-Dual Quasi-Newton Method for Exact Consensus Optimizationcited by 2
- 2024Distributed Quasi-Newton Method for Multi-Agent Optimizationcited by 2
Built on by
Not cited yet.