arXiv AI By Yin-Kuan Liang, Yan Gao, Yang Long

Population Scaling or Data Dilution? Dynamics of Local Topology Evolution in Decentralized Learning

Read the original on arXiv AI →

The paper investigates how scaling the number of clients in decentralized learning affects information propagation, consensus, and accuracy. By comparing a degree‑two Ring, a Static Random graph, and a locally adaptive Local‑First Heuristic Evolution (LFHE) topology on CIFAR‑10, the authors show that the Ring’s spectral gap decays as Θ(N⁻²), leading to slower convergence and higher disagreement. Experiments reveal that keeping local dataset size constant mitigates population penalties, and that LFHE can improve accuracy and consensus at the cost of increased communication.

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 AI.

arXiv AI
4d ago

Connectivity-Aware Client Selection in Decentralized Federated Learning

The paper introduces connectivity-aware client selection for decentralized federated learning, using spectral graph tools to choose a subset of structurally relevant neighbors for each client. By leveraging eigenvector embeddings and heat/diffusion kernel similarities, the method reduces communication overhead while maintaining or improving accuracy compared to uniform subsampling and full broadcasting. Experiments show up to a 3‑percentage‑point accuracy gain under strong data heterogeneity and a 50% reduction in transmitted messages.

By Usevalad Milasheuski, Monica Nicoli, Stefano Savazzi
arXiv Machine Learning
Oct 3

SeedFlood: A Step Toward Scalable Decentralized Fine-Tuning of LLMs

SeedFlood is a novel decentralized fine‑tuning method for large language models that scales to billions of parameters and hundreds of clients. It leverages the seed‑reconstructible structure of zeroth‑order gradients to reduce message sizes to near‑zero, enabling efficient flooding across the network. Experiments show SeedFlood outperforms standard zeroth‑order baselines in communication efficiency and generalization, and rivals first‑order gossip methods while incurring far less communication cost.

By Jihun Kim, Dongyeop Lee, Namhoon Lee
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.

By Arash Badie-Modiri, Chiara Boldrini, Lorenzo Valerio, J\'anos Kert\'esz, M\'arton Karsai