Search arXivSearch

arXiv · 2104.06735

Enabling Machine Learning Algorithms for Credit Scoring -- Explainable Artificial Intelligence (XAI) methods for clear understanding complex predictive models

Abstract

Rapid development of advanced modelling techniques gives an opportunity to develop tools that are more and more accurate. However as usually, everything comes with a price and in this case, the price to pay is to loose interpretability of a model while gaining on its accuracy and precision. For managers to control and effectively manage credit risk and for regulators to be convinced with model quality the price to pay is too high. In this paper, we show how to take credit scoring analytics in to the next level, namely we present comparison of various predictive models (logistic regression, logistic regression with weight of evidence transformations and modern artificial intelligence algorithms) and show that advanced tree based models give best results in prediction of client default. What is even more important and valuable we also show how to boost advanced models using techniques which allow to interpret them and made them more accessible for credit risk practitioners, resolving the crucial obstacle in widespread deployment of more complex, 'black box' models like random forests, gradient boosted or extreme gradient boosted trees. All this will be shown on the large dataset obtained from the Polish Credit Bureau to which all the banks and most of the lending companies in the country do report the credit files. In this paper the data from lending companies were used. The paper then compares state of the art best practices in credit risk modelling with new advanced modern statistical tools boosted by the latest developments in the field of interpretability and explainability of artificial intelligence algorithms. We believe that this is a valuable contribution when it comes to presentation of different modelling tools but what is even more important it is showing which methods might be used to get insight and understanding of AI methods in credit risk context.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Przemysław Biecek, Marcin Chlebus, Janusz Gajda, Alicja Gosiewska, Anna Kozak, Dominik Ogonowski, Jakub Sztachelski, Piotr Wojewnik. 2021-04-14. Enabling Machine Learning Algorithms for Credit Scoring -- Explainable Artificial Intelligence (XAI) methods for clear understanding complex predictive models. https://arxiv.org/abs/2104.06735

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Dynamic reinsurance via martingale transport

We formulate a dynamic reinsurance problem in which the insurer seeks to satisfy prescribed terminal moment or risk-based constraints while minimizing the $L^2$-norm of the ceded risk. As a tool for this analysis, we first use techniques from martingale optimal transport to study the auxiliary problem in which the insurer matches a given terminal distribution of the surplus process. We show that, under suitable assumptions, this auxiliary problem admits a tractable solution analogous to the Bass martingale. We then relax this condition by only requiring certain moment or risk-based constraints.

q-fin.RM

Risk Measures under Paired-Ambiguity: A Deep Learning Reflected BSDE Framework

We study optimal stopping under dynamic risk measures with simultaneous ambiguity in the probability model and the discount rate. We introduce a paired ambiguity framework combining Girsanov model uncertainty with cash subadditive risk evaluation and characterize the stopping value by an upper reflected backward stochastic differential equation (BSDE). We establish structural properties of the resulting stopping operator and study quadratic drivers associated with entropic risk measures, obtaining explicit stopping rules in several benchmark cases. We then develop a deep learning scheme for the reflected quadratic BSDE. The convergence analysis uses discrete reflection and truncation to reduce the quadratic problem to a globally Lipschitz system and combines reflected BSDE discretization estimates with neural network approximation errors. Numerical experiments for American options illustrate the effects of discount rate and entropic ambiguity on stopping values and exercise decisions.

q-fin.RM

When Is the Gini Loading More Prudent? Tail Structure and the Ordering of the Standard Deviation and the Gini Mean Difference

The standard deviation (SD) and the Gini mean difference (GMD) are the two canonical measures of variability used to load premiums, set risk margins and allocate capital, yet no universal ordering between them exists. We show that the comparison is \emph{equivalent} to asking whether the coefficient of variation of the spacing $|X-X'|$ generated by two independent copies of the risk exceeds unity, so that the exponential law -- whose spacing is again exponential -- is the universal knife-edge separating the two regimes. Reading the GMD as twice the maxiance, that is, as a second-order \emph{dual} moment in the sense of Yaari's dual theory, the problem becomes an explicit comparison of primal and dual second-order variability. We derive a closed-form representation of the mean excess function of the spacing in terms of the hazard and reverse hazard rates of $X$, and use it to prove that heavy-tailed behavior -- a decreasing hazard rate or an increasing reverse hazard rate -- yields SD dominance, whereas two-sided light tails yield GMD dominance; within the monotone aging classes, equality characterizes the exponential law. Both regimes are stable under truncation, convolution and mixing, which makes them operational in collective risk and frailty models. We classify the severity, lifetime and frequency distributions of actuarial practice accordingly, quantify the consequences for SD- and Gini-loaded premium principles and for Gini-type tail risk measures, and show that the sign of $\mathrm{SD}-\mathrm{GMD}$ across thresholds furnishes a simple diagnostic for tail aging.

q-fin.RM