arXiv:2607. 08651v1 Announce Type: new Abstract: Decentralized federated learning (DFL) removes the central server by letting nodes exchange model updates through peer-to-peer gossip, but existing gossip-based methods often lack provenance finality and resilience to Byzantine or lazy participants.
By Amirhossein Taherpour, Xiaodong Wang
Dealing simultaneously with confidentiality and Byzantine behaviors in decentralized learning is a challenging problem. Indeed, in decentralized learning, clients train a machine learning model while keeping their data locally and share their model parameters or gradients with a set of neighbors.
arXiv:2606. 19129v1 Announce Type: cross Abstract: Dealing simultaneously with confidentiality and Byzantine behaviors in decentralized learning is a challenging problem.
By Ousmane Touat, C\'esar Sabater, Mohamed Maouche, Sonia Ben Mokhtar
arXiv:2608. 06946v1 Announce Type: cross Abstract: In gossip learning, a network of nodes trains a shared model collaboratively, without a central coordinator, by repeatedly exchanging parts of their local models.
By Fabien Mathieu (NPA), Alexandre Pham (NPA), Maria Gradinariu Potop-Butucaru (NPA), S{\'e}bastien Tixeuil (IUF, NPA)
arXiv:2405. 07708v3 Announce Type: replace Abstract: Decentralized learning (DL) enables participants to collaboratively train models without a central server, yet it faces significant scalability challenges that demand sparsification to reduce the prohibitive communication costs of peer-to-peer exchange.
By Sayan Biswas, Anne-Marie Kermarrec, Rafael Pires, Rishi Sharma, Milos Vujasinovic
arXiv:2506. 18020v3 Announce Type: replace Abstract: Robust distributed learning algorithms aim to maintain reliable performance despite the presence of misbehaving workers.
By Thomas Boudou, Batiste Le Bars, Nirupam Gupta, Aur\'elien Bellet