Pith. sign in

REVIEW 2 cited by

Mitigating Data Heterogeneity in Federated Learning with Data Augmentation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2206.09979 v1 pith:OCAGA7TG submitted 2022-06-20 cs.LG

classification cs.LG
keywords datafederatedaugmentationheterogeneityclientdomainlearningperformance
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Federated Learning (FL) is a prominent framework that enables training a centralized model while securing user privacy by fusing local, decentralized models. In this setting, one major obstacle is data heterogeneity, i.e., each client having non-identically and independently distributed (non-IID) data. This is analogous to the context of Domain Generalization (DG), where each client can be treated as a different domain. However, while many approaches in DG tackle data heterogeneity from the algorithmic perspective, recent evidence suggests that data augmentation can induce equal or greater performance. Motivated by this connection, we present federated versions of popular DG algorithms, and show that by applying appropriate data augmentation, we can mitigate data heterogeneity in the federated setting, and obtain higher accuracy on unseen clients. Equipped with data augmentation, we can achieve state-of-the-art performance using even the most basic Federated Averaging algorithm, with much sparser communication.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. FedPhD: Federated Pruning with Hierarchical Learning of Diffusion Models

    cs.LG 2025-07 conditional novelty 4.0 of 10

    A hierarchical federated learning method with distribution-aware aggregation and structured pruning trains diffusion models under non-IID data with lower communication cost.

  2. Addressing Label Shift in Distributed Learning via Entropy Regularization

    cs.LG 2025-02 conditional novelty 4.0 of 10

    VRLS uses entropy regularization of the predictor to improve test-to-train label density ratio estimation, and extends it to multi-node IW-ERM for distributed label shift.

Pith tools