STRIKE: Additive Feature-Group-Aware Stacking Framework for Credit Default Prediction

• URL: http://arxiv.org/abs/2604.17622v1
• Date: Sun, 19 Apr 2026 21:21:05 GMT
• Title: STRIKE: Additive Feature-Group-Aware Stacking Framework for Credit Default Prediction
• Abstract summary: STRIKE is a feature-group-aware stacking framework for structured credit risk data.<n>It partitions the feature space into semantically coherent groups and trains independent learners within each group.<n>It consistently outperforms strong tree-based baselines and conventional stacking approaches in terms of AUC-ROC.
• Score: 0.38233569758620045
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Credit risk default prediction remains a cornerstone of risk management in the financial industry. The task involves estimating the likelihood that a borrower will fail to meet debt obligations, an objective critical for lending decisions, portfolio optimization, and regulatory compliance. Traditional machine learning models such as logistic regression and tree-based ensembles are widely adopted for their interpretability and strong empirical performance. However, modern credit datasets are high-dimensional, heterogeneous, and noisy, increasing overfitting risk in monolithic models and reducing robustness under distributional shift. We introduce STRIKE (Stacking via Targeted Representations of Isolated Knowledge Extractors), a feature-group-aware stacking framework for structured tabular credit risk data. Rather than training a single monolithic model on the complete dataset, STRIKE partitions the feature space into semantically coherent groups and trains independent learners within each group. This decomposition is motivated by an additive perspective on risk modeling, where distinct feature sources contribute complementary evidence that can be combined through a structured aggregation. The resulting group-specific predictions are integrated through a meta-learner that aggregates signals while maintaining robustness and modularity. We evaluate STRIKE on three real-world datasets spanning corporate bankruptcy and consumer lending scenarios. Across all settings, STRIKE consistently outperforms strong tree-based baselines and conventional stacking approaches in terms of AUC-ROC. Ablation studies confirm that performance gains stem from meaningful feature decomposition rather than increased model complexity. Our findings demonstrate that STRIKE is a stable, scalable, and interpretable framework for credit risk default prediction tasks.

Related papers

• $\ exttt{findr}$: Transparent and Fair Credit Risk Decisions through Semi-Structured Regressions [5.58905274289646]
  $texttfindr$ is a semi-structured framework for binary credit risk modelling.<n>It decomposes the logit into an interpretable structured component and a neural residual.<n>It measures the structured component's contribution to logit variation, decision agreement, and local directional consistency.
  arXiv  Detail & Related papers  (2026-08-25T14:08:07Z)
• Joint Model and Data Sparsification via the Marginal Likelihood [53.29070892356214]
  We propose jointly learning individual feature and sample relevancies, enabling simultaneous model and data sparsification.<n>This symmetric pruning of model and data offers a natural extension that preserves conjugacy.<n> Empirical results across diverse regression tasks affirm that a joint ARD approach consistently yields both sparse and robust prediction models.
  arXiv  Detail & Related papers  (2026-05-28T13:26:53Z)
• Enhancing a Risk Model by Adding Transient Statistical Factors [90.40844650665713]
  Estimating asset returns is a key component of financial portfolio construction and evaluation.<n>We propose a systematic method based on maximum likelihood estimation to enhance an existing factor model.<n>We show that the proposed extension captures structure in the returns that is missed by the original model.
  arXiv  Detail & Related papers  (2026-05-13T04:15:24Z)
• Hierarchical Contrastive Learning for Multimodal Data [3.1788482285024107]
  Hierarchical Contrastive Learning is a framework that learns globally shared, partially shared, and modality-specific representations.<n>On multimodal electronic health records, HCL yields more informative representations and consistently improves predictive performance.
  arXiv  Detail & Related papers  (2026-04-07T05:53:04Z)
• Schema-Aware Planning and Hybrid Knowledge Toolset for Reliable Knowledge Graph Triple Verification [31.263531484583805]
  Knowledge Graphs (KGs) serve as a critical foundation for AI systems, yet their automated construction inevitably introduces noise, compromising data trustworthiness.<n>Existing triple verification methods, based on graph embeddings or language models, often suffer from single-source bias by relying on either internal structural constraints or external semantic evidence.<n>We propose SHARP, a training-free autonomous agent that reformulates triple verification as a process of strategic planning, active investigation, and evidential reasoning.
  arXiv  Detail & Related papers  (2026-04-05T17:10:18Z)
• Transfer Learning for Loan Recovery Prediction under Distribution Shifts with Heterogeneous Feature Spaces [7.515283162165111]
  This paper introduces FT-MDN-Transformer, which produces both loan-level point estimates and portfolio-level predictive distributions.<n>We evaluate the proposed approach in a controlled Monte Carlo simulation and in a real-world transfer setting using the Global Credit Data (GCD) loan dataset as source and a novel bonds dataset as target.
  arXiv  Detail & Related papers  (2026-04-03T07:54:49Z)
• An Optimised Greedy-Weighted Ensemble Framework for Financial Loan Default Prediction [0.8941624592392746]
  This study proposes an Optimised Greedy-Weighted Ensemble framework for loan default prediction.<n>The proposed framework dynamically allocates model weights based on empirical predictive performance.<n>It provides a scalable data-driven approach to support credit assessment, risk monitoring, and financial decision-making.
  arXiv  Detail & Related papers  (2026-03-19T14:04:37Z)
• Mitigating Reward Hacking in RLHF via Bayesian Non-negative Reward Modeling [49.41422138354821]
  We propose a principled reward modeling framework that integrates non-negative factor analysis into the Bradley-Terry preference model.<n>BNRM represents rewards through a sparse, non-negative latent factor generative process.<n>We show that BNRM substantially mitigates reward over-optimization, improves robustness under distribution shifts, and yields more interpretable reward decompositions than strong baselines.
  arXiv  Detail & Related papers  (2026-02-11T08:14:11Z)
• Mixture of Ranks with Degradation-Aware Routing for One-Step Real-World Image Super-Resolution [76.66229730098759]
  In real-world image super-resolution (Real-ISR), existing approaches mainly rely on fine-tuning pre-trained diffusion models.<n>We propose a Mixture-of-Ranks (MoR) architecture for single-step image super-resolution.<n>We introduce a fine-grained expert partitioning strategy that treats each rank in LoRA as an independent expert.
  arXiv  Detail & Related papers  (2025-11-20T04:11:44Z)
• Enhancing Credit Risk Prediction: A Meta-Learning Framework Integrating Baseline Models, LASSO, and ECOC for Superior Accuracy [7.254744067646655]
  This research proposes a comprehensive meta-learning framework that synthesizes multiple complementary models.<n>We implement Permutation Feature Importance analysis for each prediction class across all constituent models.<n>Results demonstrate that our framework significantly enhances the accuracy of financial entity classification.
  arXiv  Detail & Related papers  (2025-09-26T14:09:04Z)
• When Demonstrations Meet Generative World Models: A Maximum Likelihood Framework for Offline Inverse Reinforcement Learning [62.00672284480755]
  This paper aims to recover the structure of rewards and environment dynamics that underlie observed actions in a fixed, finite set of demonstrations from an expert agent. Accurate models of expertise in executing a task has applications in safety-sensitive applications such as clinical decision making and autonomous driving.
  arXiv  Detail & Related papers  (2023-02-15T04:14:20Z)
• Clustering Effect of (Linearized) Adversarial Robust Models [60.25668525218051]
  We propose a novel understanding of adversarial robustness and apply it on more tasks including domain adaption and robustness boosting. Experimental evaluations demonstrate the rationality and superiority of our proposed clustering strategy.
  arXiv  Detail & Related papers  (2021-11-25T05:51:03Z)

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.