{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T13:31:07Z","timestamp":1770989467599,"version":"3.50.1"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2021,10,22]],"date-time":"2021-10-22T00:00:00Z","timestamp":1634860800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61872378, and 91648204"],"award-info":[{"award-number":["61872378, and 91648204"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Science Fund for Distinguished Young Scholars in Hunan Province","award":["2018JJ1032"],"award-info":[{"award-number":["2018JJ1032"]}]},{"name":"Scientific Research Project of National University of Defense Technology","award":["ZK19-03"],"award-info":[{"award-number":["ZK19-03"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2022,5,31]]},"abstract":"<jats:p>Generative adversarial networks (GANs) have shown great success in deep representations learning, data generation, and security enhancement. With the development of the Internet of Things, 5th generation wireless systems (5G), and other technologies, the large volume of data collected at the edge of networks provides a new way to improve the capabilities of GANs. Due to privacy, bandwidth, and legal constraints, it is not appropriate to upload all the data to the cloud or servers for processing. Therefore, this article focuses on deploying and training GANs at the edge rather than converging edge data to the central node. To address this problem, we designed a novel distributed learning architecture for GANs, called DANCE. DANCE can adaptively perform communication compression based on the available bandwidth, while supporting both data and model parallelism training of GANs. In addition, inspired by the gossip mechanism and Stackelberg game, a compatible algorithm, AC-GAN is proposed. The theoretical analysis guarantees the convergence of the model and the existence of approximate equilibrium in AC-GAN. Both simulation and prototype system experiments show that AC-GAN can achieve better training effectiveness with less communication overhead than the SOTA algorithms, i.e., FL-GAN and MD-GAN.<\/jats:p>","DOI":"10.1145\/3458929","type":"journal-article","created":{"date-parts":[[2021,10,23]],"date-time":"2021-10-23T03:14:43Z","timestamp":1634958883000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["DANCE: Distributed Generative Adversarial Networks with Communication Compression"],"prefix":"10.1145","volume":"22","author":[{"given":"Xiongtao","family":"Zhang","sequence":"first","affiliation":[{"name":"National University of Defense Technology, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaomin","family":"Zhu","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji","family":"Wang","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Bao","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurence T.","family":"Yang","sequence":"additional","affiliation":[{"name":"St. Francis Xavier University, NS, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,10,22]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230558"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.5555\/3294771.3294934"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874516"},{"key":"e_1_3_3_5_2","doi-asserted-by":"crossref","unstructured":"X. Cao G. Tang D. Guo Y. Li and W. Zhang. 2020. Edge federation: Towards an integrated service provisioning model. IEEE\/ACM Transactions on Networking 28 3 (2020) 1116\u20131129.","DOI":"10.1109\/TNET.2020.2979361"},{"key":"e_1_3_3_6_2","unstructured":"W. Dai J. Doyle X. Liang H. Zhang N. Dong Y. Li and E. P. Xing. 2017. Scan: Structure correcting adversarial network for chest x-rays organ segmentation. arXiv:1703.08770. Retrieved from https:\/\/arxiv.org\/abs\/1703.08770."},{"key":"e_1_3_3_7_2","unstructured":"M. Derezi\u0144ski M. K. Warmuth and D. Hsu. 2019. Unbiased estimators for random design regression. arXiv:1907.03411. Retrieved from https:\/\/arxiv.org\/abs\/1907.03411."},{"key":"e_1_3_3_8_2","volume-title":"Proceedings of the International Conference on Learning Representations","author":"Durugkar I.","year":"2017","unstructured":"I. Durugkar, I. Gemp, and S. Mahadevan. 2017. Generative multi-adversarial networks. In Proceedings of the International Conference on Learning Representations."},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM38437.2019.9014102"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00888"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.5555\/2969033.2969125"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3286490.3286563"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2019.00095"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.5555\/3295222.3295408"},{"key":"e_1_3_3_15_2","unstructured":"Q. Hoang T. D. Nguyen T. Le and D. Phung. 2017. Multi-generator generative adversarial nets. arXiv:1708.02556. Retrieved from https:\/\/arxiv.org\/abs\/1708.02556."},{"key":"e_1_3_3_16_2","first-page":"7354","volume-title":"Proceedings of the International Conference on Learning Representations","author":"Karras T.","year":"2018","unstructured":"T. Karras, T. Aila, S. Laine, and J. Lehtinen. 2018. Progressive growing of gans for improved quality, stability, and variation. In Proceedings of the International Conference on Learning Representations, 7354\u20137363."},{"key":"e_1_3_3_17_2","unstructured":"D. P. Kingma and J. Ba. 2014. Adam: A method for stochastic optimization. arXiv:1412.6980. Retrieved from https:\/\/arxiv.org\/abs\/1412.6980."},{"key":"e_1_3_3_18_2","first-page":"3478","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Koloskova A.","year":"2019","unstructured":"A. Koloskova, S. U. Stich, and M. Jaggi. 2019. Decentralized stochastic optimization and gossip algorithms with compressed communication. In Proceedings of the International Conference on Machine Learning. 3478\u20133487."},{"key":"e_1_3_3_19_2","unstructured":"J. Kone\u010dn\u00fd H. B. McMahan F. X. Yu P. Richt\u00e1rik A. T. Suresh and D. Bacon. 2017. Federated learning: Strategies for improving communication efficiency. arXiv:1610.05492. Retrieved from https:\/\/arxiv.org\/abs\/1610.05492."},{"key":"e_1_3_3_20_2","unstructured":"A. Krizhevsky V. Nair and G. Hinton. 2014. The cifar-10 Dataset. Retrieved from http:\/\/www.cs.toronto.edu\/kriz\/cifar.html."},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"e_1_3_3_22_2","doi-asserted-by":"crossref","unstructured":"J. Li X. Cao D. Guo J. Xie and H. Chen. 2020. Task Scheduling with UAV-assisted Vehicular Cloud for Road Detection in Highway Scenario. IEEE Internet of Things Journal 7 8 (2020) 7702\u20137713.","DOI":"10.1109\/JIOT.2020.2992088"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.5555\/2685048.2685095"},{"key":"e_1_3_3_24_2","volume-title":"Proceedings of the International Conference on Learning Representations","author":"Lin Y.","year":"2018","unstructured":"Y. Lin, S. Han, H. Mao, Y. Wang, and B. Dally. 2018. Deep gradient compression: Reducing the communication bandwidth for distributed training. In Proceedings of the International Conference on Learning Representations."},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.304"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2872043"},{"key":"e_1_3_3_27_2","unstructured":"H. B. McMahan E. Moore D. Ramage and B. A. Arcas. 2016. Federated learning of deep networks using model averaging. arXiv:1602.05629. Retrieved from https:\/\/arxiv.org\/abs\/1602.05629."},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00029"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.5555\/3294996.3295027"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.5555\/3305890.3305954"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.01.030"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.5555\/3157096.3157346"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.21437\/Interspeech.2014-274"},{"key":"e_1_3_3_35_2","first-page":"534","volume-title":"Proceedings of the Pacific Rim Conference on Multimedia","author":"Shi H.","year":"2017","unstructured":"H. Shi, J. Dong, W. Wang, Y. Qian, and X. Zhang. 2017. SSGAN: Secure steganography based on generative adversarial networks. In Proceedings of the Pacific Rim Conference on Multimedia. Springer, 534\u2013544."},{"key":"e_1_3_3_36_2","article-title":"Speedtest Report of the U.S. Retrieved February 14, 2020 from","year":"2019","unstructured":"Speedtest.net. 2019. Speedtest Report of the U.S. Retrieved February 14, 2020 fromhttps:\/\/www.speedtest.net\/reports\/united-states\/.","journal-title":"https:\/\/www.speedtest.net\/reports\/united-states\/"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.5555\/3327345.3327357"},{"key":"e_1_3_3_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2018.2836316"},{"key":"e_1_3_3_39_2","unstructured":"H. Xiao K. Rasul and R. Vollgraf. 2017. Fashion-mnist: A novel image dataset for benchmarking machine learning algorithms. arXiv:1708.07747. Retrieved from https:\/\/arxiv.org\/abs\/1708.07747."},{"key":"e_1_3_3_40_2","unstructured":"R. Yonetani T. Takahashi A. Hashimoto and Y. Ushiku. 2019. Decentralized learning of generative adversarial networks from multi-client non-iid data. arXiv:1905.09684. Retrieved from https:\/\/arxiv.org\/abs\/1905.09684."},{"key":"e_1_3_3_41_2","first-page":"7354","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Zhang H.","year":"2019","unstructured":"H. Zhang, I. J. Goodfellow, D. Metaxas, and A. Odena. 2019. Self-attention generative adversarial networks. In Proceedings of the International Conference on Machine Learning, 7354\u20137363."},{"key":"e_1_3_3_42_2","unstructured":"H. Zhang S. Xu J. Jiao P. Xie R. Salakhutdinov and E. P. Xing. 2018. Stackelberg GAN: Towards provable minimax equilibrium via multi-generator architectures. arXiv:1811.08010. Retrieved from https:\/\/arxiv.org\/abs\/1811.08010."}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3458929","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3458929","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:55Z","timestamp":1750195495000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3458929"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,22]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,5,31]]}},"alternative-id":["10.1145\/3458929"],"URL":"https:\/\/doi.org\/10.1145\/3458929","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"value":"1533-5399","type":"print"},{"value":"1557-6051","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,22]]},"assertion":[{"value":"2020-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-10-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}