Cost Sensitive Machine Learning for Credit Risk Assessment and Lending Decisions
Main Article Content
Abstract
Machine learning can improve credit risk prediction, yet predictive gains do not automatically translate into better lending decisions. The financial value of a score depends on which errors it makes, whether its probability is calibrated, and how its operating threshold reflects the costs of approval and rejection. This study develops an analytical framework linking these quantities for statistical and ensemble credit scoring models. Published findings on classifier benchmarking, imbalanced credit data, behavioral information, cost-sensitive learning, and distributional effects establish the research context. The original analysis derives feasible loss bounds from accuracy and class prevalence, identifies conditions for economic dominance between classifiers, and examines sensitivity to error costs and probability uncertainty. Deterministic scenarios use adverse class prevalences from 5% to 50%, relative error penalties from one to ten, and classifier accuracies from 70% to 95%. No borrower-level models are newly trained. At 85% accuracy, 30% adverse prevalence, and a five-to-one error penalty, feasible loss ranges from 150 to 750 units per 1,000 applications. Two feasible classifiers with accuracies of 85% and 80% can incur losses of 750 and 200 units, respectively, demonstrating a possible reversal between statistical and economic rankings. Expected loss minimization gives a probability threshold of one sixth at a five-to-one penalty ratio. A general regret expression also shows why probability uncertainty near that threshold deserves particular attention. The framework explains how findings from credit scoring research can inform model selection without treating results from different populations as directly comparable. It supports evaluating the combined prediction and decision process through discrimination, calibration, financial consequences, and distributional outcomes.
Article Details

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
References
[1] D. J. Hand and W. E. Henley, “Statistical Classification Methods in Consumer Credit Scoring: a Review,” J. R. Stat. Soc. Ser. A (Statistics Soc., vol. 160, no. 3, pp. 523–541, 1997, doi: https://doi.org/10.1111/j.1467-985X.1997.00078.x.
[2] B. Baesens, T. Van Gestel, S. Viaene, M. Stepanova, J. Suykens, and J. Vanthienen, “Benchmarking state-of-the-art classification algorithms for credit scoring,” J. Oper. Res. Soc., vol. 54, no. 6, pp. 627–635, 2003, doi: https://doi.org/10.1057/palgrave.jors.2601545.
[3] S. Lessmann, B. Baesens, H.-V. Seow, and L. C. Thomas, “Benchmarking state-of-the-art classification algorithms for credit scoring: An update of research,” Eur. J. Oper. Res., vol. 247, no. 1, pp. 124–136, 2015, doi: https://doi.org/10.1016/j.ejor.2015.05.030.
[4] I. Brown and C. Mues, “An experimental comparison of classification algorithms for imbalanced credit scoring data sets,” Expert Syst. Appl., vol. 39, no. 3, pp. 3446–3453, 2012, doi: https://doi.org/10.1016/j.eswa.2011.09.033.
[5] A. E. Khandani, A. J. Kim, and A. W. Lo, “Consumer credit-risk models via machine-learning algorithms,” J. Bank. Financ., vol. 34, no. 11, pp. 2767–2787, 2010, doi: https://doi.org/10.1016/j.jbankfin.2010.06.001.
[6] T. Berg, V. Burg, A. Gombović, and M. Puri, “On the Rise of FinTechs: Credit Scoring Using Digital Footprints,” Rev. Financ. Stud., vol. 33, no. 7, pp. 2845–2897, 2020, doi: https://doi.org/10.1093/rfs/hhz099.
[7] A. C. Bahnsen, D. Aouada, and B. Ottersten, “Example-dependent cost-sensitive decision trees,” Expert Syst. Appl., vol. 42, no. 19, pp. 6609–6619, 2015, doi: https://doi.org/10.1016/j.eswa.2015.04.042.
[8] A. Fuster, P. Goldsmith-Pinkham, T. Ramadorai, and A. Walther, “Predictably Unequal? The Effects of Machine Learning on Credit Markets,” J. Finance, vol. 77, no. 1, pp. 5–47, 2022, doi: https://doi.org/10.1111/jofi.13090.
[9] L. Breiman, “Random Forests,” Mach. Learn., vol. 45, no. 1, pp. 5–32, 2001, doi: https://doi.org/10.1023/A:1010933404324.
[10] M. M. T. G. Manik, A. S. M. Saimon, M. S. Islam, M. Moniruzzaman, E. Rozario, and E. Hossin, Big Data Analytics for Credit Risk Assessment. 2025. doi: https://doi.org/10.1109/ICMLAS64557.2025.10967667.
[11] T. Chen, “XGBoost: A Scalable Tree Boosting System,” Cornell Univ., 2016, doi: https://doi.org/10.1145/2939672.2939785.
[12] C. Elkan, “The Foundations of Cost-Sensitive Learning,” Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. pp. 973–978, 2001. [Online]. Available: https://mlanthology.org/ijcai/2001/elkan2001ijcai-foundations/
[13] T. Fawcett, “An introduction to ROC analysis,” Pattern Recognit. Lett., vol. 27, no. 8, pp. 861–874, 2006, doi: https://doi.org/10.1016/j.patrec.2005.10.010.
[14] T. Saito and M. Rehmsmeier, “The Precision-Recall Plot Is More Informative than the ROC Plot When Evaluating Binary Classifiers on Imbalanced Datasets,” PLoS One, vol. 10, no. 3, p. e0118432, 2015, doi: https://doi.org/10.1371/journal.pone.0118432.
[15] G. W. Brier, “Verification of Forecasts Expressed in Terms of Probability,” Mon. Weather Rev., vol. 78, no. 1, pp. 1–3, 1950, doi: https://doi.org/10.1175/1520-0493(1950)078<0001:VOFEIT>2.0.CO;2.
[16] T. Gneiting and A. E. Raftery, “Strictly Proper Scoring Rules, Prediction, and Estimation,” J. Am. Stat. Assoc., vol. 102, no. 477, pp. 359–378, 2007, doi: https://doi.org/10.1198/016214506000001437.
[17] A. Niculescu-Mizil and R. Caruana, “Predicting Good Probabilities with Supervised Learning,” Proceedings of the 22nd International Conference on Machine Learning. ACM, pp. 625–632, 2005. doi: https://doi.org/10.1145/1102351.1102430.
[18] C. Guo, G. Pleiss, Y. Sun, and K. Q. Weinberger, “On Calibration of Modern Neural Networks,” Proceedings of the 34th International Conference on Machine Learning, vol. 70. PMLR, pp. 1321–1330, 2017. doi: https://proceedings.mlr.press/v70/guo17a.html.
[19] M. T. Ribeiro, S. Singh, and C. Guestrin, “‘Why Should I Trust You?’: Explaining the Predictions of Any Classifier,” in Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016, pp. 1135–1144. doi: https://doi.org/10.1145/2939672.2939778.
[20] S. M. Lundberg and S.-I. Lee, “A unified approach to interpreting model predictions,” 2017.
[21] N. Bussmann, P. Giudici, D. Marinelli, and J. Papenbrock, “Explainable AI in Fintech Risk Management,” Front. Artif. Intell., vol. 3, p. 26, 2020, doi: https://doi.org/10.3389/frai.2020.00026.
[22] S. Barocas and A. D. Selbst, “Big data’s disparate impact,” Calif. L. Rev., vol. 104, p. 671, 2016, doi: https://doi.org/10.15779/Z38BG31.
[23] M. Hardt, E. Price, and N. Srebro, “Equality of Opportunity in Supervised Learning,” Advances in Neural Information Processing Systems 29. 2016. doi: https://proceedings.neurips.cc/paper_files/paper/2016/hash/6a9659feb1216f14f7384ba499518b38-Abstract.html.
[24] J. Kleinberg, S. Mullainathan, and M. Raghavan, “Inherent Trade-Offs in the Fair Determination of Risk Scores,” 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). pp. 43:1-43:23, 2017. doi: https://doi.org/10.4230/LIPIcs.ITCS.2017.43.
[25] H. Hofmann, “Statlog (German Credit Data).” UCI Machine Learning Repository, 1994. doi: https://doi.org/10.24432/C5NC77.
[26] S. Varma and R. Simon, “Bias in error estimation when using cross-validation for model selection,” BMC Bioinformatics, vol. 7, p. 91, 2006, doi: https://doi.org/10.1186/1471-2105-7-91.
[27] G. C. Cawley and N. L. C. Talbot, “On Over-fitting in Model Selection and Subsequent Selection Bias in Performance Evaluation,” J. Mach. Learn. Res., vol. 11, pp. 2079–2107, 2010, doi: https://jmlr.org/papers/v11/cawley10a.html.
[28] J. Demšar, “Statistical Comparisons of Classifiers over Multiple Data Sets,” J. Mach. Learn. Res., vol. 7, pp. 1–30, 2006, doi: https://jmlr.org/papers/v7/demsar06a.html.
[29] C. Strobl, A.-L. Boulesteix, A. Zeileis, and T. Hothorn, “Bias in random forest variable importance measures: Illustrations, sources and a solution,” BMC Bioinformatics, vol. 8, p. 25, 2007, doi: https://doi.org/10.1186/1471-2105-8-25.
[30] M. Zaharia et al., “Apache Spark: A Unified Engine for Big Data Processing,” Commun. ACM, vol. 59, no. 11, pp. 56–65, 2016, doi: https://doi.org/10.1145/2934664.