arXiv AI By Sarah Shitrit, Ilai Bistritz

Cordial Learning: Distributed Training with Correlated Data

Read the original on arXiv AI →

The paper introduces cordial learning, a distributed training framework for agents with correlated data, where each agent’s label depends on inputs from other agents. By sharing only low‑dimensional outputs, agents train local models that extract informative signals from peers, forming a game‑theoretic loss that depends on others’ models. The authors prove convergence to a globally optimal solution for linear models and show empirical effectiveness on structured multi‑digit MNIST tasks, even in nonlinear settings.

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