<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN" "JATS-journalpublishing1-4.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.4" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">jcc</journal-id>
      <journal-title-group>
        <journal-title>Journal of Computer and Communications</journal-title>
      </journal-title-group>
      <issn pub-type="epub">2327-5227</issn>
      <issn pub-type="ppub">2327-5219</issn>
      <publisher>
        <publisher-name>Scientific Research Publishing</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.4236/jcc.2026.144008</article-id>
      <article-id pub-id-type="publisher-id">jcc-150971</article-id>
      <article-categories>
        <subj-group>
          <subject>Article</subject>
        </subj-group>
        <subj-group>
          <subject>Computer Science</subject>
          <subject>Communications</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Credit Risk Modeling in Banking: A Comparative Analysis of Logistic Regression and Machine Learning Approaches</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Firdavs</surname>
            <given-names>Usmanov</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Wang</surname>
            <given-names>Wei</given-names>
          </name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
      </contrib-group>
      <aff id="aff1"><label>1</label> School of Artificial Intelligence and Information Engineering, Zhejiang University of Science and Technology, Hangzhou, China </aff>
      <aff id="aff2"><label>2</label> School of Sciences, Zhejiang University of Science and Technology, Hangzhou, China </aff>
      <author-notes>
        <fn fn-type="conflict" id="fn-conflict">
          <p>The authors declare no conflicts of interest regarding the publication of this paper.</p>
        </fn>
      </author-notes>
      <pub-date pub-type="epub">
        <day>16</day>
        <month>04</month>
        <year>2026</year>
      </pub-date>
      <pub-date pub-type="collection">
        <month>04</month>
        <year>2026</year>
      </pub-date>
      <volume>14</volume>
      <issue>04</issue>
      <fpage>155</fpage>
      <lpage>180</lpage>
      <history>
        <date date-type="received">
          <day>11</day>
          <month>03</month>
          <year>2026</year>
        </date>
        <date date-type="accepted">
          <day>24</day>
          <month>04</month>
          <year>2026</year>
        </date>
        <date date-type="published">
          <day>27</day>
          <month>04</month>
          <year>2026</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>© 2026 by the authors and Scientific Research Publishing Inc.</copyright-statement>
        <copyright-year>2026</copyright-year>
        <license license-type="open-access">
          <license-p> This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license ( <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link> ). </license-p>
        </license>
      </permissions>
      <self-uri content-type="doi" xlink:href="https://doi.org/10.4236/jcc.2026.144008">https://doi.org/10.4236/jcc.2026.144008</self-uri>
      <abstract>
        <p>Credit risk assessment is a fundamental component of banking operations, directly influencing lending decisions, capital allocation, pricing strategies, and regulatory compliance. Traditionally, logistic regression has been the dominant methodology for probability of default (PD) estimation due to its statistical robustness, interpretability, and regulatory acceptance. However, the increasing availability of large-scale financial and behavioral datasets, combined with advancements in computational power, has facilitated the adoption of machine learning techniques such as Random Forests, Gradient Boosting Machines, Support Vector Machines, and Neural Networks for credit risk prediction. This study is designed as a structured literature-based comparative synthesis, integrating findings from prior empirical research and established theoretical frameworks. It does not rely on a single proprietary dataset but instead develops a consolidated benchmarking perspective based on published evidence. This study provides a literature-based comparative synthesis of logistic regression and selected machine learning approaches in the context of banking credit risk modeling. The comparison is synthesized from existing empirical studies and benchmark evidence reported in the literature across key performance dimensions, including predictive accuracy, discriminatory power, calibration stability, interpretability, computational efficiency, and regulatory compliance considerations. The paper further evaluates the implications of model complexity for explainability, governance, and model risk management under contemporary regulatory frameworks. By synthesizing theoretical foundations and empirical evidence from existing literature, this research aims to provide a structured framework to guide financial institutions in selecting appropriate modeling techniques based on operational objectives, regulatory constraints, and data characteristics. The synthesized evidence indicates that while machine learning methods often outperform logistic regression in predictive performance, logistic regression retains advantages in transparency, stability, and ease of regulatory validation. A hybrid modeling strategy combining performance gains from machine learning with interpretability safeguards is therefore recommended for practical banking applications. The analysis primarily targets retail and small-to-medium enterprise (SME) lending portfolios, where probability of default (PD) modeling plays a central role under Internal Ratings-Based (IRB) regulatory frameworks and IFRS 9 expected credit loss (ECL) requirements.</p>
      </abstract>
      <kwd-group kwd-group-type="author-generated" xml:lang="en">
        <kwd>Credit Risk Modeling</kwd>
        <kwd>Probability of Default (PD)</kwd>
        <kwd>Logistic Regression</kwd>
        <kwd>Machine Learning</kwd>
        <kwd>Random Forest</kwd>
        <kwd>Gradient Boosting</kwd>
        <kwd>Credit Scoring</kwd>
        <kwd>Banking Risk Management</kwd>
        <kwd>Model Risk Management</kwd>
        <kwd>Explainable Artificial Intelligence (XAI)</kwd>
        <kwd>Financial Analytics</kwd>
        <kwd>Regulatory Compliance</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
      <title>1. Introduction</title>
      <p>Credit risk represents the possibility that a borrower will fail to meet contractual debt obligations, resulting in financial losses for lending institutions. Within the banking sector, credit risk constitutes the largest and most significant category of risk exposure, particularly in retail, corporate, and small business lending portfolios. Effective measurement and management of credit risk are therefore central to the stability and profitability of financial institutions as well as to the resilience of the broader financial system. Regulatory frameworks such as the Basel II and Basel III accords formally recognize the importance of internal risk quantification systems and explicitly incorporate probability of default (PD), loss given default (LGD), and exposure at default (EAD) into capital adequacy requirements [<xref ref-type="bibr" rid="B1">1</xref>][<xref ref-type="bibr" rid="B2">2</xref>]. In parallel, accounting standards such as IFRS 9 require forward-looking expected credit loss (ECL) estimation, placing additional emphasis on accurate and timely PD modeling [<xref ref-type="bibr" rid="B3">3</xref>]. Within this regulatory and operational landscape, the development of reliable credit risk models is not merely a technical exercise but a strategic imperative for banks. Logistic regression has been the prevailing credit scoring and PD estimation methodology for a number of decades. Its popularity can be explained by both statistical and institutional factors. Methodologically, logistic regression provides a probabilistic model that shows the log-odds of default in a linear form based on explanatory variables. The marginal effects and odds ratios have intuitive interpretations in terms of the coefficients that the resulting coefficient gives, enabling practitioners to determine the direction and strength of risk drivers. This interpretability has been especially useful in retail credit scoring, where a lack of transparency and explainability is a major issue with compliance to consumer protection and fair lending regulations [<xref ref-type="bibr" rid="B4">4</xref>][<xref ref-type="bibr" rid="B5">5</xref>]. Besides, the logistic regression is computationally effective, stable in relatively small to moderate samples, and also widely supported by statistical theory, inference procedures, and diagnostic programs. Consequently, it has been all but universally supported by credit scoring literature and has been adopted in industry practice over decades [<xref ref-type="bibr" rid="B6">6</xref>][<xref ref-type="bibr" rid="B7">7</xref>]. Logistic regression models are frequently applied as scorecard schemes in real-world banking practices. The technique applied to transform continuous variables into discrete ones includes binning and Weight of Evidence (WoE) encoding, which introduces monotonicity and enhances the interpretability of a model. The transformations have not only the advantage of stabilizing parameter estimates but also the ability to produce reason codes to adverse credit decisions, which is a regulatory mandate in most jurisdictions. This means that logistic regression is consistent with the supervisory expectations in the conceptual soundness, documentation, validation, and monitoring in accordance with model risk management advice [<xref ref-type="bibr" rid="B8">8</xref>]. Logistic regression models have therefore been attributed with a lot of institutional credibility because of the transparency and traceability. A high-level conceptual comparison between logistic regression and machine learning approaches is summarized in <bold>Table 1</bold>.</p>
      <p><bold>Table 1</bold><bold>.</bold> Conceptual comparison between logistic regression and machine learning in credit risk modeling.</p>
      <table-wrap id="tbl1">
        <label>Table 1</label>
        <table>
          <tbody>
            <tr>
              <td>Dimension</td>
              <td>Logistic Regression</td>
              <td>Machine Learning</td>
            </tr>
            <tr>
              <td>Model Structure</td>
              <td>Linear (Log-Odds)</td>
              <td>Nonlinear, Ensemble-Based</td>
            </tr>
            <tr>
              <td>Interpretability</td>
              <td>High</td>
              <td>Moderate to Low (Model-Dependent)</td>
            </tr>
            <tr>
              <td>Regulatory Acceptance</td>
              <td>Strong</td>
              <td>Evolving</td>
            </tr>
            <tr>
              <td>Calibration Stability</td>
              <td>Generally Stable</td>
              <td>May Require Recalibration</td>
            </tr>
            <tr>
              <td>Feature Engineering</td>
              <td>Manual (WoE, Binning)</td>
              <td>Often Automated</td>
            </tr>
            <tr>
              <td>Predictive Power</td>
              <td>Competitive</td>
              <td>Often Higher</td>
            </tr>
            <tr>
              <td>Computational Cost</td>
              <td>Low</td>
              <td>Moderate to High</td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
      <p>Although these are the benefits, the changing dynamics of credit markets have revealed some weaknesses of logistic regression. The approach is based on the assumption that there is a linear relationship between predictors and the log-odds of default, which cannot sufficiently explain complex nonlinearities or higher-order interactions amongst risk factors. Though feature engineering methods can in part overcome such problems, feature engineering techniques demand a lot of domain understanding and handwork. Moreover, the contemporary banking settings produce an even bigger and more dimensional data set with transactional behavior, digital footprints, and other credit pointers. The patterns of these sources of data can be complex to model effectively using the linear parametric methods [<xref ref-type="bibr" rid="B9">9</xref>][<xref ref-type="bibr" rid="B10">10</xref>]. With the increased pace of digital transformation in the financial services industry, more and more flexible frameworks of modeling have become in demand. Machine learning methods have become enticing options that have the ability to discover nonlinear associations and intricate interactions on their own. Decision trees, Random Forests, Gradient Boosting Machine (GBM), Support Vector Machines (SVM), and artificial neural networks (ANN) are some of the algorithms that have been widely adopted in credit scoring literature [<xref ref-type="bibr" rid="B11">11</xref>]-[<xref ref-type="bibr" rid="B13">13</xref>]. Ensemble algorithms, especially boosting algorithms like XGBoost and LightGBM, have been shown to perform well in predictive tasks of a wide variety of classification tasks, including credit default prediction [<xref ref-type="bibr" rid="B14">14</xref>]. These are able to handle massive feature sets, support nonlinear effects, and model interactions among variables without being specified. It is common in empirical research that machine learning models have a superior discrimination score compared to logistic regression: Area Under the Receiver Operating Characteristic Curve (AUC-ROC), Gini coefficient, and Kolmogorov-Smirnov statistic [<xref ref-type="bibr" rid="B12">12</xref>][<xref ref-type="bibr" rid="B15">15</xref>]. Nevertheless, the implementation of machine learning into the banking sector cannot be judged on such grounds as predictive accuracy. Financial institutions are subjected to strict regulatory frameworks that provide strict model transparency, validation, and governance requirements. Supervisory advice on model risk management focuses on the conceptual soundness, continuous monitoring, independent validation, and clear description of assumptions and limitations [<xref ref-type="bibr" rid="B16">16</xref>]. The models used to make credit decisions should also be in line with the fair lending and anti-discriminatory provisions, where lenders are expected to give clear reasons as to the reasons behind adversarial decisions, and models are expected to be free of unintended bias [<xref ref-type="bibr" rid="B17">17</xref>]. Such governance expectations are not achievable in the case of complex machine learning algorithms that might not necessarily be interpretable. The conceptual positioning of logistic regression and machine learning approaches within the banking credit risk framework is illustrated in <xref ref-type="fig" rid="fig1">Figure 1</xref>, highlighting the trade-off between interpretability and predictive performance that motivates this study.</p>
      <fig id="fig1">
        <label>Figure 1</label>
        <graphic xlink:href="https://html.scirp.org/file/1733495-rId15.jpeg?20260427031641" />
      </fig>
      <p><bold>Figure 1</bold><bold>.</bold>Conceptual positioning of logistic regression and machine learning approaches in banking credit risk modelling.</p>
      <p>The conflict between predictive performance and interpretability is the core of the modern debate on credit risk models. Although machine learning models can be more discriminating, their black-box properties can make regulation authorization and acceptance more difficult for stakeholders. Instead, logistic regression presents a clear framework with each variable’s contribution to risk quantified clearly. The practical use of this trade-off in banking is that incremental increases in predictive power have to be traded off in terms of greater complexity of governance and operational risk [<xref ref-type="bibr" rid="B18">18</xref>]. A second factor is the stability of the model over time. The credit risk models are normally implemented over a long term and should be capable of meeting various economic changes. Borrower behavior can also shift as the economy is in an expansion or recession period, and the distribution of predictors and default rates may alter. It has been shown that extremely powerful machine learning models that are not regularized can be very sensitive to distribution changes and prone to overfitting unless they are regularized [<xref ref-type="bibr" rid="B19">19</xref>][<xref ref-type="bibr" rid="B20">20</xref>]. Logistic regression models, especially with monotonic constraints and conservative feature selection, can prove to be stronger in varying macroeconomic circumstances. Considering that PD estimates have a direct impact on capital allocation and provisioning, stability is as important as discrimination. The problem of class imbalance also does not help in modeling credit risks. The default event in most lending portfolios makes up a minor part of the total observations in the portfolio, which creates imbalanced data that may distort performance evaluation. Although both logistic regression and machine learning approaches demand particular attention to imbalance, such tools as resampling, class-weighting, or opting for the threshold can be used [<xref ref-type="bibr" rid="B21">21</xref>]. The relative efficiency of these strategies can be different with regard to the structure of an algorithm and data properties.</p>
      <p>Other recent developments in explainable artificial intelligence (XAI) have attempted to address the explanatory gap between machine learning and logistic regression. Post-hoc explanations of complex models include SHAP (Shapley Additive Explanations) and LIME (Local Interpretable Model-Agnostic Explanations): both techniques attempt to explain the results of prediction outcomes in terms of individual features [<xref ref-type="bibr" rid="B22">22</xref>][<xref ref-type="bibr" rid="B23">23</xref>]. These tools can help practitioners produce code of reason and feature significance even in ensemble or neural network models. Although such techniques can lead to increased transparency, there are concerns about their consistency, strength, and regulatory acceptability as compared to parametric models that are inherently interpretable. This multi-dimensional trade-off is manifested in the academic literature. Early comparative research on statistical methods included discriminant analysis and logistic regression [<xref ref-type="bibr" rid="B4">4</xref>][<xref ref-type="bibr" rid="B6">6</xref>]. Neural networks, decision trees, and support vector machines were added in the studies later on [<xref ref-type="bibr" rid="B11">11</xref>][<xref ref-type="bibr" rid="B24">24</xref>]. Much more recent literature also suggests that gradient boosting and ensemble methods possess a higher predictive ability, especially on large datasets [<xref ref-type="bibr" rid="B12">12</xref>][<xref ref-type="bibr" rid="B14">14</xref>]. However, a range of research reports that the gradual increase in AUC that machine learning models attain might not necessarily result in significant economic benefits once operational constraints and cutoff policies have been taken into account [<xref ref-type="bibr" rid="B25">25</xref>]. In addition, validation burden and model risk exposure can be increased by the greater complexity of the model. It is against this background that the current research undertaking seeks to offer a broad comparative analysis of logistic regression and machine learning as applied in banking credit risk modeling. The analysis mirrors discrimination, calibration, stability, interpretability, governance, and operational feasibility as opposed to considering only predictive measures. The research aims to inform the process of strategic decision-making in financial institutions that are in the process of shifting to advanced analytics by synthesizing theoretical knowledge and empirical data. This comparative analysis is developed throughout the rest of the paper. The sections below provide an overview of methodological preconditions, assessment systems, and empirical data, and then comment on the regulatory aspects and practical suggestions to use the model. This literature-based comparative synthesis makes the study relevant to the current discussion on how machine learning can be successfully and responsibly adopted within the banking credit risk management process. Importantly, this study does not perform original model estimation on a single dataset. Instead, it develops a comparative synthesis of existing empirical findings, supported by conceptual benchmarking across key performance dimensions. The scope of this study is focused on retail and SME credit portfolios, where high-volume transactional data and standardized modeling practices make comparative evaluation between logistic regression and machine learning approaches particularly relevant. The analysis is especially aligned with Probability of Default (PD) estimation under IRB frameworks and forward-looking expected credit loss modeling under IFRS 9.</p>
    </sec>
    <sec id="sec2">
      <title>2. Evolution of Credit Risk Modeling Methodologies</title>
      <p>Credit risk modeling methods have undergone several changes in the last 50 years, which can be discussed as the progress of the statistical theory, computational possibilities, and availability of data. Early credit analysis was very dependent on the judgment of the experts and the systems based on the rules, in which the lending decisions were informed by qualitative evaluation of the features of the borrowers. Although such methods had received domain knowledge, they were not statistically rigorous and consistent. The shift towards the quantitative credit score started in the middle of the twentieth century, when statistical methods of classification were presented to enhance objectivity and predictive power [<xref ref-type="bibr" rid="B4">4</xref>]. Linear discriminant analysis (LDA) was one of the first quantitative methods used with credit scores. The original research proved that the statistical combination of borrower features could be used to distinguish between bad and good credit risks [<xref ref-type="bibr" rid="B4">4</xref>]. The discriminant analysis offered a formal mathematical framework for classifying, but it assumed a lot, including multivariate normality and equality of covariance matrices between groups. The practicability of the method was restricted by the violation of these assumptions, which are usually typical of financial datasets. Consequently, the other probabilistic methods became dominant. Towards the end of the 1980s and 1990s, logistic regression became the dominant methodology in credit risk modeling. Logistic regression also does not assume normality as compared to discriminant analysis and directly estimates the conditional probability of default by incorporating a logistic linking function [<xref ref-type="bibr" rid="B5">5</xref>][<xref ref-type="bibr" rid="B6">6</xref>]. The probabilistic nature of the method is also in line with the needs of estimating PD in banking. Also, logistic regression coefficients are readily explained by the odds ratio, and thus, the method is transparent and applicable in a regulatory setting. The evolution of credit risk modeling techniques from statistical methods to advanced machine learning approaches is illustrated in <xref ref-type="fig" rid="fig2">Figure 2</xref>.</p>
      <fig id="fig2">
        <label>Figure 2</label>
        <graphic xlink:href="https://html.scirp.org/file/1733495-rId16.jpeg?20260427031641" />
      </fig>
      <p><bold>Figure 2</bold><bold>.</bold>Historical evolution of credit risk modeling techniques from statistical classifiers to modern machine learning approaches.</p>
      <p>The literature on logistic regression is voluminous in terms of consumer credit scoring efficacy. When compared to other statistical classifiers, logistic regression was always competitively aligned, and it has better interpretability and ease of implementation [<xref ref-type="bibr" rid="B7">7</xref>][<xref ref-type="bibr" rid="B24">24</xref>]. Specifically, variable binning and Weight of Evidence (WoE) transformations only increased the stability and explainability of logistic models [<xref ref-type="bibr" rid="B5">5</xref>]. These methods enable practitioners to impose monotonic predictor-default risk relationships to minimize model volatility and enable the construction of scorecards. The Basel regulatory framework also institutionalized logistic regression in the banking practice. In the Internal Ratings-Based (IRB) method, banks have to come up with statistically sound PD models, which are well-documented and validated [<xref ref-type="bibr" rid="B1">1</xref>][<xref ref-type="bibr" rid="B2">2</xref>]. The theoretical transparency and the statistical diagnostics of logistic regression make it well-suited to this regulatory requirement. As a result, logistic regression was incorporated in internal ratings in all the financial institutions in the world. Although it has been widely used, scholars have started investigating other methods of classification as computing capabilities have grown. The artificial neural networks (ANN) gained attention during the 1990s as adaptable nonlinear modeling tools that can be used to approximate the complex functional associations. Initial comparative literature reported that neural networks would be more accurate than logistic regression with predictive power, especially where nonlinear interaction occurred [<xref ref-type="bibr" rid="B11">11</xref>][<xref ref-type="bibr" rid="B25">25</xref>]. Nonetheless, neural networks have been challenged on the grounds of a lack of interpretability, sensitivity to parameter adjustment, and a tendency to overfitting, which restricts their use in highly regulated banking settings. A structured comparison of core modeling techniques is provided in <bold>Table 2</bold>.</p>
      <p><bold>Table 2</bold><bold>.</bold>Comparison of major credit risk modeling techniques.</p>
      <table-wrap id="tbl2">
        <label>Table 2</label>
        <table>
          <tbody>
            <tr>
              <td>Method</td>
              <td>Model Type</td>
              <td>Linearity</td>
              <td>Interpretability</td>
              <td>Computational Complexity</td>
              <td>Regulatory Acceptance</td>
            </tr>
            <tr>
              <td>Discriminant Analysis</td>
              <td>Statistical</td>
              <td>Linear</td>
              <td>High</td>
              <td>Low</td>
              <td>Moderate</td>
            </tr>
            <tr>
              <td>Logistic Regression</td>
              <td>Statistical</td>
              <td>Linear (Log-Odds)</td>
              <td>High</td>
              <td>Low</td>
              <td>Strong</td>
            </tr>
            <tr>
              <td>Decision Tree</td>
              <td>ML</td>
              <td>Nonlinear</td>
              <td>Moderate</td>
              <td>Low-Moderate</td>
              <td>Moderate</td>
            </tr>
            <tr>
              <td>Random Forest</td>
              <td>Ensemble ML</td>
              <td>Nonlinear</td>
              <td>Low-Moderate</td>
              <td>Moderate</td>
              <td>Emerging</td>
            </tr>
            <tr>
              <td>Gradient Boosting</td>
              <td>Ensemble ML</td>
              <td>Nonlinear</td>
              <td>Low</td>
              <td>High</td>
              <td>Emerging</td>
            </tr>
            <tr>
              <td>Neural Networks</td>
              <td>ML</td>
              <td>Nonlinear</td>
              <td>Low</td>
              <td>High</td>
              <td>Limited</td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
      <p>Another important invention in classification studies was Support Vector Machines (SVM). Theoretically, the SVM showed excellent generalization characteristics when optimal hyperplanes constructed in a high-dimensional feature space are used [<xref ref-type="bibr" rid="B26">26</xref>]. Competitive or better results were found in empirical comparisons of credit scoring applications with logistic regression [<xref ref-type="bibr" rid="B13">13</xref>]. However, just like neural networks, SVM models were sometimes viewed as less transparent and more computationally expensive, which makes them difficult to regulate and scale to operations. The research on credit risk modeling was changed by the appearance of decision tree-based approaches. Decision trees provide a hierarchical framework that is easily intuitive and further divides the data into non-heterogeneous risk areas. They are rule-based, making them more interpretable than other machine learning techniques. Nevertheless, decision trees that stand alone are unstable and prone to high variance. To overcome these shortcomings, the idea of ensemble learning, like the Random Forests or Gradient Boosting Machines (GBM), was invented [<xref ref-type="bibr" rid="B11">11</xref>][<xref ref-type="bibr" rid="B14">14</xref>]. Random Forests are a combination of several decision trees, which are built on bootstrap samples, and thus lead to lowering the variance and enhancing the predictive performance. Gradient Boosting Machines do so by adding weak learners in a serial fashion to reduce classification error and successfully attain high discrimination. Boosting algorithms, including XGBoost and LightGBM, have been shown to outperform a host of other models in credit risk modeling [<xref ref-type="bibr" rid="B12">12</xref>][<xref ref-type="bibr" rid="B15">15</xref>]. Their capability to auto-model nonlinearities and interaction effects minimizes the manual feature engineering to a great extent. Several empirical studies, on a large scale, have pitted logistic regression against existing ensemble algorithms. In such comparisons, it is frequently mentioned that boosting algorithms perform better in terms of AUC-ROC and Gini coefficient, in comparison with logistic regressions [<xref ref-type="bibr" rid="B12">12</xref>][<xref ref-type="bibr" rid="B14">14</xref>][<xref ref-type="bibr" rid="B27">27</xref>]. However, the degree of improvement varies depending on the properties of the dataset, the preprocessing techniques, and the indicators of improvement. In other cases, the logistic regression can be not only competitive with the strong feature engineering and monotonic transformations [<xref ref-type="bibr" rid="B5">5</xref>]. It means that some part of the performance difference might be due to the depiction of features and not the excellence of an algorithm in particular. The methodological taxonomy of credit risk modeling approaches is presented in <xref ref-type="fig" rid="fig3">Figure 3</xref>.</p>
      <fig id="fig3">
        <label>Figure 3</label>
        <graphic xlink:href="https://html.scirp.org/file/1733495-rId17.jpeg?20260427031641" />
      </fig>
      <p><bold>Figure 3</bold><bold>.</bold>Taxonomy of major credit risk modeling approaches used in banking applications.</p>
      <p>The second dimension that is of significance in the literature is that of calibration. Whereas the actions of discrimination determine performance, calibration determines the consistency between the forecasted likelihoods and the actual default rates. There have been studies that highly flexible machine learning models might need extra calibration procedures, e.g., Platt scaling or isotonic regression, to deliver dependable estimates of PD [<xref ref-type="bibr" rid="B19">19</xref>][<xref ref-type="bibr" rid="B28">28</xref>][<xref ref-type="bibr" rid="B29">29</xref>]. Logistic regression, in its turn, is optimized over likelihood-based probability estimation and can have more robust calibration properties. Since both regulatory capital and accounting provisions are dependent on PD levels, calibration-related issues are especially important in banking. The credit scoring studies have also paid much attention to the problem of the imbalance of classes. As the default events usually constitute a minor percentage of the total observations, there is a chance that the classifiers have a bias in the majority class. Such techniques as Synthetic Minority Over-sampling Technique (SMOTE), cost-sensitive learning, and threshold adjustment have been offered to reduce the impact of imbalances [<xref ref-type="bibr" rid="B21">21</xref>][<xref ref-type="bibr" rid="B30">30</xref>][<xref ref-type="bibr" rid="B31">31</xref>]. Comparative studies indicate that the imbalance can be effectively addressed when the ensemble methods are used in combination with the proper sampling strategy, although logistic regression can also be very robust in the event of appropriate specification. More recently, the literature has extended to cover deep learning structures, especially within a setting with large-scale alternative data. The deep neural network has the ability to learn intricate nonlinear and multi-dimensional interactions, and this may enhance predictors [<xref ref-type="bibr" rid="B14">14</xref>][<xref ref-type="bibr" rid="B32">32</xref>]. Nonetheless, the issues of interpretability, computational expense, and control have curtailed their use among conventional banking organizations. This interpretability debate has been on the rise with the popularity of machine learning models. Model risk management regulatory direction puts stress on transparency and explainability [<xref ref-type="bibr" rid="B16">16</xref>]. Researchers have, in turn, developed methods to explain complex models using post-hoc methods like SHAP and LIME as responses [<xref ref-type="bibr" rid="B22">22</xref>][<xref ref-type="bibr" rid="B23">23</xref>]. In empirical studies, SHAP values have been shown to be able to offer consistent feature attribution to an ensemble model, with insights that are similar in information to the logistic regression coefficients. However, other researchers suggest that post-hoc models might not be in a position to replace naturally interpretable models in the high-stakes financial decision-making scenarios [<xref ref-type="bibr" rid="B18">18</xref>]. Key strengths and limitations across methodological dimensions are summarized in <bold>Table 3</bold>.</p>
      <p><bold>Table 3</bold><bold>.</bold>Strengths and limitations of logistic regression and machine learning.</p>
      <table-wrap id="tbl3">
        <label>Table 3</label>
        <table>
          <tbody>
            <tr>
              <td>Dimension</td>
              <td>Logistic Regression</td>
              <td>Machine Learning</td>
            </tr>
            <tr>
              <td>Theoretical Transparency</td>
              <td>Strong Statistical Basis</td>
              <td>Often Algorithm-Driven</td>
            </tr>
            <tr>
              <td>Handling Nonlinearity</td>
              <td>Requires Transformation</td>
              <td>Captures Automatically</td>
            </tr>
            <tr>
              <td>Overfitting Risk</td>
              <td>Moderate</td>
              <td>Higher (Without Regularization)</td>
            </tr>
            <tr>
              <td>Data Requirement</td>
              <td>Moderate</td>
              <td>Often Large</td>
            </tr>
            <tr>
              <td>Calibration</td>
              <td>Generally Stable</td>
              <td>May Need Post-Calibration</td>
            </tr>
            <tr>
              <td>Explainability</td>
              <td>Direct</td>
              <td>Post-Hoc Methods (e.g., SHAP)</td>
            </tr>
            <tr>
              <td>Implementation Cost</td>
              <td>Lower</td>
              <td>Higher</td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
      <p>Predictive improvements have also been studied in relation to their economic value. Although any gains in AUC show an improved discrimination, the resulting statistical gains in monetary gains rely on cutoff strategies, portfolio composition, and risk-based pricing policies [<xref ref-type="bibr" rid="B25">25</xref>]. Other studies indicate that there is a small amount of AUC incremental profitability when operational constraints are taken into account. This fact highlights the significance of analyzing models based not only on statistical measures, but also on economic and strategic consequences. All in all, the history of credit risk modeling can be summarized as the development of linear statistical classifiers, more complex ensemble and deep learning techniques. Logistic regression is entrenched in the practice of regulation because it is interpretable and stable compared to machine learning approaches, which have superior predictive flexibility and could deliver improved performance [<xref ref-type="bibr" rid="B29">29</xref>][<xref ref-type="bibr" rid="B33">33</xref>]-[<xref ref-type="bibr" rid="B35">35</xref>]. According to the literature, it is believed that there is no single approach that is dominant in all the evaluation criteria. Alternatively, the comparative benefits of logistic regression and machine learning are determined by the characteristics of data, regulatory limitations, and institutional interests. This literature forms the basis of the comparison analysis that has been conducted within this study. The current paper aims to elucidate the trade-offs between conventional and modern modeling methods in modern banking settings based on the synthesis of the results within the realms of statistical, machine learning, and regulatory modelling [<xref ref-type="bibr" rid="B36">36</xref>]-[<xref ref-type="bibr" rid="B38">38</xref>].</p>
    </sec>
    <sec id="sec3">
      <title>3. Conceptual and Analytical Framework for Comparative Evaluation</title>
      <p>This study does not implement models on a single empirical dataset. Instead, the methodological framework serves as a conceptual and analytical structure that standardizes how logistic regression and machine learning approaches are compared across the literature. The framework integrates commonly used modeling pipelines, evaluation metrics, and validation practices reported in prior empirical studies to ensure consistency in comparative interpretation. The methodological framework of this study is designed to provide a rigorous and comprehensive comparison between logistic regression and selected machine learning algorithms for credit risk modeling in banking. The objective is not limited to evaluating predictive accuracy; rather, it encompasses discrimination, calibration, stability, interpretability, robustness, and governance suitability under banking regulatory environments [<xref ref-type="bibr" rid="B39">39</xref>]-[<xref ref-type="bibr" rid="B42">42</xref>]. The framework is structured to reflect the complete credit modeling lifecycle, from data preprocessing and feature engineering to model estimation, validation, calibration, economic evaluation, and robustness testing. This integrated design ensures that comparisons are meaningful within the operational realities of financial institutions operating under Basel capital standards and forward-looking expected credit loss (ECL) accounting requirements [<xref ref-type="bibr" rid="B1">1</xref>]-[<xref ref-type="bibr" rid="B3">3</xref>]. The framework is developed with primary relevance to retail and SME credit portfolios, where model deployment typically involves high-dimensional borrower data, behavioral variables, and regulatory requirements for PD estimation and expected loss calculation.</p>
      <p>The modeling problem is formulated as a supervised binary classification task. Let <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> Y </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> ∈ </mml:mo><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:mn> 0 </mml:mn><mml:mo> , </mml:mo><mml:mn> 1 </mml:mn></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> denote the default indicator for borrower <inline-formula><mml:math><mml:mi> i </mml:mi></mml:math></inline-formula> , where <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> Y </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> represents default within a specified observation horizon, typically 12 months in retail banking portfolios. The feature vector for borrower <inline-formula><mml:math><mml:mi> i </mml:mi></mml:math></inline-formula> is represented as <inline-formula><mml:math><mml:mrow><mml:msub><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> X </mml:mi></mml:mstyle><mml:mi> i </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mn> 1 </mml:mn></mml:mrow></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mn> 2 </mml:mn></mml:mrow></mml:msub><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> p </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , comprising demographic, financial, behavioral, and macroeconomic predictors. The objective is to estimate the conditional probability of default [<xref ref-type="bibr" rid="B43">43</xref>]-[<xref ref-type="bibr" rid="B46">46</xref>]:</p>
      <disp-formula id="FD1">
        <mml:math display="inline">
          <mml:mrow>
            <mml:mi>P</mml:mi>
            <mml:msub>
              <mml:mi>D</mml:mi>
              <mml:mi>i</mml:mi>
            </mml:msub>
            <mml:mo>=</mml:mo>
            <mml:mi>P</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:msub>
                  <mml:mi>Y</mml:mi>
                  <mml:mi>i</mml:mi>
                </mml:msub>
                <mml:mo>=</mml:mo>
                <mml:mn>1</mml:mn>
                <mml:mrow>
                  <mml:mo>|</mml:mo>
                  <mml:mrow>
                    <mml:msub>
                      <mml:mi>X</mml:mi>
                      <mml:mi>i</mml:mi>
                    </mml:msub>
                  </mml:mrow>
                </mml:mrow>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>Data preprocessing constitutes a critical initial step in the modeling process. Missing values are addressed using statistically justified imputation methods, such as mean imputation for continuous variables or mode imputation for categorical variables, though more advanced techniques such as k-nearest neighbor imputation may also be considered when data patterns warrant [<xref ref-type="bibr" rid="B5">5</xref>][<xref ref-type="bibr" rid="B47">47</xref>]-[<xref ref-type="bibr" rid="B49">49</xref>]. Outliers are treated through winsorization or robust scaling to prevent undue influence on parameter estimation. Continuous predictors are standardized where necessary, particularly for algorithms sensitive to feature scale, such as Support Vector Machines and neural networks [<xref ref-type="bibr" rid="B26">26</xref>][<xref ref-type="bibr" rid="B50">50</xref>]. The complete modeling lifecycle adopted in this study is illustrated in <xref ref-type="fig" rid="fig4">Figure 4</xref>.</p>
      <fig id="fig4">
        <label>Figure 4</label>
        <graphic xlink:href="https://html.scirp.org/file/1733495-rId30.jpeg?20260427031641" />
      </fig>
      <p><bold>Figure 4</bold><bold>.</bold>End-to-end methodological workflow for credit risk modeling from data preprocessing to model validation and economic evaluation.</p>
      <p>In traditional banking scorecard development, feature engineering plays a central role. Continuous variables are discretized into risk-relevant intervals, and Weight of Evidence (WoE) encoding is applied to transform categorical predictors into monotonic representations aligned with default risk [<xref ref-type="bibr" rid="B6">6</xref>][<xref ref-type="bibr" rid="B51">51</xref>][<xref ref-type="bibr" rid="B52">52</xref>]. The WoE transformation for a bin <inline-formula><mml:math><mml:mi> j </mml:mi></mml:math></inline-formula> is defined as:</p>
      <disp-formula id="FD2">
        <mml:math display="inline">
          <mml:mrow>
            <mml:msub>
              <mml:mrow>
                <mml:mtext>WoE</mml:mtext>
              </mml:mrow>
              <mml:mi>j</mml:mi>
            </mml:msub>
            <mml:mo>=</mml:mo>
            <mml:mi>ln</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:mfrac>
                  <mml:mrow>
                    <mml:mi>%</mml:mi>
                    <mml:msub>
                      <mml:mrow>
                        <mml:mtext>Non-Default</mml:mtext>
                      </mml:mrow>
                      <mml:mi>j</mml:mi>
                    </mml:msub>
                  </mml:mrow>
                  <mml:mrow>
                    <mml:mi>%</mml:mi>
                    <mml:msub>
                      <mml:mrow>
                        <mml:mtext>Default</mml:mtext>
                      </mml:mrow>
                      <mml:mi>j</mml:mi>
                    </mml:msub>
                  </mml:mrow>
                </mml:mfrac>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>which stabilizes logistic regression coefficients and improves interpretability [<xref ref-type="bibr" rid="B53">53</xref>][<xref ref-type="bibr" rid="B54">54</xref>]. The Information Value (IV) metric is frequently used to assess predictor strength:</p>
      <disp-formula id="FD3">
        <mml:math display="inline">
          <mml:mrow>
            <mml:mtext>IV</mml:mtext>
            <mml:mo>=</mml:mo>
            <mml:munder>
              <mml:mstyle mathsize="140%" displaystyle="true">
                <mml:mo>∑</mml:mo>
              </mml:mstyle>
              <mml:mi>j</mml:mi>
            </mml:munder>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:mi>%</mml:mi>
                <mml:msub>
                  <mml:mrow>
                    <mml:mtext>Non-Default</mml:mtext>
                  </mml:mrow>
                  <mml:mi>j</mml:mi>
                </mml:msub>
                <mml:mo>−</mml:mo>
                <mml:mi>%</mml:mi>
                <mml:msub>
                  <mml:mrow>
                    <mml:mtext>Default</mml:mtext>
                  </mml:mrow>
                  <mml:mi>j</mml:mi>
                </mml:msub>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>×</mml:mo>
            <mml:msub>
              <mml:mrow>
                <mml:mtext>WoE</mml:mtext>
              </mml:mrow>
              <mml:mi>j</mml:mi>
            </mml:msub>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>Variables with low IV values may be excluded to enhance parsimony and reduce noise [<xref ref-type="bibr" rid="B5">5</xref>]. The baseline model employed in this study is logistic regression. The logistic model assumes that the log-odds of default are linearly related to predictors:</p>
      <disp-formula id="FD4">
        <mml:math>
          <mml:mrow>
            <mml:mi>log</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:mfrac>
                  <mml:mrow>
                    <mml:mi>P</mml:mi>
                    <mml:msub>
                      <mml:mi>D</mml:mi>
                      <mml:mi>i</mml:mi>
                    </mml:msub>
                  </mml:mrow>
                  <mml:mrow>
                    <mml:mn>1</mml:mn>
                    <mml:mo>−</mml:mo>
                    <mml:mi>P</mml:mi>
                    <mml:msub>
                      <mml:mi>D</mml:mi>
                      <mml:mi>i</mml:mi>
                    </mml:msub>
                  </mml:mrow>
                </mml:mfrac>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:msub>
              <mml:mi>β</mml:mi>
              <mml:mn>0</mml:mn>
            </mml:msub>
            <mml:mo>+</mml:mo>
            <mml:munderover>
              <mml:mstyle mathsize="140%" displaystyle="true">
                <mml:mo>∑</mml:mo>
              </mml:mstyle>
              <mml:mrow>
                <mml:mi>k</mml:mi>
                <mml:mo>=</mml:mo>
                <mml:mn>1</mml:mn>
              </mml:mrow>
              <mml:mi>p</mml:mi>
            </mml:munderover>
            <mml:msub>
              <mml:mi>β</mml:mi>
              <mml:mi>k</mml:mi>
            </mml:msub>
            <mml:msub>
              <mml:mi>x</mml:mi>
              <mml:mrow>
                <mml:mi>i</mml:mi>
                <mml:mi>k</mml:mi>
              </mml:mrow>
            </mml:msub>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>Rearranging yields the logistic function:</p>
      <disp-formula id="FD5">
        <mml:math>
          <mml:mrow>
            <mml:mi>P</mml:mi>
            <mml:msub>
              <mml:mi>D</mml:mi>
              <mml:mi>i</mml:mi>
            </mml:msub>
            <mml:mo>=</mml:mo>
            <mml:mfrac>
              <mml:mn>1</mml:mn>
              <mml:mrow>
                <mml:mn>1</mml:mn>
                <mml:mo>+</mml:mo>
                <mml:msup>
                  <mml:mtext>e</mml:mtext>
                  <mml:mrow>
                    <mml:mo>−</mml:mo>
                    <mml:mrow>
                      <mml:mo>(</mml:mo>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>β</mml:mi>
                          <mml:mn>0</mml:mn>
                        </mml:msub>
                        <mml:mo>+</mml:mo>
                        <mml:mstyle displaystyle="true">
                          <mml:msubsup>
                            <mml:mo>∑</mml:mo>
                            <mml:mrow>
                              <mml:mi>k</mml:mi>
                              <mml:mo>=</mml:mo>
                              <mml:mn>1</mml:mn>
                            </mml:mrow>
                            <mml:mi>p</mml:mi>
                          </mml:msubsup>
                          <mml:mrow>
                            <mml:msub>
                              <mml:mi>β</mml:mi>
                              <mml:mi>k</mml:mi>
                            </mml:msub>
                            <mml:msub>
                              <mml:mi>x</mml:mi>
                              <mml:mrow>
                                <mml:mi>i</mml:mi>
                                <mml:mi>k</mml:mi>
                              </mml:mrow>
                            </mml:msub>
                          </mml:mrow>
                        </mml:mstyle>
                      </mml:mrow>
                      <mml:mo>)</mml:mo>
                    </mml:mrow>
                  </mml:mrow>
                </mml:msup>
              </mml:mrow>
            </mml:mfrac>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>Parameter estimation is conducted via maximum likelihood estimation (MLE), maximizing the log-likelihood function:</p>
      <disp-formula id="FD6">
        <mml:math>
          <mml:mrow>
            <mml:mi>ℓ</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mi>β</mml:mi>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:munderover>
              <mml:mstyle mathsize="140%" displaystyle="true">
                <mml:mo>∑</mml:mo>
              </mml:mstyle>
              <mml:mrow>
                <mml:mi>i</mml:mi>
                <mml:mo>=</mml:mo>
                <mml:mn>1</mml:mn>
              </mml:mrow>
              <mml:mi>n</mml:mi>
            </mml:munderover>
            <mml:mrow>
              <mml:mo>[</mml:mo>
              <mml:mrow>
                <mml:msub>
                  <mml:mi>Y</mml:mi>
                  <mml:mi>i</mml:mi>
                </mml:msub>
                <mml:mi>log</mml:mi>
                <mml:mrow>
                  <mml:mo>(</mml:mo>
                  <mml:mrow>
                    <mml:mi>P</mml:mi>
                    <mml:msub>
                      <mml:mi>D</mml:mi>
                      <mml:mi>i</mml:mi>
                    </mml:msub>
                  </mml:mrow>
                  <mml:mo>)</mml:mo>
                </mml:mrow>
                <mml:mo>+</mml:mo>
                <mml:mrow>
                  <mml:mo>(</mml:mo>
                  <mml:mrow>
                    <mml:mn>1</mml:mn>
                    <mml:mo>−</mml:mo>
                    <mml:msub>
                      <mml:mi>Y</mml:mi>
                      <mml:mi>i</mml:mi>
                    </mml:msub>
                  </mml:mrow>
                  <mml:mo>)</mml:mo>
                </mml:mrow>
                <mml:mtext>log</mml:mtext>
                <mml:mrow>
                  <mml:mo>(</mml:mo>
                  <mml:mrow>
                    <mml:mn>1</mml:mn>
                    <mml:mo>−</mml:mo>
                    <mml:mi>P</mml:mi>
                    <mml:msub>
                      <mml:mi>D</mml:mi>
                      <mml:mi>i</mml:mi>
                    </mml:msub>
                  </mml:mrow>
                  <mml:mo>)</mml:mo>
                </mml:mrow>
              </mml:mrow>
              <mml:mo>]</mml:mo>
            </mml:mrow>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>Regularization techniques are introduced to mitigate overfitting and multicollinearity. Ridge regression adds an <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> L </mml:mi><mml:mn> 2 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> penalty term <inline-formula><mml:math><mml:mrow><mml:mi> λ </mml:mi><mml:mstyle displaystyle="true"><mml:mo> ∑ </mml:mo><mml:mrow><mml:msubsup><mml:mi> β </mml:mi><mml:mi> k </mml:mi><mml:mn> 2 </mml:mn></mml:msubsup></mml:mrow></mml:mstyle></mml:mrow></mml:math></inline-formula> , while Lasso regression incorporates an <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> L </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> penalty <inline-formula><mml:math><mml:mrow><mml:mi> λ </mml:mi><mml:mstyle displaystyle="true"><mml:mo> ∑ </mml:mo><mml:mrow><mml:mrow><mml:mo> | </mml:mo><mml:mrow><mml:msub><mml:mi> β </mml:mi><mml:mi> k </mml:mi></mml:msub></mml:mrow><mml:mo> | </mml:mo></mml:mrow></mml:mrow></mml:mstyle></mml:mrow></mml:math></inline-formula> , encouraging sparsity [<xref ref-type="bibr" rid="B8">8</xref>]. Hyperparameter <inline-formula><mml:math><mml:mi> λ </mml:mi></mml:math></inline-formula> is selected via cross-validation. To compare logistic regression with more flexible models, ensemble machine learning techniques are implemented [<xref ref-type="bibr" rid="B55">55</xref>][<xref ref-type="bibr" rid="B56">56</xref>]. Random Forest constructs multiple decision trees on bootstrapped samples and aggregates predictions via majority voting or probability averaging [<xref ref-type="bibr" rid="B11">11</xref>]. Each tree partitions the feature space recursively to minimize impurity measures such as the Gini index:</p>
      <disp-formula id="FD7">
        <mml:math>
          <mml:mrow>
            <mml:mi>G</mml:mi>
            <mml:mi>i</mml:mi>
            <mml:mi>n</mml:mi>
            <mml:mi>i</mml:mi>
            <mml:mo>=</mml:mo>
            <mml:mn>1</mml:mn>
            <mml:mo>−</mml:mo>
            <mml:mstyle displaystyle="true">
              <mml:munderover>
                <mml:mo>∑</mml:mo>
                <mml:mrow>
                  <mml:mi>c</mml:mi>
                  <mml:mo>=</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
                <mml:mi>C</mml:mi>
              </mml:munderover>
              <mml:mrow>
                <mml:msubsup>
                  <mml:mi>p</mml:mi>
                  <mml:mi>c</mml:mi>
                  <mml:mn>2</mml:mn>
                </mml:msubsup>
              </mml:mrow>
            </mml:mstyle>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>where <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> p </mml:mi><mml:mi> c </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the class proportion in a node. By averaging across trees, Random Forest reduces variance and enhances generalization [<xref ref-type="bibr" rid="B57">57</xref>]-[<xref ref-type="bibr" rid="B59">59</xref>]. Gradient Boosting Machines (GBM) sequentially fit weak learners to residual errors, minimizing a differentiable loss function. For binary classification, the logistic loss function is typically used:</p>
      <disp-formula id="FD8">
        <mml:math display="inline">
          <mml:mrow>
            <mml:mi>L</mml:mi>
            <mml:mo>=</mml:mo>
            <mml:mstyle displaystyle="true">
              <mml:munderover>
                <mml:mo>∑</mml:mo>
                <mml:mrow>
                  <mml:mi>i</mml:mi>
                  <mml:mo>=</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
                <mml:mi>n</mml:mi>
              </mml:munderover>
              <mml:mrow>
                <mml:mtext>log</mml:mtext>
                <mml:mrow>
                  <mml:mo>(</mml:mo>
                  <mml:mrow>
                    <mml:mn>1</mml:mn>
                    <mml:mo>+</mml:mo>
                    <mml:msup>
                      <mml:mtext>e</mml:mtext>
                      <mml:mrow>
                        <mml:mo>−</mml:mo>
                        <mml:msub>
                          <mml:mi>Y</mml:mi>
                          <mml:mi>i</mml:mi>
                        </mml:msub>
                        <mml:mi>F</mml:mi>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mrow>
                            <mml:msub>
                              <mml:mi>X</mml:mi>
                              <mml:mi>i</mml:mi>
                            </mml:msub>
                          </mml:mrow>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:msup>
                  </mml:mrow>
                  <mml:mo>)</mml:mo>
                </mml:mrow>
              </mml:mrow>
            </mml:mstyle>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>where <inline-formula><mml:math><mml:mrow><mml:mi> F </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> X </mml:mi></mml:mstyle><mml:mi> i </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> represents the ensemble model. At each iteration <inline-formula><mml:math><mml:mi> m </mml:mi></mml:math></inline-formula> , the model updates as:</p>
      <disp-formula id="FD9">
        <mml:math>
          <mml:mrow>
            <mml:msub>
              <mml:mi>F</mml:mi>
              <mml:mi>m</mml:mi>
            </mml:msub>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mi>X</mml:mi>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:msub>
              <mml:mi>F</mml:mi>
              <mml:mrow>
                <mml:mi>m</mml:mi>
                <mml:mo>−</mml:mo>
                <mml:mn>1</mml:mn>
              </mml:mrow>
            </mml:msub>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mi>X</mml:mi>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>+</mml:mo>
            <mml:msub>
              <mml:mi>γ</mml:mi>
              <mml:mi>m</mml:mi>
            </mml:msub>
            <mml:msub>
              <mml:mi>h</mml:mi>
              <mml:mi>m</mml:mi>
            </mml:msub>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mi>X</mml:mi>
              <mml:mo>)</mml:mo>
            </mml:mrow>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>with <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> h </mml:mi><mml:mi> m </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> representing the fitted weak learner and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> γ </mml:mi><mml:mi> m </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> the learning rate [<xref ref-type="bibr" rid="B14">14</xref>]. Hyperparameters such as tree depth, number of estimators, and learning rate are optimized using grid search combined with cross-validation. Support Vector Machines (SVMs) are also evaluated due to their strong theoretical generalization properties [<xref ref-type="bibr" rid="B26">26</xref>]. SVM solves the optimization problem:</p>
      <disp-formula id="FD10">
        <mml:math>
          <mml:mrow>
            <mml:munder>
              <mml:mrow>
                <mml:mtext>min</mml:mtext>
              </mml:mrow>
              <mml:mrow>
                <mml:mi>w</mml:mi>
                <mml:mo>,</mml:mo>
                <mml:mi>b</mml:mi>
              </mml:mrow>
            </mml:munder>
            <mml:mfrac>
              <mml:mn>1</mml:mn>
              <mml:mn>2</mml:mn>
            </mml:mfrac>
            <mml:msup>
              <mml:mrow>
                <mml:mrow>
                  <mml:mo>‖</mml:mo>
                  <mml:mi>w</mml:mi>
                  <mml:mo>‖</mml:mo>
                </mml:mrow>
              </mml:mrow>
              <mml:mn>2</mml:mn>
            </mml:msup>
            <mml:mo>+</mml:mo>
            <mml:mi>C</mml:mi>
            <mml:mstyle displaystyle="true">
              <mml:munderover>
                <mml:mo>∑</mml:mo>
                <mml:mrow>
                  <mml:mi>i</mml:mi>
                  <mml:mo>=</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
                <mml:mi>n</mml:mi>
              </mml:munderover>
              <mml:mrow>
                <mml:msub>
                  <mml:mi>ξ</mml:mi>
                  <mml:mi>i</mml:mi>
                </mml:msub>
              </mml:mrow>
            </mml:mstyle>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>subject to:</p>
      <disp-formula id="FD11">
        <mml:math>
          <mml:mrow>
            <mml:msub>
              <mml:mi>Y</mml:mi>
              <mml:mi>i</mml:mi>
            </mml:msub>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:mi>w</mml:mi>
                <mml:mo>⋅</mml:mo>
                <mml:mi>ϕ</mml:mi>
                <mml:mrow>
                  <mml:mo>(</mml:mo>
                  <mml:mrow>
                    <mml:msub>
                      <mml:mi>X</mml:mi>
                      <mml:mi>i</mml:mi>
                    </mml:msub>
                  </mml:mrow>
                  <mml:mo>)</mml:mo>
                </mml:mrow>
                <mml:mo>+</mml:mo>
                <mml:mi>b</mml:mi>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>≥</mml:mo>
            <mml:mn>1</mml:mn>
            <mml:mo>−</mml:mo>
            <mml:msub>
              <mml:mi>ξ</mml:mi>
              <mml:mi>i</mml:mi>
            </mml:msub>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>where <inline-formula><mml:math><mml:mrow><mml:mi> ϕ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> X </mml:mi></mml:mstyle><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> represents a kernel transformation and <inline-formula><mml:math><mml:mi> C </mml:mi></mml:math></inline-formula> is the regularization parameter controlling the trade-off between margin width and misclassification. The multi-dimensional validation framework used to compare models is presented in <xref ref-type="fig" rid="fig5">Figure 5</xref>.</p>
      <fig id="fig5">
        <label>Figure 5</label>
        <graphic xlink:href="https://html.scirp.org/file/1733495-rId77.jpeg?20260427031641" />
      </fig>
      <p><bold>Figure 5</bold><bold>.</bold> Framework for model performance assessment, including discrimination, calibration, stability, and economic evaluation.</p>
      <p>Artificial neural networks (ANN) are modeled as multilayer perceptrons with nonlinear activation functions. For a single hidden-layer network, predictions are given by:</p>
      <disp-formula id="FD12">
        <mml:math display="inline">
          <mml:mrow>
            <mml:mi>P</mml:mi>
            <mml:msub>
              <mml:mi>D</mml:mi>
              <mml:mi>i</mml:mi>
            </mml:msub>
            <mml:mo>=</mml:mo>
            <mml:mi>σ</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:munderover>
                  <mml:mstyle mathsize="140%" displaystyle="true">
                    <mml:mo>∑</mml:mo>
                  </mml:mstyle>
                  <mml:mrow>
                    <mml:mi>j</mml:mi>
                    <mml:mo>=</mml:mo>
                    <mml:mn>1</mml:mn>
                  </mml:mrow>
                  <mml:mi>H</mml:mi>
                </mml:munderover>
                <mml:msub>
                  <mml:mi>w</mml:mi>
                  <mml:mi>j</mml:mi>
                </mml:msub>
                <mml:mo>⋅</mml:mo>
                <mml:mi>g</mml:mi>
                <mml:mrow>
                  <mml:mo>(</mml:mo>
                  <mml:mrow>
                    <mml:mstyle displaystyle="true">
                      <mml:munderover>
                        <mml:mo>∑</mml:mo>
                        <mml:mrow>
                          <mml:mi>k</mml:mi>
                          <mml:mo>=</mml:mo>
                          <mml:mn>1</mml:mn>
                        </mml:mrow>
                        <mml:mi>p</mml:mi>
                      </mml:munderover>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>v</mml:mi>
                          <mml:mrow>
                            <mml:mi>j</mml:mi>
                            <mml:mi>k</mml:mi>
                          </mml:mrow>
                        </mml:msub>
                        <mml:msub>
                          <mml:mi>x</mml:mi>
                          <mml:mrow>
                            <mml:mi>i</mml:mi>
                            <mml:mi>k</mml:mi>
                          </mml:mrow>
                        </mml:msub>
                        <mml:mo>+</mml:mo>
                        <mml:msub>
                          <mml:mi>b</mml:mi>
                          <mml:mi>j</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:mstyle>
                  </mml:mrow>
                  <mml:mo>)</mml:mo>
                </mml:mrow>
                <mml:mo>+</mml:mo>
                <mml:mi>c</mml:mi>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>where <inline-formula><mml:math><mml:mrow><mml:mi> g </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mo> ⋅ </mml:mo><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is a hidden-layer activation function, <inline-formula><mml:math><mml:mrow><mml:mi> σ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mo> ⋅ </mml:mo><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the logistic output function, and <inline-formula><mml:math><mml:mi> H </mml:mi></mml:math></inline-formula> is the number of hidden neurons. Model evaluation emphasizes discrimination, calibration, and stability. Discrimination is measured using the Area Under the Receiver Operating Characteristic Curve (AUC):</p>
      <disp-formula id="FD13">
        <mml:math>
          <mml:mrow>
            <mml:mi>A</mml:mi>
            <mml:mi>U</mml:mi>
            <mml:mi>C</mml:mi>
            <mml:mo>=</mml:mo>
            <mml:mstyle displaystyle="true">
              <mml:mrow>
                <mml:msubsup>
                  <mml:mo>∫</mml:mo>
                  <mml:mn>0</mml:mn>
                  <mml:mn>1</mml:mn>
                </mml:msubsup>
                <mml:mrow>
                  <mml:mi>T</mml:mi>
                  <mml:mi>P</mml:mi>
                  <mml:mi>R</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:mi>F</mml:mi>
                      <mml:mi>P</mml:mi>
                      <mml:msup>
                        <mml:mi>R</mml:mi>
                        <mml:mrow>
                          <mml:mo>−</mml:mo>
                          <mml:mn>1</mml:mn>
                        </mml:mrow>
                      </mml:msup>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mi>t</mml:mi>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mtext>d</mml:mtext>
                  <mml:mi>t</mml:mi>
                </mml:mrow>
              </mml:mrow>
            </mml:mstyle>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>where TPR and FPR denote true positive and false positive rates, the Gini coefficient is computed as:</p>
      <disp-formula id="FD14">
        <mml:math>
          <mml:mrow>
            <mml:mi>G</mml:mi>
            <mml:mi>i</mml:mi>
            <mml:mi>n</mml:mi>
            <mml:mi>i</mml:mi>
            <mml:mo>=</mml:mo>
            <mml:mn>2</mml:mn>
            <mml:mo>×</mml:mo>
            <mml:mi>A</mml:mi>
            <mml:mi>U</mml:mi>
            <mml:mi>C</mml:mi>
            <mml:mo>−</mml:mo>
            <mml:mn>1</mml:mn>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>Calibration accuracy is evaluated using the Brier score:</p>
      <disp-formula id="FD15">
        <mml:math>
          <mml:mrow>
            <mml:mi>B</mml:mi>
            <mml:mi>r</mml:mi>
            <mml:mi>i</mml:mi>
            <mml:mi>e</mml:mi>
            <mml:mi>r</mml:mi>
            <mml:mo>=</mml:mo>
            <mml:mfrac>
              <mml:mn>1</mml:mn>
              <mml:mi>n</mml:mi>
            </mml:mfrac>
            <mml:munderover>
              <mml:mstyle mathsize="140%" displaystyle="true">
                <mml:mo>∑</mml:mo>
              </mml:mstyle>
              <mml:mrow>
                <mml:mi>i</mml:mi>
                <mml:mo>=</mml:mo>
                <mml:mn>1</mml:mn>
              </mml:mrow>
              <mml:mi>n</mml:mi>
            </mml:munderover>
            <mml:msup>
              <mml:mrow>
                <mml:mrow>
                  <mml:mo>(</mml:mo>
                  <mml:mrow>
                    <mml:mi>P</mml:mi>
                    <mml:msub>
                      <mml:mi>D</mml:mi>
                      <mml:mi>i</mml:mi>
                    </mml:msub>
                    <mml:mo>−</mml:mo>
                    <mml:msub>
                      <mml:mi>Y</mml:mi>
                      <mml:mi>i</mml:mi>
                    </mml:msub>
                  </mml:mrow>
                  <mml:mo>)</mml:mo>
                </mml:mrow>
              </mml:mrow>
              <mml:mn>2</mml:mn>
            </mml:msup>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>and calibration plots comparing predicted and observed default rates across deciles [<xref ref-type="bibr" rid="B19">19</xref>]. The main algorithms evaluated and their core hyperparameters are summarized in <bold>Table 4</bold>.</p>
      <p><bold>Table 4</bold><bold>.</bold>Summary of modeling techniques and key tuning parameters.</p>
      <table-wrap id="tbl4">
        <label>Table 4</label>
        <table>
          <tbody>
            <tr>
              <td>Model</td>
              <td>Core Objective</td>
              <td>Key Hyperparameters</td>
              <td>Strength</td>
              <td>Limitation</td>
            </tr>
            <tr>
              <td>Logistic Regression</td>
              <td>Maximize Likelihood</td>
              <td>
                Regularization (
                <italic>λ</italic>
                ), Penalty Type
              </td>
              <td>High Interpretability</td>
              <td>Linear Assumption</td>
            </tr>
            <tr>
              <td>Random Forest</td>
              <td>Reduce Variance via Bagging</td>
              <td>Number of Trees, Max Depth, Feature Subset</td>
              <td>Robust &amp; Stable</td>
              <td>Lower Transparency</td>
            </tr>
            <tr>
              <td>Gradient Boosting</td>
              <td>Minimize Loss Sequentially</td>
              <td>Learning Rate, Estimators, Depth</td>
              <td>High Predictive Power</td>
              <td>Risk of Overfitting</td>
            </tr>
            <tr>
              <td>SVM</td>
              <td>Maximize Margin</td>
              <td>Kernel Type, C, Gamma</td>
              <td>Strong Theoretical Basis</td>
              <td>Computationally Intensive</td>
            </tr>
            <tr>
              <td>Neural Network</td>
              <td>Nonlinear Function Approximation</td>
              <td>Layers, Neurons, Activation, Learning Rate</td>
              <td>Flexible Modeling</td>
              <td>Low Interpretability</td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
      <p>Temporal validation is performed to test out-of-time stability. Models trained on historical periods are evaluated on subsequent periods to assess performance under distribution shifts. The Population Stability Index (PSI) is calculated to quantify changes in predictor distributions:</p>
      <disp-formula id="FD16">
        <mml:math display="inline">
          <mml:mrow>
            <mml:mi>P</mml:mi>
            <mml:mi>S</mml:mi>
            <mml:mi>I</mml:mi>
            <mml:mo>=</mml:mo>
            <mml:munder>
              <mml:mstyle mathsize="140%" displaystyle="true">
                <mml:mo>∑</mml:mo>
              </mml:mstyle>
              <mml:mi>j</mml:mi>
            </mml:munder>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:msub>
                  <mml:mrow>
                    <mml:mtext>Actual</mml:mtext>
                  </mml:mrow>
                  <mml:mi>j</mml:mi>
                </mml:msub>
                <mml:mo>−</mml:mo>
                <mml:msub>
                  <mml:mrow>
                    <mml:mtext>Expected</mml:mtext>
                  </mml:mrow>
                  <mml:mi>j</mml:mi>
                </mml:msub>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mtext>ln</mml:mtext>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:mfrac>
                  <mml:mrow>
                    <mml:msub>
                      <mml:mrow>
                        <mml:mtext>Actual</mml:mtext>
                      </mml:mrow>
                      <mml:mi>j</mml:mi>
                    </mml:msub>
                  </mml:mrow>
                  <mml:mrow>
                    <mml:msub>
                      <mml:mrow>
                        <mml:mtext>Expected</mml:mtext>
                      </mml:mrow>
                      <mml:mi>j</mml:mi>
                    </mml:msub>
                  </mml:mrow>
                </mml:mfrac>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>Interpretability assessment compares intrinsic transparency of logistic regression with post-hoc explanation methods such as SHAP values for ensemble models [<xref ref-type="bibr" rid="B22">22</xref>][<xref ref-type="bibr" rid="B60">60</xref>]-[<xref ref-type="bibr" rid="B62">62</xref>]. SHAP decomposes predictions into additive feature contributions based on Shapley values from cooperative game theory, enhancing the explainability of complex algorithms. Economic evaluation aligns predictive performance with business impact. Expected Loss (EL) is calculated as:</p>
      <disp-formula id="FD17">
        <mml:math>
          <mml:mrow>
            <mml:mtext>EL</mml:mtext>
            <mml:mo>=</mml:mo>
            <mml:mtext>PD</mml:mtext>
            <mml:mo>×</mml:mo>
            <mml:mtext>LGD</mml:mtext>
            <mml:mo>×</mml:mo>
            <mml:mtext>EAD</mml:mtext>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>Threshold selection is optimized by minimizing expected loss rather than maximizing statistical accuracy alone [<xref ref-type="bibr" rid="B25">25</xref>]. Robustness checks examine sensitivity to class imbalance treatments, including oversampling, undersampling, and cost-sensitive weighting [<xref ref-type="bibr" rid="B21">21</xref>]. Cross-validation ensures generalizability and reduces variance in performance estimates. This methodological framework integrates statistical modeling theory, machine learning optimization, and banking regulatory considerations to provide a comprehensive and practically relevant comparison between logistic regression and advanced algorithms. By combining rigorous mathematical foundations with real-world governance requirements, the study aims to deliver findings that are both academically robust and operationally actionable in modern banking environments. </p>
      <p>To ensure transparency in evidence selection, this study follows a structured literature identification approach. Relevant studies were sourced from major academic databases, including Scopus, Web of Science, and Google Scholar. The search focused on combinations of keywords such as “credit risk modelling”, “logistic regression”, “machine learning”, “credit scoring”, and “probability of default”. Priority was given to peer-reviewed journal articles, widely cited conference papers, and authoritative institutional reports published primarily over the past two decades.</p>
      <p>Studies were included if they provided empirical comparisons, methodological insights, or performance evaluations of logistic regression and machine learning techniques in banking or credit scoring contexts. Articles focusing on unrelated domains, lacking quantitative or methodological relevance, or not addressing credit risk modeling directly were excluded. Rather than conducting a formal systematic review with strict protocol registration, the approach adopted here is a structured comparative synthesis aimed at capturing consistent patterns and insights across the literature.</p>
    </sec>
    <sec id="sec4">
      <title>4. Results and Discussion</title>
      <p>The performance metrics reported in this section, including AUC, Gini coefficient, Brier score, Kolmogorov-Smirnov (KS) statistic, and expected loss (EL), are not derived from a single empirical dataset. Instead, they represent illustrative benchmark values synthesized from prior empirical studies, industry reports, and widely cited comparative analyses in the credit risk modeling literature. The purpose of presenting these values is to provide a consistent and interpretable basis for comparing logistic regression and machine learning approaches across key performance dimensions. As such, the results should be interpreted as representative ranges reflecting common findings in the literature rather than as outcomes of a newly estimated model on a specific dataset. This section presents a comparative synthesis of empirical findings reported in the literature, interpreted within the proposed analytical framework described previously. The results are analyzed across four principal dimensions: discrimination performance, calibration accuracy, temporal stability, and economic impact. The discussion interprets these findings in the context of banking regulatory requirements, operational feasibility, and model risk management considerations. The results presented in this section are not derived from a single empirical dataset. Instead, they represent illustrative benchmark values synthesized from prior empirical studies and industry-reported performance ranges. The purpose of these results is to provide a consistent comparative interpretation across modeling approaches rather than to report new experimental findings.</p>
      <p>The empirical comparison suggests that the ensemble-based machine learning models, especially the Gradient Boosting Machines (GBM), always have a better discrimination performance compared to the logistic regression. Across reported studies, boosting algorithms have better Area Under the Receiver Operating Characteristic Curve (AUC-ROC) and Gini coefficients that show better ranking ability of defaulting and non-defaulting borrowers. This finding is consistent with previous studies that show that boosting methods are effective at capturing nonlinear relationships, and other intricate interactions among features that cannot be effectively modeled by logistic regression, unless a large amount of feature engineering is employed [<xref ref-type="bibr" rid="B12">12</xref>][<xref ref-type="bibr" rid="B14">14</xref>][<xref ref-type="bibr" rid="B15">15</xref>]. Random Forest models also have good discriminatory performance, but not as much as boosting algorithms, which is probably because their orientation is to reduce variance, not necessarily to optimize classification loss. The quantitative performance comparison is summarized in <bold>Table 5</bold>.</p>
      <p><bold>Table 5</bold><bold>.</bold> Comparative performance metrics.</p>
      <table-wrap id="tbl5">
        <label>Table 5</label>
        <table>
          <tbody>
            <tr>
              <td>Model</td>
              <td>AUC</td>
              <td>Gini</td>
              <td>Brier Score</td>
              <td>KS Statistic</td>
            </tr>
            <tr>
              <td>Logistic Regression</td>
              <td>0.78</td>
              <td>0.56</td>
              <td>0.162</td>
              <td>0.42</td>
            </tr>
            <tr>
              <td>Random Forest</td>
              <td>0.82</td>
              <td>0.64</td>
              <td>0.168</td>
              <td>0.47</td>
            </tr>
            <tr>
              <td>Gradient Boosting</td>
              <td>0.85</td>
              <td>0.70</td>
              <td>0.171*</td>
              <td>0.51</td>
            </tr>
            <tr>
              <td>SVM</td>
              <td>0.80</td>
              <td>0.60</td>
              <td>0.175</td>
              <td>0.45</td>
            </tr>
            <tr>
              <td>Neural Network</td>
              <td>0.83</td>
              <td>0.66</td>
              <td>0.169</td>
              <td>0.48</td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
      <p>Note: *after calibration adjustment; Values are illustrative benchmark estimates synthesized from published empirical studies and do not originate from a single dataset.</p>
      <p>Although slightly less effective in terms of AUC performance, logistic regression is also competitive with strong feature engineering methods (Weight of Evidence transformation and monotonic binning) in use. The difference in performance between logistic regression and advanced machine learning models is consistently reported in the literature as modest in magnitude, particularly when strong baseline scorecards are used. While machine learning approaches often improve discrimination metrics such as AUC and Gini, the incremental gains are generally incremental rather than transformative in many practical portfolio settings. The absolute increase in AUC is, in most instances, not more than a few percentage points, which implies that although machine learning improves the ranking precision, the improvement may not be transformative in some portfolio conditions. This observation is in agreement with empirical literature that shows declines in marginal improvements in predictive performance with increasingly strong baseline scorecards [<xref ref-type="bibr" rid="B5">5</xref>][<xref ref-type="bibr" rid="B25">25</xref>]. The discrimination performance comparison is illustrated in <xref ref-type="fig" rid="fig6">Figure 6</xref>. The interpretation of results is therefore grounded in retail and SME portfolio settings, where model performance is evaluated not only in terms of discrimination and calibration, but also in relation to regulatory compliance, operational scalability, and economic impact under IRB and IFRS 9 frameworks.</p>
      <fig id="fig6">
        <label>Figure 6</label>
        <graphic xlink:href="https://html.scirp.org/file/1733495-rId96.jpeg?20260427031641" />
      </fig>
      <p><bold>Figure 6</bold><bold>.</bold>Comparative discrimination performance (AUC/Gini) across logistic regression and machine learning models.</p>
      <p>A more subtle viewpoint is given by calibration analysis. The structure of the probability estimation in logistic regression shows a high correlation between the estimated predicted probabilities and actual default frequencies in deciles, as the probability estimation structure is based on likelihood. The use of Brier scores and calibration curves suggests that logistic regression possesses consistent probability estimation based on minimal systematic bias. More so, machine learning models, especially those using an ensemble algorithm that trades off classification loss as opposed to probability accuracy, demand a post-hoc calibration like isotonic regression or Platt scaling to obtain similar alignment [<xref ref-type="bibr" rid="B19">19</xref>][<xref ref-type="bibr" rid="B20">20</xref>]. Unrecalibrated boosted models can also exhibit an overconfidence bias in risky segments, which is also in line with overfitting behavior in highly adaptive learners. Calibration behavior across models is presented in <xref ref-type="fig" rid="fig7">Figure 7</xref>.</p>
      <fig id="fig7">
        <label>Figure 7</label>
        <graphic xlink:href="https://html.scirp.org/file/1733495-rId97.jpeg?20260427031642" />
      </fig>
      <p><bold>Figure 7</bold><bold>.</bold> Calibration curves comparing predicted and observed default probabilities.</p>
      <p>Temporal validation provides significant differences in stability. On out-of-time samples, the degradation of performance of logistic regression models trained on historical data is relatively stable, but not all machine learning models are so resistant to distribution shifts. The Population Stability Index (PSI) analysis shows that the effect of the changes in feature distributions on the nonlinear ensemble methods is more significant in the situation when the macroeconomic conditions change. This finding confirms earlier conclusions that less complex parametric models can be better generalized across economic cycles [<xref ref-type="bibr" rid="B18">18</xref>]. Nevertheless, stability can be significantly better when ensemble models have regularization constraints and depth limits, which reduce the gap in robustness.</p>
      <p>Interpretability-wise, the logistic regression still has a very strong advantage since it has a transparent coefficient structure. The contribution of each predictor to the risk of default is also clearly measured, which can be easily communicated to risk committees and regulators. The odds ratios are intuitive in explaining drivers of risk, and this assists in adverse action logic and conformance to fair lending policies [<xref ref-type="bibr" rid="B6">6</xref>][<xref ref-type="bibr" rid="B17">17</xref>]. The machine learning models, on the contrary, are based on feature importance scores and post-hoc explanation methods like SHAP values [<xref ref-type="bibr" rid="B22">22</xref>]. As much as SHAP analysis gives useful local and global explanations, the method also comes with extra methodological layers, which can make the processes of governance and documentation complicated. The use of post hoc explanations also has theoretical issues of consistency and reproducibility when updating the models.</p>
      <p>Economic analysis converts forecasting variations to the financial consequences at the portfolio level. Calculations of Expected Loss (EL) using model-generated PDs show that the improvement in risk segmentation is marginal, with the improvement of boosted models that allow a little more effective credit limits allocation and price differentiation. But the economic jubilation of enhanced AUC should be measured in terms of the implementation cost and governance load. The incremental reduction in expected losses that machine learning can achieve when applied within a portfolio of moderate default rates and well-designed logistic scorecards is unlikely to be worth the much greater increase in the computational complexity and validation demands. However, in a high-dimensional data set that includes behavioral and transactional variables, ensemble models can provide a substantial financial increase because of their ability to identify nonlinear impacts. The portfolio-level economic implications of model selection are presented in <bold>Table 6</bold>.</p>
      <p><bold>Table 6</bold><bold>.</bold>Economic evaluation based on expected loss reduction.</p>
      <table-wrap id="tbl6">
        <label>Table 6</label>
        <table>
          <tbody>
            <tr>
              <td>Model</td>
              <td>Average PD</td>
              <td>Portfolio EL (in % of Exposure)</td>
              <td>EL Reduction vs LR</td>
              <td>Threshold Sensitivity</td>
            </tr>
            <tr>
              <td>Logistic Regression</td>
              <td>3.2%</td>
              <td>2.45%</td>
              <td>-</td>
              <td>Low</td>
            </tr>
            <tr>
              <td>Random Forest</td>
              <td>3.0%</td>
              <td>2.31%</td>
              <td>5.7%</td>
              <td>Moderate</td>
            </tr>
            <tr>
              <td>Gradient Boosting</td>
              <td>2.9%</td>
              <td>2.22%</td>
              <td>9.4%</td>
              <td>Moderate-High</td>
            </tr>
            <tr>
              <td>Neural Network</td>
              <td>3.0%</td>
              <td>2.28%</td>
              <td>6.9%</td>
              <td>High</td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
      <p>Comparative performance is also dependent on the sensitivity of models to the imbalance of classes. Ensemble approaches, especially boosting algorithms with class-weight modifications, are resilient to the presence of imbalance. Logistic regression is also not fragile when the class weighting is done correctly, but its linear nature can prevent it from picking up some minority-class interaction. However, the observed relative increase in ensemble practices in imbalance conditions does not significantly change calibration dynamics, which supports the use of post-estimation probability correction.</p>
      <p>The issue of model complexity stands out as one of the key topics in the discussion. Logistic regression is inexpensive to compute, it is also easy to deploy, and it needs a little infrastructure. Machine learning algorithms, particularly boosting and neural networks, require more computational resources, hyperparameter optimization, and continuous monitoring. This complexity, in the controlled banking settings, is reflected in more validation documentation, model risk tests, and audit inspection [<xref ref-type="bibr" rid="B16">16</xref>]. Consequently, the model should not be selected based on predictive performance only; it should include governance scalability. The temporal stability of models is evaluated through out-of-time validation as shown in <xref ref-type="fig" rid="fig8">Figure 8</xref>.</p>
      <fig id="fig8">
        <label>Figure 8</label>
        <graphic xlink:href="https://html.scirp.org/file/1733495-rId98.jpeg?20260427031642" />
      </fig>
      <p><bold>Figure 8</bold><bold>.</bold>Out-of-time validation showing performance stability across periods.</p>
      <p>The combined evaluation indicates that one of the modeling methods is not predominant in all criteria. The logistic regression is much easier to interpret, has a high level of calibration, and aligns with regulations; thus, it is more appropriate to use when transparency and consistency are important in a given portfolio. Gradient boosting machine learning models have superior discrimination and a nonlinear model modeling ability, which is advantageous in settings with a high amount of data and more intricate patterns of borrower behavior.</p>
      <p>A hybrid modeling approach can thus be an expedient concession. A benchmark or challenger model that would be useful in ensuring interpretability and stability of calibration could be logistic regression, whereas machine learning models can be used side by side to capture incremental predictive improvements. Ensemble outputs can also be used in logistic regression models by feature stacking or score blending, which combines nonlinear learning abilities with parametric transparency. These hybrid strategies are in line with the new regulatory views of responsible adoption of artificial intelligence in the financial services.</p>
      <p>Finally, the results of the empirical study highlight the multi-dimensional trade-offs of credit risk modeling. Although machine learning algorithms usually have superior discrimination measures, logistic regression retains its advantages of calibration stability, interpretability, and governance compatibility. The best decision would be made in relation to the portfolio attributes, data richness, institutional risk appetite, and regulatory limits. Instead of positioning the comparison in the context of the traditional versus modern technique, the results prove that both methods can be strategically used to boost predictive results without sacrificing transparency and control in banking risk management systems.</p>
    </sec>
    <sec id="sec5">
      <title>5. Conclusions</title>
      <p>This paper has provided a structured comparative synthesis of credit risk modeling approaches, with primary application to retail and SME lending portfolios under IRB and IFRS 9 regulatory frameworks. The empirical studies support the assertion that the ensemble-based machine learning models, especially the gradient boosting algorithms, tend to be more effective in discriminating against target variables in terms of the AUC and Gini coefficient of discrimination. These types of models illustrate good ability to find nonlinear relationships and complicated interactions between predictors, particularly when the data is high-dimensional. Machine learning techniques can result in quantifiable differences in ranking performance in data-rich settings in which the behavior of borrowers is complex and nonlinear relationships are evident. These gains can be converted into more sophisticated risk segmentation and small cuts in portfolio expected loss.</p>
      <p>But the increased discrimination does not necessarily mean a high level of superiority in all the assessment factors. The logistic regression also has good calibration characteristics, and the probability estimates generated by it are close to the actual default rates without any additional correction process. Stability of calibration is especially significant in banking, where estimates of probability of default are directly used in the determination of regulatory capital and the amount of expected credit loss provisioning. Another issue that can complicate the methodology is that machine learning models, as a powerful classifier, might sometimes need post-hoc calibration adjustments to guarantee probability consistency.</p>
      <p>Important trade-offs are pointed out as well under Temporal stability analysis. The performance on economic cycles is relatively robust with logistic regression models that are trained using conservative feature engineering and regularization. Conversely, extremely flexible machine learning models can be more sensitive to distributional changes unless cautiously restricted. Stability is as important in dynamic macroeconomic settings, where in-sample predictive performance is just as important, but there are characteristics of borrowers and default behavior that change over time.</p>
      <p>Interpretability is also a characteristic of the two paradigms of modeling. Logistic regression has inherent transparency in terms of coefficient beliefs and odds ratios that are easy to validate for regulators, governance records, and communicate with stakeholders. Another aspect is that machine learning models, though they can be made more interpretable with post-hoc explanation systems like SHAP, are based on other layers of analysis to provide a similar level of transparency. Although explainable artificial intelligence methods minimize the black box nature of sophisticated algorithms, they raise questions of methodology in terms of reproducibility, consistency, and regulatory acceptability.</p>
      <p>Economically, incremental gains associated with machine learning models should be balanced against the cost of implementation, infrastructure needs, and the burden of governance. In portfolios where logistic regression already displays a robust discriminatory performance, the marginal financial improvement of machine learning might not be worth considering, given the significant increase in the complexity of the operation. On the other hand, ensemble techniques can create significant value in settings that have large volumes of behavioral data and highly complex nonlinear dynamics.</p>
      <p>The general finding of this research is that none of the modeling techniques apply to all the applicable standards relating to banking credit risk management. Logistic regression is an interpretable, stable, powerful, and calibrationally stable regression approach. Machine learning methods provide extended predictive adaptability and better discrimination in intricate information conditions. The most effective approach will then be based on institutional goals, data, risk tolerance, and supervisory environment.</p>
      <p>A practical roadmap for financial institutions can be the hybrid or supplementary model strategies. Logistic regression could be used as an anchor or benchmark model in order to assure interpretability and stability, and machine learning algorithms could be used as challengers or stacked as an ensemble using ensemble stacking. This type of integration would allow the banks to use nonlinear predictive power without undermining the governance standards.</p>
      <p>Since the regulatory frameworks increasingly recognize the value of advanced analytics and artificial intelligence in the field of financial services, future research needs to concentrate on effective validation practices, equity evaluation, stress testing machine learning models, and standardized explainability measures. Further cooperation between the quantitative researchers and risk practitioners, as well as regulators, will be necessary so that the innovation behind the credit risk modeling can also improve the predictive performance as well as the stability of the financial system.</p>
      <p>Despite providing a structured comparative synthesis, this study is subject to several limitations that should be considered when interpreting the results. First, model performance is inherently dependent on portfolio characteristics, and findings derived primarily from retail and SME credit contexts may not generalize directly to corporate or specialized lending portfolios. Second, preprocessing choices, including feature engineering techniques such as binning, Weight of Evidence (WoE) transformation, scaling, and missing value treatment, can significantly influence model outcomes, particularly for logistic regression models. Third, the handling of class imbalance, which is a common feature of credit risk datasets, may affect both discrimination and calibration performance depending on the choice of resampling or cost-sensitive techniques. Finally, model performance is not static over time; both logistic regression and machine learning models require periodic recalibration and monitoring to remain reliable under changing macroeconomic conditions and borrower behavior. These factors highlight that the relative advantages of different modeling approaches are context-dependent and should be evaluated within specific operational and regulatory environments.</p>
      <p>Conclusively, the comparison shows that the decision between logistic regression and machine learning is not a two-dimensional decision; it is a multi-dimensional optimization problem. The use of predictive accuracy compared with interpretability, stability, and governance is needed in effective credit risk modeling in modern banking. Those institutions that tactfully combine the two paradigms are bound to realize better results in risk management and sustainable lending practices. The conclusions are most directly applicable to high-volume retail and SME credit environments, where trade-offs between predictive performance, interpretability, and regulatory compliance are most pronounced.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <title>References</title>
      <ref id="B1">
        <label>1.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Basel Committee on Banking Supervision (2006) International Convergence of Capital Measurement and Capital Standards: A Revised Framework (Basel II). Bank for International Settlements.</mixed-citation>
          <element-citation publication-type="other">
            <year>2006</year>
            <article-title>International Convergence of Capital Measurement and Capital Standards: A Revised Framework (Basel II)</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B2">
        <label>2.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Basel Committee on Banking Supervision (2011) Basel III: A Global Regulatory Framework for More Resilient Banks and Banking Systems. Bank for International Settlements.</mixed-citation>
          <element-citation publication-type="other">
            <year>2011</year>
            <article-title>Basel III: A Global Regulatory Framework for More Resilient Banks and Banking Systems</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B3">
        <label>3.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">International Accounting Standards Board (IASB) (2014) IFRS 9: Financial Instruments. IFRS Foundation.</mixed-citation>
          <element-citation publication-type="other">
            <year>2014</year>
            <article-title>IFRS 9: Financial Instruments</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B4">
        <label>4.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Durand, D. (1941) Risk Elements in Consumer Installment Financing. National Bureau of Economic Research.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Durand, D.</string-name>
            </person-group>
            <year>1941</year>
            <article-title>Risk Elements in Consumer Installment Financing</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B5">
        <label>5.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Altman, E.I. and Saunders, A. (1998) Credit Risk Measurement: Developments over the Last 20 Years. <italic>Journal of Banking &amp; Finance</italic>, 21, 1721-1742. https://doi.org/10.1016/s0378-4266(97)00036-8 <pub-id pub-id-type="doi">10.1016/s0378-4266(97)00036-8</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/s0378-4266(97)00036-8">https://doi.org/10.1016/s0378-4266(97)00036-8</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Altman, E.I.</string-name>
              <string-name>Saunders, A.</string-name>
            </person-group>
            <year>1998</year>
            <article-title>Credit Risk Measurement: Developments over the Last 20 Years</article-title>
            <source>Journal of Banking &amp; Finance</source>
            <volume>4266</volume>
            <issue>97</issue>
            <pub-id pub-id-type="doi">10.1016/s0378-4266(97)00036-8</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B6">
        <label>6.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Hand, D.J. and Henley, W.E. (1997) Statistical Classification Methods in Consumer Credit Scoring: A Review. <italic>Journal of the Royal Statistical Society Series A</italic>: <italic>Statistics in Society</italic>, 160, 523-541. https://doi.org/10.1111/j.1467-985x.1997.00078.x <pub-id pub-id-type="doi">10.1111/j.1467-985x.1997.00078.x</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1111/j.1467-985x.1997.00078.x">https://doi.org/10.1111/j.1467-985x.1997.00078.x</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Hand, D.J.</string-name>
              <string-name>Henley, W.E.</string-name>
            </person-group>
            <year>1997</year>
            <article-title>Statistical Classification Methods in Consumer Credit Scoring: A Review</article-title>
            <source>Journal of the Royal Statistical Society Series A: Statistics in Society</source>
            <volume>160</volume>
            <pub-id pub-id-type="doi">10.1111/j.1467-985x.1997.00078.x</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B7">
        <label>7.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Thomas, L.C. (2009) Consumer Credit Models: Pricing, Profit and Portfolios. Oxford University Press.</mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Thomas, L.C.</string-name>
              <string-name>Pricing, P</string-name>
            </person-group>
            <year>2009</year>
            <article-title>Consumer Credit Models: Pricing, Profit and Portfolios</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B8">
        <label>8.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Tibshirani, R. (1996) Regression Shrinkage and Selection via the Lasso. <italic>Journal of the Royal Statistical Society Series B</italic>: <italic>Statistical Methodology</italic>, 58, 267-288. https://doi.org/10.1111/j.2517-6161.1996.tb02080.x <pub-id pub-id-type="doi">10.1111/j.2517-6161.1996.tb02080.x</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1111/j.2517-6161.1996.tb02080.x">https://doi.org/10.1111/j.2517-6161.1996.tb02080.x</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Tibshirani, R.</string-name>
            </person-group>
            <year>1996</year>
            <article-title>Regression Shrinkage and Selection via the Lasso</article-title>
            <source>Journal of the Royal Statistical Society Series B: Statistical Methodology</source>
            <volume>58</volume>
            <pub-id pub-id-type="doi">10.1111/j.2517-6161.1996.tb02080.x</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B9">
        <label>9.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Hastie, T., Tibshirani, R. and Friedman, J. (2009) The Elements of Statistical Learning. 2nd Edition, Springer.</mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Hastie, T.</string-name>
              <string-name>Tibshirani, R.</string-name>
              <string-name>Friedman, J.</string-name>
              <string-name>Edition, S</string-name>
            </person-group>
            <year>2009</year>
            <article-title>The Elements of Statistical Learning</article-title>
            <source>2nd Edition</source>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B10">
        <label>10.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Heaton, J.B., Polson, N.G. and Witte, J.H. (2019) Deep Learning in Finance. https://arxiv.org/abs/1602.06561</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Heaton, J.B.</string-name>
              <string-name>Polson, N.G.</string-name>
              <string-name>Witte, J.H.</string-name>
            </person-group>
            <year>2019</year>
            <article-title>Deep Learning in Finance</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B11">
        <label>11.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Vapnik, V. (1998) Statistical Learning Theory. Wiley.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Vapnik, V.</string-name>
            </person-group>
            <year>1998</year>
            <article-title>Statistical Learning Theory</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B12">
        <label>12.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Chen, T. and Guestrin, C. (2016) XGBoost. <italic>Proceedings of the</italic>22 <italic>nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</italic>, San Francisco, 13-17 August 2016, 785-794. https://doi.org/10.1145/2939672.2939785 <pub-id pub-id-type="doi">10.1145/2939672.2939785</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/2939672.2939785">https://doi.org/10.1145/2939672.2939785</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Chen, T.</string-name>
              <string-name>Guestrin, C.</string-name>
              <string-name>Mining, S</string-name>
            </person-group>
            <year>2016</year>
            <article-title>XGBoost</article-title>
            <source>Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</source>
            <volume>13</volume>
            <pub-id pub-id-type="doi">10.1145/2939672.2939785</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B13">
        <label>13.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Lessmann, S., Baesens, B., Seow, H. and Thomas, L.C. (2015) Benchmarking State-of-the-Art Classification Algorithms for Credit Scoring: An Update of Research. <italic>European Journal of Operational Research</italic>, 247, 124-136. https://doi.org/10.1016/j.ejor.2015.05.030 <pub-id pub-id-type="doi">10.1016/j.ejor.2015.05.030</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ejor.2015.05.030">https://doi.org/10.1016/j.ejor.2015.05.030</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Lessmann, S.</string-name>
              <string-name>Baesens, B.</string-name>
              <string-name>Seow, H.</string-name>
              <string-name>Thomas, L.C.</string-name>
            </person-group>
            <year>2015</year>
            <article-title>Benchmarking State-of-the-Art Classification Algorithms for Credit Scoring: An Update of Research</article-title>
            <source>European Journal of Operational Research</source>
            <volume>247</volume>
            <pub-id pub-id-type="doi">10.1016/j.ejor.2015.05.030</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B14">
        <label>14.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Friedman, J.H. (2001) Greedy Function Approximation: A Gradient Boosting Machine. <italic>The Annals of Statistics</italic>, 29, 1189-1232. https://doi.org/10.1214/aos/1013203451 <pub-id pub-id-type="doi">10.1214/aos/1013203451</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1214/aos/1013203451">https://doi.org/10.1214/aos/1013203451</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Friedman, J.H.</string-name>
            </person-group>
            <year>2001</year>
            <article-title>Greedy Function Approximation: A Gradient Boosting Machine</article-title>
            <source>The Annals of Statistics</source>
            <volume>29</volume>
            <pub-id pub-id-type="doi">10.1214/aos/1013203451</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B15">
        <label>15.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Baesens, B., Van Gestel, T., Viaene, S., Stepanova, M., Suykens, J. and Vanthienen, J. (2003) Benchmarking State-of-the-Art Classification Algorithms for Credit Scoring. <italic>Journal of the Operational Research Society</italic>, 54, 627-635. https://doi.org/10.1057/palgrave.jors.2601545 <pub-id pub-id-type="doi">10.1057/palgrave.jors.2601545</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1057/palgrave.jors.2601545">https://doi.org/10.1057/palgrave.jors.2601545</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Baesens, B.</string-name>
              <string-name>Gestel, T.</string-name>
              <string-name>Viaene, S.</string-name>
              <string-name>Stepanova, M.</string-name>
              <string-name>Suykens, J.</string-name>
              <string-name>Vanthienen, J.</string-name>
            </person-group>
            <year>2003</year>
            <article-title>Benchmarking State-of-the-Art Classification Algorithms for Credit Scoring</article-title>
            <source>Journal of the Operational Research Society</source>
            <volume>54</volume>
            <pub-id pub-id-type="doi">10.1057/palgrave.jors.2601545</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B16">
        <label>16.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Board of Governors of the Federal Reserve System (2011) Supervisory Guidance on Model Risk Management (SR 11-7).</mixed-citation>
          <element-citation publication-type="other">
            <year>2011</year>
            <article-title>Supervisory Guidance on Model Risk Management (SR 11-7)</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B17">
        <label>17.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Corporate Finance Institute (2020) Equal Credit Opportunity Act (ECOA). https://corporatefinanceinstitute.com/resources/commercial-lending/equal-credit-opportunity-act-ecoa/?utm_source=chatgpt.com</mixed-citation>
          <element-citation publication-type="web">
            <year>2020</year>
            <article-title>Equal Credit Opportunity Act (ECOA)</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B18">
        <label>18.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Ribeiro, M.T., Singh, S. and Guestrin, C. (2016) Why Should I Trust You? <italic>Proceedings of the</italic>22 <italic>nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</italic>, San Francisco, 13-17 August 2016, 1135-1144. https://doi.org/10.1145/2939672.2939778 <pub-id pub-id-type="doi">10.1145/2939672.2939778</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/2939672.2939778">https://doi.org/10.1145/2939672.2939778</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Ribeiro, M.T.</string-name>
              <string-name>Singh, S.</string-name>
              <string-name>Guestrin, C.</string-name>
              <string-name>Mining, S</string-name>
            </person-group>
            <year>2016</year>
            <article-title>Why Should I Trust You? Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, 13-17 August 2016, 1135-1144</article-title>
            <pub-id pub-id-type="doi">10.1145/2939672.2939778</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B19">
        <label>19.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Niculescu-Mizil, A. and Caruana, R. (2005) Predicting Good Probabilities with Supervised Learning. <italic>Proceedings of the</italic>22 <italic>nd international conference on Machine Learning</italic>, Bonn, 7-11 August 2005, 625-632. https://doi.org/10.1145/1102351.1102430 <pub-id pub-id-type="doi">10.1145/1102351.1102430</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/1102351.1102430">https://doi.org/10.1145/1102351.1102430</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Niculescu-Mizil, A.</string-name>
              <string-name>Caruana, R.</string-name>
              <string-name>Learning, B</string-name>
            </person-group>
            <year>2005</year>
            <article-title>Predicting Good Probabilities with Supervised Learning</article-title>
            <source>Proceedings of the 22nd international conference on Machine Learning</source>
            <volume>7</volume>
            <pub-id pub-id-type="doi">10.1145/1102351.1102430</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B20">
        <label>20.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Platt, J.C. (2000) Probabilities for SV Machines. In: Smola, A.J., Bartlett, P., Schölkopf, B. and Schuurmans, D., Eds., <italic>Advances in Large</italic>- <italic>Margin Classifiers</italic>, The MIT Press, 61-74. https://doi.org/10.7551/mitpress/1113.003.0008 <pub-id pub-id-type="doi">10.7551/mitpress/1113.003.0008</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.7551/mitpress/1113.003.0008">https://doi.org/10.7551/mitpress/1113.003.0008</ext-link></mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Platt, J.C.</string-name>
              <string-name>Smola, A.J.</string-name>
              <string-name>Bartlett, P.</string-name>
              <string-name>Schuurmans, D.</string-name>
              <string-name>Classifiers, T</string-name>
            </person-group>
            <year>2000</year>
            <article-title>Probabilities for SV Machines</article-title>
            <source>In: Smola</source>
            <volume>61</volume>
            <pub-id pub-id-type="doi">10.7551/mitpress/1113.003.0008</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B21">
        <label>21.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Chawla, N.V., Bowyer, K.W., Hall, L.O. and Kegelmeyer, W.P. (2002) SMOTE: Synthetic Minority Over-Sampling Technique. <italic>Journal of Artificial Intelligence Research</italic>, 16, 321-357. https://doi.org/10.1613/jair.953 <pub-id pub-id-type="doi">10.1613/jair.953</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1613/jair.953">https://doi.org/10.1613/jair.953</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Chawla, N.V.</string-name>
              <string-name>Bowyer, K.W.</string-name>
              <string-name>Hall, L.O.</string-name>
              <string-name>Kegelmeyer, W.P.</string-name>
            </person-group>
            <year>2002</year>
            <article-title>SMOTE: Synthetic Minority Over-Sampling Technique</article-title>
            <source>Journal of Artificial Intelligence Research</source>
            <volume>16</volume>
            <pub-id pub-id-type="doi">10.1613/jair.953</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B22">
        <label>22.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Lundberg, S.M. and Lee, S.-I. (2017) A Unified Approach to Interpreting Model Predictions. <italic>Annual Conference on Neural Information Processing Systems</italic> 2017, Long Beach, 4-9 December 2017, 4765-4774.</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Lundberg, S.M.</string-name>
              <string-name>Lee, S.</string-name>
            </person-group>
            <year>2017</year>
            <article-title>A Unified Approach to Interpreting Model Predictions</article-title>
            <source>Annual Conference on Neural Information Processing Systems 2017</source>
            <volume>4</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B23">
        <label>23.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Molnar, C. (2022) Interpretable Machine Learning. 2nd Edition, Shroff/Molnar.</mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Molnar, C.</string-name>
              <string-name>Edition, S</string-name>
            </person-group>
            <year>2022</year>
            <article-title>Interpretable Machine Learning</article-title>
            <source>2nd Edition</source>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B24">
        <label>24.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">West, D. (2000) Neural Network Credit Scoring Models. <italic>Computers &amp; Operations Research</italic>, 27, 1131-1152. https://doi.org/10.1016/s0305-0548(99)00149-5 <pub-id pub-id-type="doi">10.1016/s0305-0548(99)00149-5</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/s0305-0548(99)00149-5">https://doi.org/10.1016/s0305-0548(99)00149-5</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>West, D.</string-name>
            </person-group>
            <year>2000</year>
            <article-title>Neural Network Credit Scoring Models</article-title>
            <source>Computers &amp; Operations Research</source>
            <volume>0548</volume>
            <issue>99</issue>
            <pub-id pub-id-type="doi">10.1016/s0305-0548(99)00149-5</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B25">
        <label>25.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Hand, D.J. (2009) Measuring Classifier Performance: A Coherent Alternative to the Area under the ROC Curve. <italic>Machine Learning</italic>, 77, 103-123. https://doi.org/10.1007/s10994-009-5119-5 <pub-id pub-id-type="doi">10.1007/s10994-009-5119-5</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s10994-009-5119-5">https://doi.org/10.1007/s10994-009-5119-5</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Hand, D.J.</string-name>
            </person-group>
            <year>2009</year>
            <article-title>Measuring Classifier Performance: A Coherent Alternative to the Area under the ROC Curve</article-title>
            <source>Machine Learning</source>
            <volume>77</volume>
            <pub-id pub-id-type="doi">10.1007/s10994-009-5119-5</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B26">
        <label>26.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Chang, C. and Lin, C. (2011) LIBSVM: A Library for Support Vector Machines. <italic>ACM Transactions on Intelligent Systems and Technology</italic>, 2, 1-27. https://doi.org/10.1145/1961189.1961199 <pub-id pub-id-type="doi">10.1145/1961189.1961199</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/1961189.1961199">https://doi.org/10.1145/1961189.1961199</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Chang, C.</string-name>
              <string-name>Lin, C.</string-name>
            </person-group>
            <year>2011</year>
            <article-title>LIBSVM: A Library for Support Vector Machines</article-title>
            <source>ACM Transactions on Intelligent Systems and Technology</source>
            <volume>2</volume>
            <pub-id pub-id-type="doi">10.1145/1961189.1961199</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B27">
        <label>27.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Van Gestel, T. and Baesens, B. (2009) Credit Risk Management: Basic Concepts. Oxford University Press. https://doi.org/10.1093/acprof:oso/9780199545117.001.0001 <pub-id pub-id-type="doi">10.1093/acprof:oso/9780199545117.001.0001</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1093/acprof:oso/9780199545117.001.0001">https://doi.org/10.1093/acprof:oso/9780199545117.001.0001</ext-link></mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Gestel, T.</string-name>
              <string-name>Baesens, B.</string-name>
            </person-group>
            <year>2009</year>
            <article-title>Credit Risk Management: Basic Concepts</article-title>
            <pub-id pub-id-type="doi">10.1093/acprof:oso/9780199545117.001.0001</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B28">
        <label>28.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Heaton, J.B., Polson, N.G. and Witte, J.H. (2017) Deep Learning for Finance: Deep Portfolios. <italic>Applied Stochastic Models in Business and Industry</italic>, 33, 3-12. https://doi.org/10.1002/asmb.2209 <pub-id pub-id-type="doi">10.1002/asmb.2209</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1002/asmb.2209">https://doi.org/10.1002/asmb.2209</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Heaton, J.B.</string-name>
              <string-name>Polson, N.G.</string-name>
              <string-name>Witte, J.H.</string-name>
            </person-group>
            <year>2017</year>
            <article-title>Deep Learning for Finance: Deep Portfolios</article-title>
            <source>Applied Stochastic Models in Business and Industry</source>
            <volume>33</volume>
            <pub-id pub-id-type="doi">10.1002/asmb.2209</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B29">
        <label>29.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Baesens, B. (2014) Developing Credit Risk Models Using SAS Enterprise Miner. SAS Institute White Paper.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Baesens, B.</string-name>
            </person-group>
            <year>2014</year>
            <article-title>Developing Credit Risk Models Using SAS Enterprise Miner</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B30">
        <label>30.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Thomas, L., Crook, J. and Edelman, D. (2017) Credit Scoring and Its Applications. 2nd Edition, Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974560 <pub-id pub-id-type="doi">10.1137/1.9781611974560</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1137/1.9781611974560">https://doi.org/10.1137/1.9781611974560</ext-link></mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Thomas, L.</string-name>
              <string-name>Crook, J.</string-name>
              <string-name>Edelman, D.</string-name>
              <string-name>Edition, S</string-name>
            </person-group>
            <year>2017</year>
            <article-title>Credit Scoring and Its Applications</article-title>
            <source>2nd Edition</source>
            <pub-id pub-id-type="doi">10.1137/1.9781611974560</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B31">
        <label>31.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Anderson, R. (2007) The Credit Scoring Toolkit. Oxford University Press.</mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Anderson, R.</string-name>
            </person-group>
            <year>2007</year>
            <article-title>The Credit Scoring Toolkit</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B32">
        <label>32.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Altman, E.I. (1968) Financial Ratios, Discriminant Analysis and the Prediction of Corporate Bankruptcy. <italic>The Journal of Finance</italic>, 23, 589-609. https://doi.org/10.1111/j.1540-6261.1968.tb00843.x <pub-id pub-id-type="doi">10.1111/j.1540-6261.1968.tb00843.x</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1111/j.1540-6261.1968.tb00843.x">https://doi.org/10.1111/j.1540-6261.1968.tb00843.x</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Altman, E.I.</string-name>
              <string-name>Ratios, D</string-name>
            </person-group>
            <year>1968</year>
            <article-title>Financial Ratios, Discriminant Analysis and the Prediction of Corporate Bankruptcy</article-title>
            <source>The Journal of Finance</source>
            <volume>23</volume>
            <pub-id pub-id-type="doi">10.1111/j.1540-6261.1968.tb00843.x</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B33">
        <label>33.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Khandani, A.E., Kim, A.J. and Lo, A.W. (2010) Consumer Credit-Risk Models via Machine-Learning Algorithms. <italic>Journal of Banking &amp; Finance</italic>, 34, 2767-2787. https://doi.org/10.1016/j.jbankfin.2010.06.001 <pub-id pub-id-type="doi">10.1016/j.jbankfin.2010.06.001</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.jbankfin.2010.06.001">https://doi.org/10.1016/j.jbankfin.2010.06.001</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Khandani, A.E.</string-name>
              <string-name>Kim, A.J.</string-name>
              <string-name>Lo, A.W.</string-name>
            </person-group>
            <year>2010</year>
            <article-title>Consumer Credit-Risk Models via Machine-Learning Algorithms</article-title>
            <source>Journal of Banking &amp; Finance</source>
            <volume>34</volume>
            <pub-id pub-id-type="doi">10.1016/j.jbankfin.2010.06.001</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B34">
        <label>34.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Crook, J.N., Edelman, D.B. and Thomas, L.C. (2007) Recent Developments in Consumer Credit Risk Assessment. <italic>European Journal of Operational Research</italic>, 183, 1447-1465. https://doi.org/10.1016/j.ejor.2006.09.100 <pub-id pub-id-type="doi">10.1016/j.ejor.2006.09.100</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ejor.2006.09.100">https://doi.org/10.1016/j.ejor.2006.09.100</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Crook, J.N.</string-name>
              <string-name>Edelman, D.B.</string-name>
              <string-name>Thomas, L.C.</string-name>
            </person-group>
            <year>2007</year>
            <article-title>Recent Developments in Consumer Credit Risk Assessment</article-title>
            <source>European Journal of Operational Research</source>
            <volume>183</volume>
            <pub-id pub-id-type="doi">10.1016/j.ejor.2006.09.100</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B35">
        <label>35.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Flach, P. (2012) Machine Learning: The Art and Science of Algorithms that Make Sense of Data. Cambridge University Press. https://doi.org/10.1017/cbo9780511973000 <pub-id pub-id-type="doi">10.1017/cbo9780511973000</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1017/cbo9780511973000">https://doi.org/10.1017/cbo9780511973000</ext-link></mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Flach, P.</string-name>
            </person-group>
            <year>2012</year>
            <article-title>Machine Learning: The Art and Science of Algorithms that Make Sense of Data</article-title>
            <pub-id pub-id-type="doi">10.1017/cbo9780511973000</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B36">
        <label>36.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Murphy, K.P. (2012) Machine Learning: A Probabilistic Perspective. MIT Press.</mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Murphy, K.P.</string-name>
            </person-group>
            <year>2012</year>
            <article-title>Machine Learning: A Probabilistic Perspective</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B37">
        <label>37.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Goodfellow, I., Bengio, Y. and Courville, A. (2016) Deep Learning. MIT Press.</mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Goodfellow, I.</string-name>
              <string-name>Bengio, Y.</string-name>
              <string-name>Courville, A.</string-name>
            </person-group>
            <year>2016</year>
            <article-title>Deep Learning</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B38">
        <label>38.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Hastie, T. and Tibshirani, R. (1986) Generalized Additive Models. <italic>Statistical Science</italic>, 1, 297-310. https://doi.org/10.1214/ss/1177013604 <pub-id pub-id-type="doi">10.1214/ss/1177013604</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1214/ss/1177013604">https://doi.org/10.1214/ss/1177013604</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Hastie, T.</string-name>
              <string-name>Tibshirani, R.</string-name>
            </person-group>
            <year>1986</year>
            <article-title>Generalized Additive Models</article-title>
            <source>Statistical Science</source>
            <volume>1</volume>
            <pub-id pub-id-type="doi">10.1214/ss/1177013604</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B39">
        <label>39.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Cortes, C. and Vapnik, V. (1995) Support-Vector Networks. <italic>Machine Learning</italic>, 20, 273-297. https://doi.org/10.1023/a:1022627411411 <pub-id pub-id-type="doi">10.1023/a:1022627411411</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1023/a:1022627411411">https://doi.org/10.1023/a:1022627411411</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Cortes, C.</string-name>
              <string-name>Vapnik, V.</string-name>
            </person-group>
            <year>1995</year>
            <article-title>Support-Vector Networks</article-title>
            <source>Machine Learning</source>
            <volume>20</volume>
            <fpage>102262</fpage>
            <pub-id pub-id-type="doi">10.1023/a:1022627411411</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B40">
        <label>40.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Breiman, L. (2001) Random Forests. <italic>Machine Learning</italic>, 45, 5-32. https://doi.org/10.1023/a:1010933404324 <pub-id pub-id-type="doi">10.1023/a:1010933404324</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1023/a:1010933404324">https://doi.org/10.1023/a:1010933404324</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Breiman, L.</string-name>
            </person-group>
            <year>2001</year>
            <article-title>Random Forests</article-title>
            <source>Machine Learning</source>
            <volume>45</volume>
            <fpage>101093</fpage>
            <pub-id pub-id-type="doi">10.1023/a:1010933404324</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B41">
        <label>41.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Breiman, L. (1996) Bagging Predictors. <italic>Machine Learning</italic>, 24, 123-140. https://doi.org/10.1023/a:1018054314350 <pub-id pub-id-type="doi">10.1023/a:1018054314350</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1023/a:1018054314350">https://doi.org/10.1023/a:1018054314350</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Breiman, L.</string-name>
            </person-group>
            <year>1996</year>
            <article-title>Bagging Predictors</article-title>
            <source>Machine Learning</source>
            <volume>24</volume>
            <fpage>101805</fpage>
            <pub-id pub-id-type="doi">10.1023/a:1018054314350</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B42">
        <label>42.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Chen, T. and Guestrin, C. (2016) XGBoost: Extreme Gradient Boosting. https://arxiv.org/abs/1603.02754</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Chen, T.</string-name>
              <string-name>Guestrin, C.</string-name>
            </person-group>
            <year>2016</year>
            <article-title>XGBoost: Extreme Gradient Boosting</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B43">
        <label>43.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Ke, G., Meng, Q., Finley, T., Wang, T.F., Chen, W., Ma, W.D. <italic>et al</italic>. (2017) LightGBM: A Highly Efficient Gradient Boosting Decision Tree. <italic>Proceedings of the</italic>31 <italic>st International Conference on Neural Information Processing Systems</italic>, Long Beach, 4-9 December 2017, 3149-3157.</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Ke, G.</string-name>
              <string-name>Meng, Q.</string-name>
              <string-name>Finley, T.</string-name>
              <string-name>Wang, T.F.</string-name>
              <string-name>Chen, W.</string-name>
              <string-name>Ma, W.D.</string-name>
              <string-name>Systems, L</string-name>
            </person-group>
            <year>2017</year>
            <article-title>LightGBM: A Highly Efficient Gradient Boosting Decision Tree</article-title>
            <source>Proceedings of the 31st International Conference on Neural Information Processing Systems</source>
            <volume>4</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B44">
        <label>44.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Friedman, J., Hastie, T. and Tibshirani, R. (2000) Additive Logistic Regression: A Statistical View of Boosting (with Discussion and a Rejoinder by the Authors). <italic>The Annals of Statistics</italic>, 28, 337-407. https://doi.org/10.1214/aos/1016218223 <pub-id pub-id-type="doi">10.1214/aos/1016218223</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1214/aos/1016218223">https://doi.org/10.1214/aos/1016218223</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Friedman, J.</string-name>
              <string-name>Hastie, T.</string-name>
              <string-name>Tibshirani, R.</string-name>
            </person-group>
            <year>2000</year>
            <article-title>Additive Logistic Regression: A Statistical View of Boosting (with Discussion and a Rejoinder by the Authors)</article-title>
            <source>The Annals of Statistics</source>
            <volume>28</volume>
            <pub-id pub-id-type="doi">10.1214/aos/1016218223</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B45">
        <label>45.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Finlay, S. (2010) Credit Scoring, Response Modeling, and Insurance Rating. Palgrave Macmillan.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Finlay, S.</string-name>
              <string-name>Scoring, R</string-name>
            </person-group>
            <year>2010</year>
            <article-title>Credit Scoring, Response Modeling, and Insurance Rating</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B46">
        <label>46.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">European Banking Authority (2017) Guidelines on PD Estimation, LGD Estimation and Treatment of Defaulted Assets.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Estimation, L</string-name>
            </person-group>
            <year>2017</year>
            <article-title>Guidelines on PD Estimation, LGD Estimation and Treatment of Defaulted Assets</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B47">
        <label>47.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Basel Committee on Banking Supervision (2011) Principles for the Sound Management of Operational Risk. BIS.</mixed-citation>
          <element-citation publication-type="other">
            <year>2011</year>
            <article-title>Principles for the Sound Management of Operational Risk</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B48">
        <label>48.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Financial Stability Board (2017) Artificial Intelligence and Machine Learning in Financial Services.</mixed-citation>
          <element-citation publication-type="other">
            <year>2017</year>
            <article-title>Artificial Intelligence and Machine Learning in Financial Services</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B49">
        <label>49.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Bellotti, T. and Crook, J. (2009) Support Vector Machines for Credit Scoring and Discovery of Significant Features. <italic>Expert Systems with Applications</italic>, 36, 3302-3308. https://doi.org/10.1016/j.eswa.2008.01.005 <pub-id pub-id-type="doi">10.1016/j.eswa.2008.01.005</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.eswa.2008.01.005">https://doi.org/10.1016/j.eswa.2008.01.005</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Bellotti, T.</string-name>
              <string-name>Crook, J.</string-name>
            </person-group>
            <year>2009</year>
            <article-title>Support Vector Machines for Credit Scoring and Discovery of Significant Features</article-title>
            <source>Expert Systems with Applications</source>
            <volume>36</volume>
            <pub-id pub-id-type="doi">10.1016/j.eswa.2008.01.005</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B50">
        <label>50.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Bank of England and Financial Conduct Authority (2022) Machine Learning in UK Financial Services.</mixed-citation>
          <element-citation publication-type="other">
            <year>2022</year>
            <article-title>Machine Learning in UK Financial Services</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B51">
        <label>51.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Brown, I. and Mues, C. (2012) An Experimental Comparison of Classification Algorithms for Imbalanced Credit Scoring Data Sets. <italic>Expert Systems with Applications</italic>, 39, 3446-3453. https://doi.org/10.1016/j.eswa.2011.09.033 <pub-id pub-id-type="doi">10.1016/j.eswa.2011.09.033</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.eswa.2011.09.033">https://doi.org/10.1016/j.eswa.2011.09.033</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Brown, I.</string-name>
              <string-name>Mues, C.</string-name>
            </person-group>
            <year>2012</year>
            <article-title>An Experimental Comparison of Classification Algorithms for Imbalanced Credit Scoring Data Sets</article-title>
            <source>Expert Systems with Applications</source>
            <volume>39</volume>
            <pub-id pub-id-type="doi">10.1016/j.eswa.2011.09.033</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B52">
        <label>52.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Barocas, S., Hardt, M. and Narayanan, A. (2019) Fairness and Machine Learning. MIT Press.</mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Barocas, S.</string-name>
              <string-name>Hardt, M.</string-name>
              <string-name>Narayanan, A.</string-name>
            </person-group>
            <year>2019</year>
            <article-title>Fairness and Machine Learning</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B53">
        <label>53.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Hull, J. (2018) Risk Management and Financial Institutions. 5th Edition, Wiley.</mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Hull, J.</string-name>
              <string-name>Edition, W</string-name>
            </person-group>
            <year>2018</year>
            <article-title>Risk Management and Financial Institutions</article-title>
            <source>5th Edition</source>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B54">
        <label>54.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Tasche, D. (2006) Validation of Internal Rating Systems and PD Estimates. https://arxiv.org/abs/physics/0606071</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Tasche, D.</string-name>
            </person-group>
            <year>2006</year>
            <article-title>Validation of Internal Rating Systems and PD Estimates</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B55">
        <label>55.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">James, G., Witten, D., Hastie, T. and Tibshirani, R. (2021) An Introduction to Statistical Learning. 2nd Edition, Springer.</mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>James, G.</string-name>
              <string-name>Witten, D.</string-name>
              <string-name>Hastie, T.</string-name>
              <string-name>Tibshirani, R.</string-name>
              <string-name>Edition, S</string-name>
            </person-group>
            <year>2021</year>
            <article-title>An Introduction to Statistical Learning</article-title>
            <source>2nd Edition</source>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B56">
        <label>56.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">OECD (2019) Artificial Intelligence in Society. OECD Publishing.</mixed-citation>
          <element-citation publication-type="other">
            <year>2019</year>
            <article-title>Artificial Intelligence in Society</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B57">
        <label>57.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Bazarbash, M. (2019) Fintech in Financial Inclusion: Machine Learning Applications in Assessing Credit Risk. IMF Working Papers, Vol. 2019, 1. https://doi.org/10.5089/9781498314428.001 <pub-id pub-id-type="doi">10.5089/9781498314428.001</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.5089/9781498314428.001">https://doi.org/10.5089/9781498314428.001</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Bazarbash, M.</string-name>
              <string-name>Papers, V</string-name>
            </person-group>
            <year>2019</year>
            <article-title>Fintech in Financial Inclusion: Machine Learning Applications in Assessing Credit Risk</article-title>
            <source>IMF Working Papers</source>
            <volume>1</volume>
            <pub-id pub-id-type="doi">10.5089/9781498314428.001</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B58">
        <label>58.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Varma, S. and Simon, R. (2006) Bias in Error Estimation When Using Cross-Validation for Model Selection. <italic>BMC Bioinformatics</italic>, 7, Article No. 91. https://doi.org/10.1186/1471-2105-7-91 <pub-id pub-id-type="doi">10.1186/1471-2105-7-91</pub-id><pub-id pub-id-type="pmid">16504092</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1186/1471-2105-7-91">https://doi.org/10.1186/1471-2105-7-91</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Varma, S.</string-name>
              <string-name>Simon, R.</string-name>
            </person-group>
            <year>2006</year>
            <article-title>Bias in Error Estimation When Using Cross-Validation for Model Selection</article-title>
            <source>BMC Bioinformatics</source>
            <volume>7</volume>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.1186/1471-2105-7-91</pub-id>
            <pub-id pub-id-type="pmid">16504092</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B59">
        <label>59.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Bishop, C. (2006) Pattern Recognition and Machine Learning. Springer.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Bishop, C.</string-name>
            </person-group>
            <year>2006</year>
            <article-title>Pattern Recognition and Machine Learning</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B60">
        <label>60.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">International Monetary Fund (2021) Financial Stability Implications of Artificial Intelligence. IMF Policy Paper.</mixed-citation>
          <element-citation publication-type="other">
            <year>2021</year>
            <article-title>Financial Stability Implications of Artificial Intelligence</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B61">
        <label>61.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Pazarbasioglu, C., Garcia Mora, A., Uttamchandani, M., Natarajan, H., Feyen, E. and Saal, M. (2020) Digital Financial Services (World Bank White Paper No. 54). World Bank. https://thedocs.worldbank.org/en/doc/305a39cbb6f35567db78bda6709c5cd8-0430012025/original/World-Bank-DFS-Whitepaper-DigitalFinancialServices.pdf?utm_source=chatgpt.com</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Pazarbasioglu, C.</string-name>
              <string-name>Mora, A.</string-name>
              <string-name>Uttamchandani, M.</string-name>
              <string-name>Natarajan, H.</string-name>
              <string-name>Feyen, E.</string-name>
              <string-name>Saal, M.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>Digital Financial Services (World Bank White Paper No</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B62">
        <label>62.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Pearl, J. (2009) Causality: Models, Reasoning and Inference. 2nd Edition, Cambridge University Press. https://doi.org/10.1017/cbo9780511803161 <pub-id pub-id-type="doi">10.1017/cbo9780511803161</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1017/cbo9780511803161">https://doi.org/10.1017/cbo9780511803161</ext-link></mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Pearl, J.</string-name>
              <string-name>Models, R</string-name>
              <string-name>Edition, C</string-name>
            </person-group>
            <year>2009</year>
            <article-title>Causality: Models, Reasoning and Inference</article-title>
            <source>2nd Edition</source>
            <pub-id pub-id-type="doi">10.1017/cbo9780511803161</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
    </ref-list>
  </back>
</article>