Dynamic Ensemble Learning for Credit Scoring: A Comparative Study

• URL: http://arxiv.org/abs/2010.08930v1
• Date: Sun, 18 Oct 2020 07:06:02 GMT
• Title: Dynamic Ensemble Learning for Credit Scoring: A Comparative Study
• Authors: Mahsan Abdoli, Mohammad Akbari, Jamal Shahrabi
• Abstract summary: This study attempts to benchmark different dynamic selection approaches for ensemble learning models to accurately estimate the credit scoring task on a large and high-dimensional real-life credit scoring data set. The results of this study indicate that dynamic selection techniques are able to boost the performance of ensemble models, especially in imbalanced training environments.
• Score: 3.6503610360564687
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Automatic credit scoring, which assesses the probability of default by loan applicants, plays a vital role in peer-to-peer lending platforms to reduce the risk of lenders. Although it has been demonstrated that dynamic selection techniques are effective for classification tasks, the performance of these techniques for credit scoring has not yet been determined. This study attempts to benchmark different dynamic selection approaches systematically for ensemble learning models to accurately estimate the credit scoring task on a large and high-dimensional real-life credit scoring data set. The results of this study indicate that dynamic selection techniques are able to boost the performance of ensemble models, especially in imbalanced training environments.

Related papers

• Diversified Batch Selection for Training Acceleration [68.67164304377732]
  A prevalent research line, known as online batch selection, explores selecting informative subsets during the training process. vanilla reference-model-free methods involve independently scoring and selecting data in a sample-wise manner. We propose Diversified Batch Selection (DivBS), which is reference-model-free and can efficiently select diverse and representative samples.
  arXiv  Detail & Related papers  (2024-06-07T12:12:20Z)
• Investigating the Robustness of Counterfactual Learning to Rank Models: A Reproducibility Study [61.64685376882383]
  Counterfactual learning to rank (CLTR) has attracted extensive attention in the IR community for its ability to leverage massive logged user interaction data to train ranking models. This paper investigates the robustness of existing CLTR models in complex and diverse situations. We find that the DLA models and IPS-DCM show better robustness under various simulation settings than IPS-PBM and PRS with offline propensity estimation.
  arXiv  Detail & Related papers  (2024-04-04T10:54:38Z)
• A Distributionally Robust Optimisation Approach to Fair Credit Scoring [2.8851756275902467]
  Credit scoring has been catalogued by the European Commission and the Executive Office of the US President as a high-risk classification task. To address this concern, recent credit scoring research has considered a range of fairness-enhancing techniques.
  arXiv  Detail & Related papers  (2024-02-02T11:43:59Z)
• In Search of Insights, Not Magic Bullets: Towards Demystification of the Model Selection Dilemma in Heterogeneous Treatment Effect Estimation [92.51773744318119]
  This paper empirically investigates the strengths and weaknesses of different model selection criteria. We highlight that there is a complex interplay between selection strategies, candidate estimators and the data used for comparing them.
  arXiv  Detail & Related papers  (2023-02-06T16:55:37Z)
• Machine Learning Models Evaluation and Feature Importance Analysis on NPL Dataset [0.0]
  We evaluate how different Machine learning models perform on the dataset provided by a private bank in Ethiopia. XGBoost achieves the highest F1 score on the KMeans SMOTE over-sampled data.
  arXiv  Detail & Related papers  (2022-08-28T17:09:44Z)
• Selective Credit Assignment [57.41789233550586]
  We describe a unified view on temporal-difference algorithms for selective credit assignment. We present insights into applying weightings to value-based learning and planning algorithms.
  arXiv  Detail & Related papers  (2022-02-20T00:07:57Z)
• Predicting Credit Risk for Unsecured Lending: A Machine Learning Approach [0.0]
  This research paper is to build a contemporary credit scoring model to forecast credit defaults for unsecured lending (credit cards) Our research indicates that the Light Gradient Boosting Machine (LGBM) model is better equipped to deliver higher learning speeds, better efficiencies and manage larger data volumes. We expect that deployment of this model will enable better and timely prediction of credit defaults for decision-makers in commercial lending institutions and banks.
  arXiv  Detail & Related papers  (2021-10-05T17:54:56Z)
• Bagging Supervised Autoencoder Classifier for Credit Scoring [3.5977219275318166]
  The imbalanced nature of credit scoring datasets, as well as the heterogeneous nature of features in credit scoring datasets, pose difficulties in developing and implementing effective credit scoring models. We propose the Bagging Supervised Autoencoder (BSAC) that mainly leverages the superior performance of the Supervised Autoencoder. BSAC also addresses the data imbalance problem by employing a variant of the Bagging process based on the undersampling of the majority class.
  arXiv  Detail & Related papers  (2021-08-12T17:49:08Z)
• Characterizing Fairness Over the Set of Good Models Under Selective Labels [69.64662540443162]
  We develop a framework for characterizing predictive fairness properties over the set of models that deliver similar overall performance. We provide tractable algorithms to compute the range of attainable group-level predictive disparities. We extend our framework to address the empirically relevant challenge of selectively labelled data.
  arXiv  Detail & Related papers  (2021-01-02T02:11:37Z)
• A Novel Classification Approach for Credit Scoring based on Gaussian Mixture Models [0.0]
  This paper introduces a new method for credit scoring based on Gaussian Mixture Models. Our algorithm classifies consumers into groups which are labeled as positive or negative. We apply our model with real world databases from Australia, Japan, and Germany.
  arXiv  Detail & Related papers  (2020-10-26T07:34:27Z)
• Towards Model-Agnostic Post-Hoc Adjustment for Balancing Ranking Fairness and Algorithm Utility [54.179859639868646]
  Bipartite ranking aims to learn a scoring function that ranks positive individuals higher than negative ones from labeled data. There have been rising concerns on whether the learned scoring function can cause systematic disparity across different protected groups. We propose a model post-processing framework for balancing them in the bipartite ranking scenario.
  arXiv  Detail & Related papers  (2020-06-15T10:08:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.