On the game‐theoretic analysis of distributed generative adversarial networks

Abstract

In this paper, a distributed method is proposed for training multiple generative adversarial networks (GANs) with private data sets via a game‐theoretic approach. To facilitate the requirement of privacy protection, distributed training algorithms offer a promising solution to learn global models without sample exchanges. Existing studies have mainly concentrated on training neural networks using pure cooperation strategies, which are not suitable for GANs. This paper develops a new framework for distributed GANs, where two groups of discriminators and generators are involved in a zero‐sum game. Under connected graphs, such a framework is reformulated as a constrained minmax optimisation problem. Then, a fully distributed training algorithm is proposed without exchanging any private data samples. The convergence of the proposed algorithm is established via advanced consensus and optimisation techniques. Simulation studies are presented to validate the effectiveness of the proposed framework and algorithm.