CORTEXA
← Browse
arxivq-fin.RMcs.LG2026-07-06

SHARC: SHAP-Based Interpretability in Machine Learning Risk Models for Regulatory Capital under ICAAP and CCAR

Ujjwala Vadrevu

The adoption of non-parametric machine learning models for regulatory capital estimation introduces a fundamental governance challenge: the inability to explain model outputs in a manner auditable by supervisory bodies. This 'black box' problem remains a major barrier to the adoption of Gaussian Process Regression (GPR) and related ML architectures in ICAAP and CCAR workflows despite their predictive advantages over traditional parametric approaches. This paper addresses this barrier through SHARC (SHAP for Regulatory Capital), an explainability framework for the Hybrid GPR-HS architecture and its stress-testing extension. SHapley Additive exPlanations (SHAP), derived from cooperative game theory and satisfying the properties of Local Accuracy, Missingness, Consistency, and Efficiency, are applied to Stressed Value-at-Risk (SVaR) outputs under three macro scenarios: West Asia War, Climate Risk, and AI Bubble/Regulatory Burden. SHARC decomposes SVaR into baseline, mean-driven, and volatility-driven components, enabling transparent linkage between scenario design and capital outcomes. Two findings emerge. First, SHARC consistently links non-linear SVaR outputs to underlying scenario inputs, confirming framework fidelity and providing auditable traceability of capital drivers. Second, under stress conditions, the mean return component (directional loss magnitude) dominates the variance component (volatility baseline) in determining capital levels, with implications for capital limit-setting, position management, and hedging strategy. The results establish SHARC as a regulator-aligned explainability layer that makes the Hybrid GPR-HS framework fully auditable and consistent with FRTB, ICAAP Pillar 2, and CCAR transparency requirements.

View free PDFSource page

Related papers

arxivcs.LGastro-ph.COastro-ph.GAhep-exhep-phstat.ML2026-07-23

An Introduction to Bayesian and Frequentist Simulation-Based Inference with Machine Learning

Maximilian Dax, Theo Heimel, Gilles Louppe

Simulation-based inference (SBI) with machine learning is an increasingly important tool for solving inverse problems in science and engineering, including parameter inference and the inversion of detector effects. We provide an overview of the Bayesian and frequentist statistica…

View free PDFSource page
arxivphysics.flu-dyncs.LGquant-ph2026-07-23

Explainable quantum-compressed machine learning for complex fluid flows

Xiao Xue, Maida Wang, Mingyang Gao, Minh Chung, Peter V. Coveney

Machine-learning surrogates of physical systems face a paradox: explainable models facing the challenge of expressivity to capture complex nonlinear flows, whereas expressive deep surrogates match high-fidelity simulations only through massive parameterisations that turn the lear…

View free PDFSource page
arxivstat.MLcs.LGstat.AP2026-07-31

Analytical and Bootstrap Confidence Intervals of Double Machine Learning: Simulation studies and an application to rural-urban difference in obesity prevalence

Haozheng Xu, Siyuan Ma, Qingyan Xiang

Double Machine Learning (DML) is a popular approach for treatment effect estimation in various settings, which allows a wide range of flexible machine learning methods to be used for nuisance parameter estimation while preserving valid inference. In practice, however, applied res…

View free PDFSource page
arxivquant-phcs.LGcs.SE2026-07-31

Transpiler Autotuning with Predictive Models for Quantum Circuit Optimization

Piotr Malkowski, Domenik Eichhorn, Joshua Ammermann, Rinor Kelmendi, Nick Poser, Patrick Hopf, et al.

Quantum software engineering is an emerging research field focusing on efficiently embedding the quantum programming paradigm into existing software ecosystems. A key aspect of this field is the realization of quantum algorithms using gate-based programming and the subsequent low…

View free PDFSource page
arxivcs.PLcs.LG2026-07-23

Relaxed activation analysis of dataflow networks - A clock calculus for machine learning and real-time scheduling

William Gaudelier, Albert Cohen, Dumitru Potop Butucaru

Previous work has shown that the simple dataflow primitives of the Lustre language allow the natural, semantically unambiguous, and compact representation of machine learning (ML) applications, including models featuring complex conditional execution and recurrent state. The Lust…

View free PDFSource page