Search-Based Adversarial Testing and Improvement of Constrained Credit Scoring Systems

被引:16
作者
Ghamizi, Salah [1 ]
Cordy, Maxime [1 ]
Gubri, Martin [1 ]
Papadakis, Mike [1 ]
Boystov, Andrey [1 ]
Le Traon, Yves [1 ]
Goujon, Anne [2 ]
机构
[1] Univ Luxembourg, Luxembourg, Luxembourg
[2] BGL BNP Parisbas, Luxembourg, Luxembourg
来源
PROCEEDINGS OF THE 28TH ACM JOINT MEETING ON EUROPEAN SOFTWARE ENGINEERING CONFERENCE AND SYMPOSIUM ON THE FOUNDATIONS OF SOFTWARE ENGINEERING (ESEC/FSE '20) | 2020年
关键词
Search-based; Adversarial attacks; FinTech; Random Forest; Credit Scoring;
D O I
10.1145/3368089.3409739
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Credit scoring systems are critical FinTech applications that concern the analysis of the creditworthiness of a person or organization. While decisions were previously based on human expertise, they are now increasingly relying on data analysis and machine learning. In this paper, we assess the ability of state-of-the-art adversarial machine learning to craft attacks on a real-world credit scoring system. Interestingly, we find that, while these techniques can generate large numbers of adversarial data, these are practically useless as they all violate domain-specific constraints. In other words, the generated examples are all false positives as they cannot occur in practice. To circumvent this limitation, we propose CoEvA2, a search-based method that generates valid adversarial examples (satisfying the domain constraints). CoEvA2 utilizes multi-objective search in order to simultaneously handle constraints, perform the attack and maximize the overdraft amount requested. We evaluate CoEvA2 on a major bank's real-world system by checking its ability to craft valid attacks. CoEvA2 generates thousands of valid adversarial examples, revealing a high risk for the banking system. Fortunately, by improving the system through adversarial training (based on the produced examples), we increase its robustness and make our attack fail.
引用
收藏
页码:1089 / 1100
页数:12
相关论文
共 26 条
[1]   Threat of Adversarial Attacks on Deep Learning in Computer Vision: A Survey [J].
Akhtar, Naveed ;
Mian, Ajmal .
IEEE ACCESS, 2018, 6 :14410-14430
[2]   Generating Test Data from OCL Constraints with Search Techniques [J].
Ali, Shaukat ;
Iqbal, Muhammad Zohaib ;
Arcuri, Andrea ;
Briand, Lionel C. .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2013, 39 (10) :1376-1402
[3]  
Alzantot Moustafa, 2018, P 2018 C EMP METH NA
[4]  
Alzantot Moustafa, 2019, GENATTACK P GEN EV C, DOI [10.1145/3321707, DOI 10.1145/3321707]
[5]  
Biggio Battista, 2013, Machine Learning and Knowledge Discovery in Databases. European Conference, ECML PKDD 2013. Proceedings: LNCS 8190, P387, DOI 10.1007/978-3-642-40994-3_25
[6]   Wild patterns: Ten years after the rise of adversarial machine learning [J].
Biggio, Battista ;
Roli, Fabio .
PATTERN RECOGNITION, 2018, 84 :317-331
[7]   Towards Evaluating the Robustness of Neural Networks [J].
Carlini, Nicholas ;
Wagner, David .
2017 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP), 2017, :39-57
[8]   Improving Logistic Regression Classification of Credit Approval with Features Constructed by Kaizen Programming [J].
de Melo, Vinicius Veloso ;
Banzhaf, Wolfgang .
PROCEEDINGS OF THE 2016 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'16 COMPANION), 2016, :61-62
[9]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[10]  
Deb K, 2007, GECCO 2007: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, P1187