arXiv AI

Decentralized Federated Learning for Heterogeneous Multi-Task Semantic Communication

arXiv:2608. 15256v1 Announce Type: new Abstract: Collaborative training in distributed semantic communication (DSC) networks typically relies on decentralized federated learning (DFL).

arXiv Machine Learning
Jul 7

Air-Plan: Query-Optimized Topology Selection for Over-the-Air Decentralized Federated Learning

arXiv:2607. 04254v1 Announce Type: cross Abstract: Over-the-air (OTA) aggregation exploits the superposition property of wireless multiple-access channels to aggregate model updates from multiple devices within a single transmission slot, significantly reducing communication latency.

By Kaushal Attaluri, Rebeca P. Diaz-Redondo, Manuel Fernandez Veiga
arXiv Machine Learning
Jun 10

Inverse Probability Weighting and Age-of-Information Aggregation for Decentralized Federated Learning under Partial Reception

arXiv:2606. 10774v1 Announce Type: new Abstract: Decentralized Federated Learning (DFL) over lossy wireless networks faces two key challenges: selection bias, where updates from poor-quality links are systematically underrepresented due to partial model reception, and update staleness, where asynchronous nodes contribute outdated information.

By Chanuka A. S. Hewa Kaluannakkage, Rajkumar Buyya
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
1d ago

From Task Mixtures to Specialized Experts

The paper investigates federated learning where each client’s data consists of unknown mixtures of distinct tasks, a scenario termed compound heterogeneity. It shows that when tasks share a common feature geometry, the optimal model for a mixed client is a convex combination of task‑specific models, motivating input‑dependent routing to specialized experts. The authors propose FedSEE, a method that recovers task experts via a convex program and achieves better performance than baselines, reducing negative transfer by 2.9 points overall and 3.7 points for the worst‑served quartile.

By Hojat Allah Salehi, Mehrdad Mahdavi, Andrew Arash Mahyari, M. Hadi Amini
arXiv Machine Learning
Aug 28

A Unified Framework for Fair and Personalized Decentralized Learning under Communication Constraints

The paper introduces DMFL-SQ, a decentralized multi-task learning algorithm that integrates graph-based personalization, agnostic fairness, and compressed event-triggered communication. It provides convergence guarantees for non-convex objectives, achieving an ≠O(T^{-1/2}) stationarity rate despite sparse, quantized, and event-triggered communication, and offers PAC-Bayes generalization bounds for the fairness objective. Experiments on CIFAR-10 and the MUSMET EEG dataset show that DMFL-SQ reduces communication while preserving predictive performance and improving fairness across clients.

By Krishnendu S. Tharakan, Carlo Fischione