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.
arXiv:2608. 15256v1 Announce Type: new Abstract: Collaborative training in distributed semantic communication (DSC) networks typically relies on decentralized federated learning (DFL).
arXiv:2505. 09854v3 Announce Type: replace Abstract: As end-user device capability increases and demand for intelligent services at the Internet's edge rises, distributed learning has emerged as a key enabling technology for the intelligent edge.
arXiv:2511.12836v2 Announce Type: replace-cross Abstract: Sampling from a target distribution induced by training data is central to Bayesian learning, with Stochastic Gradient Langevin Dynamics (SGL...
arXiv:2605. 12998v3 Announce Type: replace Abstract: Continual graph learning (CGL) aims to learn from dynamically evolving graphs while mitigating catastrophic forgetting.
arXiv:2606. 06687v1 Announce Type: new Abstract: We investigate cluster formation, involving the number and composition of clusters, in decentralized federated learning (FL) with heterogeneous machine learning (ML) optimizers.
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.
The paper surveys collaborative learning methods that move beyond traditional Euclidean data to graph-structured data. It reviews foundational principles for Euclidean settings—learning effectiveness, efficiency, and privacy—and then extends the discussion to graph data, presenting a taxonomy of distribution scenarios, statistical heterogeneities, and standardized problem formulations. The survey also outlines open challenges and future research directions in this emerging field.
arXiv:2608. 19914v1 Announce Type: new Abstract: Network topology inference from graph signals is central to graph signal processing with applications in neuroscience, sensor, and social networks.
arXiv:2509. 16959v5 Announce Type: replace-cross Abstract: When different objectives conflict with each other in multi-task learning, gradients begin to interfere and slow convergence, thereby potentially reducing the final model's performance.
arXiv:2504. 12742v2 Announce Type: replace Abstract: Decentralized Federated Learning (DFL) enables collaborative model training without relying on a central server.
arXiv:2607. 02681v1 Announce Type: cross Abstract: Integrating information across related tasks can improve estimation and prediction in transfer, multi-task, and federated learning, but contamination and heterogeneity make robust borrowing challenging.
The paper introduces MS‑WDRO, a multi‑source Wasserstein distributionally robust optimization framework for reconstructing complex network topologies from scarce target‑domain data and abundant heterogeneous source data. It fuses sources via a weighted Wasserstein barycenter, builds an ambiguity set around it, and solves a regularized Laplacian estimator using a provably convergent ADMM scheme. The authors provide finite‑sample guarantees, demonstrate that naive aggregation is suboptimal, and show through experiments on synthetic data and the ABIDE I neuroimaging dataset that MS‑WDRO outperforms seven baselines in graph recovery, sample efficiency, and diagnostic utility, especially when target samples are limited.