On the fairness of generative adversarial networks (GANs)

Kenfack, Patrik Joslin; Arapov, Daniil Dmitrievich; Hussain, Rasheed; Kazmi, S.M. Ahsan; Khan, Adil

Abstract

Generative adversarial networks (GANs) are one of the greatest advances in AI in recent years. With their ability to directly learn the probability distribution of data and then sample synthetic realistic data. Many applications have emerged, using GANs to solve classical problems in machine learning, such as data augmentation, class imbalance problems, and fair representation learning. In this paper, we analyze and highlight the fairness concerns of GANs. In this regard, we show empirically that GANs models may inherently prefer certain groups during the training process and therefore they're not able to homogeneously generate data from different groups during the testing phase. Furthermore, we propose solutions to solve this issue by conditioning the GAN model towards samples' groups or using the ensemble method (boosting) to allow the GAN model to leverage distributed structure of data during the training phase and generate groups at an equal rate during the testing phase.

• Presentation Conference Type: Conference Paper (published)
• Conference Name: 2021 International Conference "Nonlinearity, Information and Robotics" (NIR)
• Start Date: Aug 26, 2021
• End Date: Aug 29, 2021
• Acceptance Date: Jul 30, 2021
• Online Publication Date: Jan 5, 2022
• Publication Date: Jan 5, 2022
• Deposit Date: Jun 24, 2023
• Publisher: Institute of Electrical and Electronics Engineers (IEEE)
• Pages: 1-7
• Book Title: 2021 International Conference "Nonlinearity, Information and Robotics" (NIR)
• ISBN: 978-1-6654-2408-0
• DOI: https://doi.org/10.1109/NIR52917.2021.9666131
• Keywords: Generative Adversarial Networks, Fairness, Group Imbalance, Representation Bias
• Public URL: https://uwe-repository.worktribe.com/output/10582711
• Publisher URL: https://ieeexplore.ieee.org/document/9666131