arXiv Machine Learning

SAGE: Optimal-Stopping Peer Selection for Decentralised Federated Learning

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 3

Communication-Efficient Secure Aggregation in Decentralized Learning

arXiv:2405. 07708v3 Announce Type: replace Abstract: Decentralized learning (DL) enables participants to collaboratively train models without a central server, yet it faces significant scalability challenges that demand sparsification to reduce the prohibitive communication costs of peer-to-peer exchange.

By Sayan Biswas, Anne-Marie Kermarrec, Rafael Pires, Rishi Sharma, Milos Vujasinovic
arXiv AI
Sep 2

Optimizing Byzantine Node Placement in Decentralized Federated Learning

The paper investigates how the strategic placement of Byzantine nodes in decentralized federated learning (DFL) affects the propagation of malicious influence across the communication graph. It introduces Byzantine Placement Influence (BPI), a measure that captures cumulative exposure of honest nodes to Byzantine sources over time, and develops algorithms to optimize BPI across various network structures and attack types. Experiments demonstrate that BPI-guided placements consistently yield highly damaging configurations, highlighting the importance of considering node placement in DFL threat models.

By Edoardo Gabrielli, Gabriele Tolomei
arXiv Machine Learning
Sep 15

Pathwise Individual Rationality in Federated Learning: A Mechanism-Architecture Co-Design

The paper investigates the trade‑off between the costs of participating in federated learning (privacy, communication, compute) and the potential gains in model performance, framing this as a game‑theoretic problem of individual rationality versus autarky. It shows that clients can remain below their local‑training baseline for many rounds and that simply capping per‑round contributions harms learning. The authors propose a new mechanism that provides short‑term participation guarantees and personalized model evaluation, demonstrating theoretically and empirically that clients can avoid short‑term losses without significantly harming overall performance, even under moderate heterogeneity.

By Amin Meghrazi, Srinivasan Parthasarathy, Andrew Perrault
arXiv Machine Learning
Sep 10

CALM: Class-wise Agreement and Label-gated Disagreement Modulation for Decentralized Federated Learning

CALM introduces a smooth trust gating mechanism for decentralized federated learning, replacing hard filtering of teacher models with class‑wise, sample‑wise, and label‑based weighting. It allows clients with heterogeneous architectures to distill knowledge from peers without a central server or shared data, even under severe non‑IID label skew. Experiments on CIFAR‑10, SVHN, OrganAMNIST, and Google Speech Commands show that CALM consistently outperforms uniform and hard‑filtered distillation and matches or exceeds other heterogeneous‑FL methods.

By Yifan Ying, Qing Tian
arXiv AI
Jun 30

Whose Side Is Your Agent On? Multi-Party Principal Loyalty in LLM Agents

arXiv:2606. 30383v1 Announce Type: new Abstract: A rapidly growing class of LLM agents is multi-party: the agent acts for a principal (who briefs it, sends follow-ups, and receives results) while also conversing in a separate channel with a counterparty whose interests may diverge (negotiating with a vendor, screening inbound requests, or mediating between employees).

By Bojie Li, Noah Shi