Latent Imitator: Generating Natural Individual Discriminatory Instances for Black-Box Fairness Testing

被引:6
|
作者
Xiao, Yisong [1 ,2 ]
Liu, Aishan [1 ,3 ]
Li, Tianlin [4 ]
Liu, Xianglong [1 ,3 ,5 ]
机构
[1] Beihang Univ, NLSDE, Beijing, Peoples R China
[2] Beihang Univ, Shen Yuan Honors Coll, Beijing, Peoples R China
[3] Inst Dataspace, Hefei, Anhui, Peoples R China
[4] Nanyang Technol Univ, Singapore, Singapore
[5] Zhongguancun Lab, Beijing, Peoples R China
基金
中国国家自然科学基金; 国家重点研发计划;
关键词
Fairness Testing; Individual Discrimination; Latent Space; Natural Individual Discriminatory Instances;
D O I
10.1145/3597926.3598099
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Machine learning (ML) systems have achieved remarkable performance across a wide area of applications. However, they frequently exhibit unfair behaviors in sensitive application domains (e.g., employment and loan), raising severe fairness concerns. To evaluate and test fairness, engineers often generate individual discriminatory instances to expose unfair behaviors before model deployment. However, existing baselines ignore the naturalness of generation and produce instances that deviate from the real data distribution, which may fail to reveal the actual model fairness since these unnatural discriminatory instances are unlikely to appear in practice. To address the problem, this paper proposes a framework named Latent Imitator (LIMI) to generate more natural individual discriminatory instances with the help of a generative adversarial network (GAN), where we imitate the decision boundary of the target model in the semantic latent space of GAN and further samples latent instances on it. Specifically, we first derive a surrogate linear boundary to coarsely approximate the decision boundary of the target model, which reflects the nature of the original data distribution. Subsequently, to obtain more natural instances, we manipulate random latent vectors to the surrogate boundary with a one-step movement, and further conduct vector calculation to probe two potential discriminatory candidates that may be more closely located in the real decision boundary. Extensive experiments on various datasets demonstrate that our LIMI outperforms other baselines largely in effectiveness (x9.42 instances), efficiency (x8.71 speeds), and naturalness (+19.65%) on average. In addition, we empirically demonstrate that retraining on test samples generated by our approach can lead to improvements in both individual fairness (45.67% on IFr and 32.81% on IFo) and group fairness (9.86% on SPD and 28.38% on AOD). Our codes can be found on our website.
引用
收藏
页码:829 / 841
页数:13
相关论文
共 50 条
  • [21] Automatically learning usage behavior and generating event sequences for black-box testing of reactive systems
    M. Furkan Kıraç
    Barış Aktemur
    Hasan Sözer
    Ceren Şahin Gebizli
    Software Quality Journal, 2019, 27 : 861 - 883
  • [22] Automatically learning usage behavior and generating event sequences for black-box testing of reactive systems
    Kirac, M. Furkan
    Aktemur, Baris
    Sozer, Hasan
    Gebizli, Ceren Sahin
    SOFTWARE QUALITY JOURNAL, 2019, 27 (02) : 861 - 883
  • [23] Effective black-box testing with genetic algorithms
    Last, Mark
    Eyal, Shay
    Kandel, Abraham
    HARDWARE AND SOFTWARE VERIFICATION AND TESTING, 2006, 3875 : 134 - 148
  • [24] Explaining Black-box Predictions by Generating Local Meaningful Perturbations
    Verma, Tejaswani
    Lingenfelder, Christoph
    Klakow, Dietrich
    INTERNATIONAL JOURNAL OF SEMANTIC COMPUTING, 2022, 16 (01) : 47 - 68
  • [25] Demonstration of Generating Explanations for Black-Box Algorithms Using LEWIS
    Wang, Paul Y.
    Galhotra, Sainyam
    Pradhan, Romila
    Salimi, Babak
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2021, 14 (12): : 2787 - 2790
  • [26] Generating Causal Hypotheses for Explaining Black-Box Industrial Processes
    Balzereit, Kaja
    Diedrich, Alexander
    Kubus, Daniel
    Ginster, Jonas
    Bunte, Andreas
    2022 IEEE 5TH INTERNATIONAL CONFERENCE ON INDUSTRIAL CYBER-PHYSICAL SYSTEMS, ICPS, 2022,
  • [27] A Black-Box Sensitization Attack on SAT-Hard Instances in Logic Obfuscation
    McDaniel, Isaac
    Zuzak, Michael
    Srivastava, Ankur
    2022 IEEE 40TH INTERNATIONAL CONFERENCE ON COMPUTER DESIGN (ICCD 2022), 2022, : 239 - 246
  • [28] Deep Causal Graphs for Causal Inference, Black-Box Explainability and Fairness
    Parafita, Alvaro y
    Vitria, Jordi
    ARTIFICIAL INTELLIGENCE RESEARCH AND DEVELOPMENT, 2021, 339 : 415 - 424
  • [29] Probabilistic Permutation Graph Search: Black-Box Optimization for Fairness in Ranking
    Vardasbi, Ali
    Sarvi, Fatemeh
    de Rijke, Maarten
    PROCEEDINGS OF THE 45TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '22), 2022, : 715 - 725
  • [30] Testing Functional Black-Box Programs Without a Specification
    Walkinshaw, Neil
    MACHINE LEARNING FOR DYNAMIC SOFTWARE ANALYSIS: POTENTIALS AND LIMITS, 2018, 11026 : 101 - 120