arXiv:2508. 12042v3 Announce Type: replace Abstract: Federated learning (FL) allows collaborative training of machine learning models across multiple parties without sharing raw data.
arXiv:2608. 02250v1 Announce Type: new Abstract: Federated learning (FL) is a popular distributed learning framework where multiple clients perform local training and a server aggregates the locally updated models.
The paper introduces a latent information sharing scheme for federated learning that mitigates client drift by sharing a small amount of hidden‑layer activations. The authors demonstrate both theoretically and empirically that this approach improves training efficiency while maintaining convergence guarantees and data privacy. Compared to existing methods such as FedProx, SCAFFOLD, FedPVR, FedProto, and SplitFed, the proposed method achieves higher model accuracy within a fixed round budget without adding significant communication overhead.
FairMean is a new approach for distributed learning that addresses the conflict between fairness and robustness to label poisoning attacks. It assigns weights to client gradients based on a bounded, nondecreasing function of local loss, giving higher weight to high‑loss clients to promote fairness while limiting the influence of poisoned clients. The method is shown to improve fairness compared to standard average‑loss minimization and to reduce accuracy variance while boosting worst‑client accuracy in experiments.
arXiv:2605. 23145v2 Announce Type: replace-cross Abstract: Individual fairness, the notion that "similar individuals should be treated similarly," provides a strong and flexible fairness guarantee for algorithmic decision makers.
Federated Learning (FL) enables collaborative model training across distributed client devices while preserving data privacy. However, FL faces significant challenges due to data heterogeneity, particularly in terms of label distribution skewness and variations in dataset sizes, which can lead to biased model updates and hinder convergence.
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.
arXiv:2602.08589v2 Announce Type: replace Abstract: PageRank (PR) is a fundamental algorithm in graph machine learning tasks. Owing to the increasing importance of algorithmic fairness, we consider t...
arXiv:2608. 12108v1 Announce Type: new Abstract: Federated learning (FL) enables collaborative model training across distributed clients while keeping data local.
arXiv:2606. 17810v1 Announce Type: cross Abstract: In this paper, we establish a set of theoretical impossibility results, termed the No-Free-Fairness theorems, that identify three fundamental sources of disparity in learning systems.
arXiv:2606. 00656v1 Announce Type: cross Abstract: Ensuring fair and equitable treatment across diverse groups, particularly in multi-class classification tasks, poses a significant challenge due to the persistent biases inherent in machine learning models.
arXiv:2504. 21296v2 Announce Type: replace Abstract: Graph learning has evolved into Augmented Graph Learning (AGL) by integrating specialized machine learning (ML) techniques.
arXiv:2608. 09221v1 Announce Type: cross Abstract: Federated Learning (FL) enables collaborative model training across distributed client devices while preserving data privacy.