An Optimised Greedy-Weighted Ensemble Framework for Financial Loan Default Prediction
Not on the map. Why?
Abstract (arXiv)
Accurate prediction of loan defaults is a central challenge in credit risk management, particularly in modern financial datasets characterised by nonlinear relationships, class imbalance, and evolving borrower behaviour. Traditional statistical models and static ensemble methods often struggle to maintain reliable performance under such conditions. This study proposes an Optimised Greedy-Weighted Ensemble framework for loan default prediction that dynamically allocates model weights based on empirical predictive performance. The framework integrates multiple machine learning classifiers, with their hyperparameters first optimised using Particle Swarm Optimisation. Model predictions are then combined via a regularised greedy weighting mechanism. At the same time, a neural-network-based meta-learner is employed within stacked-ensemble to capture higher-order relationships among model outputs. Experiments conducted on the Lending Club dataset demonstrate that the proposed framework improves predictive performance compared with individual classifiers. The BlendNet ensemble achieved the strongest results with an AUC of 0.80, a macro-average F1-score of 0.73, and a default recall of 0.81. Calibration analysis further shows that tree-based ensembles such as Extra Trees and Gradient Boosting provide the most reliable probability estimates, while the stacked ensemble offers superior ranking capability. Feature analysis using Recursive Feature Elimination identifies revolving utilisation, annual income, and debt-to-income ratio as the most influential predictors of loan default. These findings demonstrate that performance-driven ensemble weighting can improve both predictive accuracy and interpretability in credit risk modelling. The proposed framework provides a scalable data-driven approach to support institutional credit assessment, risk monitoring, and financial decision-making.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 13 of its 84 references that are in the map. First posted on arXiv 19 Mar 2026.
Builds on
13 of 84 references.
References · 13
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
- 2021Revisiting Deep Learning Models for Tabular Datacited by 740
- 2019TabNet: Attentive Interpretable Tabular Learningcited by 648
- 2020Learning under Concept Drift: A Reviewcited by 477
- 2020TabTransformer: Tabular Data Modeling Using Contextual Embeddingscited by 409
- 2021SAINT: Improved Neural Networks for Tabular Data via Row Attention and Contrastive Pre-Trainingcited by 319
- 2015Characterizing Concept Driftcited by 94
- 2015Unbounded Bayesian Optimization via Regularizationcited by 13
- 2020Adaptive XGBoost for Evolving Data Streamscited by 8
- 2018META-DES.H: a dynamic ensemble selection technique using meta-learning and a dynamic weighting approachcited by 4
- 2022Interpretable Selective Learning in Credit Riskcited by 2
Built on by
Not cited yet.