Name
Abstract | ||
|---|---|---|
Generative adversarial networks (GANs) are powerful generative models that are widely used to produce synthetic data. This paper proposes a Multi-Group Generative Adversarial Network (MGGAN), a framework that consists of multiple generative groups for addressing the mode collapse problem and creating high-quality samples with less time cost. The idea is intuitive yet effective. The distinguishing characteristic of MGGAN is that a generative group includes a fixed generator but a dynamic discriminator. All the generators need to combine with a random discriminator from other generative groups after a certain number of training iterations, which is called regrouping. The multiple generative groups are trained simultaneously and independently without sharing the parameters. The learning rate and the regrouping interval are adjusted dynamically in the training process. We conduct extensive experiments on the synthetic and real-world datasets. The experimental results show the superior performance of our MGGAN in generating high quality and diverse samples with less training time. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/HPCC-DSS-SmartCity-DependSys53884.2021.00073 | 2021 IEEE 23rd Int Conf on High Performance Computing & Communications; 7th Int Conf on Data Science & Systems; 19th Int Conf on Smart City; 7th Int Conf on Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys) |
Keywords | DocType | ISBN |
GAN,model collapse,multi-groups,dynamic adjustment,diversity,time saving | Conference | 978-1-6654-9458-8 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hao Wu | 1 | 0 | 0.34 |
| Ligang He | 2 | 542 | 56.73 |
| Chang-Tsun Li | 3 | 0 | 0.34 |
| Junyu Li | 4 | 0 | 0.34 |
| Wentai Wu | 5 | 0 | 0.34 |
| Carsten Maple | 6 | 603 | 85.70 |