$\texttt{findr}$: Transparent and Fair Credit Risk Decisions through Semi-Structured Regressions
- URL: http://arxiv.org/abs/2608.24582v1
- Date: Tue, 25 Aug 2026 14:08:07 GMT
- Title: $\texttt{findr}$: Transparent and Fair Credit Risk Decisions through Semi-Structured Regressions
- Abstract summary: $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.
- Score: 5.58905274289646
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Credit risk models increasingly need to combine predictive accuracy with transparent explanations and auditable fairness constraints. Logistic regression remains attractive because its coefficients are easy to interpret, but it can miss nonlinear structure. Flexible models can improve prediction, but their explanations are often post-hoc and may not describe the decision rule itself. We introduce $\texttt{findr}$, short for flexible, interpretable deep regression, a semi-structured framework for binary credit risk modelling that decomposes the logit into an interpretable structured component and an orthogonal neural residual. The orthogonalisation separates coefficient-based effects from residual nonlinear variation, while an in-processing Wasserstein penalty mitigates group disparities by comparing score distributions during training. The framework also includes diagnostics that measure the structured component's contribution to logit variation, decision agreement, and local directional consistency. We evaluate $\texttt{findr}$ in a simulation study and on eight public credit datasets using score-level accuracy-fairness frontiers. The results show that $\texttt{findr}$ behaves close to logistic regression when the signal is approximately linear, while recovering much of the predictive gain of neural models when nonlinear structure is relevant. The diagnostics identify when coefficient-based explanations remain close to the full fitted model and when residual variation must also be examined. These findings support semi-structured modelling as a practical way to make performance, fairness, and interpretability trade-offs explicit in credit risk decisions.
Related papers
- 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) - Neural Bayesian Sequential Routing [0.0]
We introduce textbfNeural Bayesian Sequential Routing (NBSR), a framework that models neural inference as active evidence accumulation over a hierarchical Directed Acyclic Graph (DAG)<n>NBSR achieves competitive predictive performance while providing transparent routing traces, path-dependent evidence attribution, uncertainty-aware decision control, and resource-rational inference.<n>Overall, NBSR offers a mathematically grounded framework for interpretable, modular, and resource-rational agentic AI.
arXiv Detail & Related papers (2026-05-22T22:45:56Z) - STRIKE: Additive Feature-Group-Aware Stacking Framework for Credit Default Prediction [0.38233569758620045]
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.
arXiv Detail & Related papers (2026-04-19T21:21:05Z) - Semi-structured multi-state delinquency model for mortgage default [7.0177704222466994]
We propose a semi-structured discrete-time multi-state model to analyse mortgage delinquency transitions.<n>This model combines an easy-to-understand structured additive predictor, with a flexible neural network component that captures complex nonlinearities and higher-order interactions.
arXiv Detail & Related papers (2026-03-27T11:22:22Z) - Informative Perturbation Selection for Uncertainty-Aware Post-hoc Explanations [7.226144684379189]
Trust and ethical concerns due to the widespread deployment of opaque machine learning (ML) models motivating the need for reliable model explanations.<n>Post-hoc model-agnostic explanation methods addresses this challenge by learning a surrogate model that approximates the behavior of the deployed black-box ML model in the locality of a sample of interest.<n>We propose emphExpected Active Gain for Local Explanations (textttEAGLE), a post-hoc model-agnostic explanation framework that formulates perturbation selection as an information-theoretic active learning problem.
arXiv Detail & Related papers (2026-03-16T06:48:56Z) - $V_{0.5}$: Generalist Value Model as a Prior for Sparse RL Rollouts [81.48669089692189]
Generalist Value Models (such as $V_0.5$) achieve pre-trained value estimation by explicitly encoding model capabilities in-context.<n>We propose $V_0.5$, which adaptively fuses the baseline predicted by such value model with the empirical mean derived from sparse rollouts.<n>$V_0.5$ significantly outperforms GRPO and DAPO, achieving faster convergence and over some 10% performance improvement.
arXiv Detail & Related papers (2026-03-11T14:57:41Z) - 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) - Rejection via Learning Density Ratios [50.91522897152437]
Classification with rejection emerges as a learning paradigm which allows models to abstain from making predictions.<n>We propose a different distributional perspective, where we seek to find an idealized data distribution which maximizes a pretrained model's performance.<n>Our framework is tested empirically over clean and noisy datasets.
arXiv Detail & Related papers (2024-05-29T01:32:17Z) - Explicit Tradeoffs between Adversarial and Natural Distributional
Robustness [48.44639585732391]
In practice, models need to enjoy both types of robustness to ensure reliability.
In this work, we show that in fact, explicit tradeoffs exist between adversarial and natural distributional robustness.
arXiv Detail & Related papers (2022-09-15T19:58:01Z) - Causality-aware counterfactual confounding adjustment as an alternative
to linear residualization in anticausal prediction tasks based on linear
learners [14.554818659491644]
We compare the linear residualization approach against the causality-aware confounding adjustment in anticausal prediction tasks.
We show that the causality-aware approach tends to (asymptotically) outperform the residualization adjustment in terms of predictive performance in linear learners.
arXiv Detail & Related papers (2020-11-09T17:59:57Z) - Structural Causal Models Are (Solvable by) Credal Networks [70.45873402967297]
Causal inferences can be obtained by standard algorithms for the updating of credal nets.
This contribution should be regarded as a systematic approach to represent structural causal models by credal networks.
Experiments show that approximate algorithms for credal networks can immediately be used to do causal inference in real-size problems.
arXiv Detail & Related papers (2020-08-02T11:19:36Z)
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.