arXiv AI By Usevalad Milasheuski, Monica Nicoli, Stefano Savazzi

Connectivity-Aware Client Selection in Decentralized Federated Learning

Read the original on arXiv AI →

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.

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 Machine Learning
Aug 28

Decentralized Multitask Learning over Learned Task Graphs

The paper presents a decentralized multitask learning framework that learns task relationships directly from distributed data. It introduces a two‑phase strategy: first estimating a generalized graph Laplacian from noisy stochastic gradient iterates, then using the learned graph to facilitate cooperative multitask diffusion learning. The authors provide theoretical analysis of Laplacian estimation error, its impact on steady‑state performance, and a topology sensitivity index, and confirm the benefits of learned task graphs through simulations.

By Zirui Wan, Stefan Vlaski