Pith. sign in

REVIEW 1 cited by

FedGAN: Federated Generative Adversarial Networks for Distributed Data

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 2006.07228 v2 pith:V5M4OVFM submitted 2020-06-12 cs.LG cs.CVcs.MAstat.ML

classification cs.LGcs.CVcs.MAstat.ML
keywords fedgancommunicationdistributedadversarialdatadatasetsdiscriminatorfederated
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We propose Federated Generative Adversarial Network (FedGAN) for training a GAN across distributed sources of non-independent-and-identically-distributed data sources subject to communication and privacy constraints. Our algorithm uses local generators and discriminators which are periodically synced via an intermediary that averages and broadcasts the generator and discriminator parameters. We theoretically prove the convergence of FedGAN with both equal and two time-scale updates of generator and discriminator, under standard assumptions, using stochastic approximations and communication efficient stochastic gradient descents. We experiment FedGAN on toy examples (2D system, mixed Gaussian, and Swiss role), image datasets (MNIST, CIFAR-10, and CelebA), and time series datasets (household electricity consumption and electric vehicle charging sessions). We show FedGAN converges and has similar performance to general distributed GAN, while reduces communication complexity. We also show its robustness to reduced communications.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Provably Near-Optimal Federated Ensemble Distillation with Negligible Overhead

    cs.LG 2025-02 conditional novelty 6.0 of 10

    FedGO weights each client's prediction by the estimated density ratio of that client's data using GAN discriminators, and proves this weighting makes the ensemble at least as good as the best single model under convex loss.

Pith tools