arXiv Machine Learning By Fabien Mathieu (NPA), Alexandre Pham (NPA), Maria Gradinariu Potop-Butucaru (NPA), S{\'e}bastien Tixeuil (IUF, NPA)

Stream Learning: Partition-Fair Gossip Learning Without Tokens

Read the original on arXiv Machine Learning →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Sep 7

Resilience Beyond Stationary Client Unavailability: Unlocking Efficient and Unbiased Federated Learning

The paper introduces FedSWE, a federated learning algorithm designed to handle non‑stationary and heterogeneous client availability without requiring prior real‑time knowledge of which devices are online. FedSWE compensates for missed computations, stabilizes global updates, and mixes local updates through implicit gossiping, all while adding only modest memory and computational overhead. The authors prove that FedSWE converges to a stationary point for non‑convex objectives and achieves linear speedup in certain scenarios, and they validate these claims with experiments on real‑world datasets featuring diverse client unavailability patterns.

By Ming Xiang, Stratis Ioannidis, Edmund Yeh, Carlee Joe-Wong, Lili Su