arXiv Machine Learning

A Large-Dimensional Analysis of Least-Squares Federated Learning via Generalized Total Variation Minimization

The paper presents a large‑dimensional analysis of Generalized Total Variation Minimization (GTVMin) for least‑squares federated learning. It shows that Lipschitz observations of the global GTVMin solution concentrate in high dimensions regardless of network structure, and derives exact analytic expressions for performance under both i.i.d. and non‑i.i.d. Gaussian mixture models. These results quantify how regularization balances local adaptation against collaboration, and are validated by experiments on synthetic and real‑world data.

arXiv Machine Learning
Sep 18

Federated Soft Clustering via Generalized Total Variation Minimization

The paper introduces federated soft clustering for devices in a federated learning network, each fitting a personalized Gaussian mixture model. It proposes Generalized Total Variation Minimization (GTVMin) to couple local maximum likelihood problems via a graph regularizer that penalizes discrepancies between connected nodes’ models. Three discrepancy measures are compared: a squared Euclidean distance requiring component matching, a Monte‑Carlo approximated Kullback‑Leibler divergence, and a closed‑form maximum mean discrepancy; all are optimized with synchronous projected gradient updates, with a convergence guarantee for the smooth MMD instance.

By Shamsiiat Abdurakhmanova, Alexander Jung
arXiv Machine Learning
Jun 10

FedSLoP: Memory-Efficient Federated Learning with Low-Rank Gradient Projection

arXiv:2604. 24012v3 Announce Type: replace Abstract: Federated learning enables a population of clients to collaboratively train machine learning models without exchanging their raw data, but standard algorithms such as FedAvg suffer from slow convergence and high communication and memory costs in heterogeneous, resource-constrained environments.

By Yutong He, Zhengyang Huang, Jiahe Geng, Kun Yuan
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
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
arXiv Machine Learning
Aug 27

Differentiated Aggregation to Improve Generalization in Federated Learning

The paper proposes a new federated learning approach called FedALS that reduces communication costs by varying aggregation frequencies across model layers. It derives tighter generalization bounds for one‑round and multi‑round federated learning, linking these bounds to local updates and data heterogeneity. Based on representation‑learning insights, the authors argue that infrequent aggregation of early layers and more frequent aggregation of final layers yields more generalizable models, especially in non‑iid settings, and demonstrate the method’s effectiveness experimentally.

By Peyman Gholami, Hulya Seferoglu