Tackling Multiplayer Interaction for Federated Generative Adversarial Networks

被引:0
作者
Hu, Chuang [1 ]
Tu, Tianyu [1 ]
Gong, Yili [1 ]
Jiang, Jiawei [1 ]
Zheng, Zhigao [1 ]
Cheng, Dazhao [1 ]
机构
[1] Wuhan Univ, Comp Sch, Wuhan 430072, Peoples R China
基金
中国国家自然科学基金;
关键词
Games; Training; Generators; Game theory; Generative adversarial networks; Servers; Computational modeling; Data heterogeneity; generative adversarial networks (GANs); multiplayer zero-sum games;
D O I
10.1109/TMC.2024.3438148
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Generative Adversarial Networks (GANs) have become predominant in mobile computing for their ability to generate data. The concern for data privacy has made it arduous to collect large-scale datasets for GAN training on centralized servers. Federated Learning (FL) has emerged as a promising solution to address data privacy concerns. In this paper, we propose Oasis, a multiplayer-oriented federated GAN training system. We present a motivation, highlighting the Nash Equilibrium (NE) shift in vanilla federated GANs, exacerbated by data heterogeneity, leading to poor training performance with issues of vanishing gradient and mode collapse. To address mode collapse, Oasis extracts privacy-preserving data representations and generates a similarity table for clustering clients. Each group independently trains a GAN model and conducts distribution and fusion. By introducing a coordinator, Oasis generalizes intra-group games into Separable Zero-sum Multiplayer Games to tackle vanishing gradient. Thus, Oasis considers the overall federated GAN training as Group-wise Separable Zero-sum Multiplayer Games. Practically, we evaluate our theoretical results both on a hardware prototype and in a simulated environment. Evaluation results demonstrate the effectiveness of Oasis, with an average improvement of 23.13% and 26.33% in terms of FID and NDB/K respectively, compared to three state-of-the-art FL approaches over three datasets.
引用
收藏
页码:14017 / 14030
页数:14
相关论文
共 45 条
[1]   Android malware detection through generative adversarial networks [J].
Amin, Muhammad ;
Shah, Babar ;
Sharif, Aizaz ;
Alit, Tamleek ;
Kim, Ki-Il ;
Anwar, Sajid .
TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES, 2022, 33 (02)
[2]  
[Anonymous], 2014, PROC NEURIPS
[3]  
Arjovsky M., 2017, arXiv, DOI 10.48550/arXiv.1701.04862
[4]  
Bergman L., 1998, Optimization, V44, P69
[5]  
Cai Y, 2011, PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P217
[6]   Mobility-Aware Routing and Caching in Small Cell Networks Using Federated Learning [J].
Cao, Yuwen ;
Maghsudi, Setareh ;
Ohtsuki, Tomoaki ;
Quek, Tony Q. S. .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2024, 72 (02) :815-829
[7]  
Chen H, 2020, PROCEEDINGS OF THE 29TH USENIX SECURITY SYMPOSIUM, P2111
[8]   Image Steganography Based on Foreground Object Generation by Generative Adversarial Networks in Mobile Edge Computing With Internet of Things [J].
Cui, Qi ;
Zhou, Zhili ;
Fu, Zhangjie ;
Meng, Ruohan ;
Sun, Xingming ;
Wu, Q. M. Jonathan .
IEEE ACCESS, 2019, 7 :90815-90824
[9]   The Complexity of Computing a Nash Equilibrium [J].
Daskalakis, Constantinos ;
Goldberg, Paul W. ;
Papadimitriou, Christos H. .
COMMUNICATIONS OF THE ACM, 2009, 52 (02) :89-97
[10]   FEGAN: Scaling Distributed GANs [J].
Guerraoui, Rachid ;
Guirguis, Arsany ;
Kermarrec, Anne-Marie ;
Le Merrer, Erwan .
PROCEEDINGS OF THE 2020 21ST INTERNATIONAL MIDDLEWARE CONFERENCE (MIDDLEWARE '20), 2020, :193-206