arXiv Machine Learning
SAGE: Optimal-Stopping Peer Selection for Decentralised Federated Learning
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Sep 22
PROSE: A Theory of Optimal Stopping with Perishable Evidence for Peer Selection in Intermittently Connected Decentralised Learning
arXiv:2609.23845v1 Announce Type: new Abstract: Decentralised federated learning removes the aggregation server but makes collaboration dependent on transient peer availability. In mobile and intermi...
arXiv AI
Jul 7
Decentralised Federated Learning over Temporal Networks: The Role of Heterogeneities
arXiv:2607. 03171v1 Announce Type: cross Abstract: Decentralised federated learning, based on peer-to-peer communication, is increasingly proposed for on-device training of machine learning models, promising a privacy-preserving, communication-efficient training process with no risk of single-point failure.
arXiv Machine Learning
Jul 10
Secure Decentralized Federated Learning via Gossip and Virtual Voting
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.
arXiv Machine Learning
Aug 10
Stream Learning: Partition-Fair Gossip Learning Without Tokens
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.
arXiv Machine Learning
Aug 3
Communication-Efficient Secure Aggregation in Decentralized Learning
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.
arXiv AI
Jun 2
GRANITE : a Byzantine-Resilient Dynamic Gossip Learning Framework
arXiv:2504. 17471v2 Announce Type: replace-cross Abstract: Gossip Learning (GL) is a decentralized learning paradigm where users iteratively exchange and aggregate models with a small set of neighboring peers.