Fast and Efficient Gossip Algorithms for Robust and Non-smooth Decentralized Learning

arXiv:2601.20571v2 Announce Type: replace-cross Abstract: Decentralized learning on resource-constrained edge devices demands algorithms that are communication-efficient, robust to data corruption, and lightweight in memory. State-of-the-art gossip-based methods address communication efficiency,...