---
title: 'RegScore: Interpretable Regression Scorecards'
url: https://www.emergentmind.com/topics/regscore
type: topic
---

# RegScore: Interpretable Regression Scorecards

RegScore is a scoring-system framework for regression that extends sparse, transparent scorecards from binary decision tasks to continuous targets. It was introduced for estimating mean Pulmonary Artery Pressure (mPAP) from tabular clinical and cardiac MRI-derived variables, with a downstream Pulmonary Hypertension (PH) diagnosis obtained by thresholding predicted mPAP. The method preserves the operational form of a clinical scorecard—human-readable rules with additive point contributions—but replaces the usual classification focus with a \(k\)-sparse ridge regression over binarized features, and relaxes the traditional restriction to integer-valued coefficients. The same paper also introduces multimodal personalized extensions, Personalized Linear Regression (PLR) and Personalized RegScore (PRS), built on the TIP (Tabular Image Pretraining) architecture to combine tabular data and cardiac MRI images while retaining an interpretable prediction layer [2507.19155].

## 1. Motivation and problem setting

Scoring systems are widely used in medicine because they are easy to inspect, compute, and communicate. The paper situates RegScore in the tradition of scorecards such as CHADS\(_2\) and NEWS\(_2\), but argues that most existing data-driven scoring systems are designed for classification rather than regression [2507.19155]. That distinction is central in conditions where the clinically relevant diagnosis is defined by thresholding an underlying continuous physiological quantity.

Pulmonary Hypertension is the motivating example. Diagnosis depends on whether invasively measured mPAP exceeds a threshold, but the paper argues that directly estimating mPAP is more informative than predicting a binary class alone. In the experimental protocol, PH classification is recovered by thresholding predicted mPAP at \(\text{mPAP} > 25 \text{ mmHg}\) [2507.19155]. This makes RegScore a regression model first and a classifier only secondarily.

The stated objective is therefore not merely to produce a sparse yes/no risk score, but to expose how tabular features contribute to an estimated continuous target. In the paper’s framing, this improves transparency because clinicians can inspect how each rule affects the predicted physiological quantity itself rather than only a class label.

## 2. Formal model and representation

RegScore operates on a binarized tabular representation. Given tabular features \(X^t = [x^t_1,\ldots,x^t_N] \in \mathbb{R}^{P \times N}\), the paper constructs a binary matrix
\[
\hat{X}^t = [\hat{x}^t_1,\ldots,\hat{x}^t_D] \in \{0,1\}^{P \times D}
\]
by one-hot encoding \(N_{\text{cat}}\) categorical variables and discretizing the remaining continuous variables with a discretization function \(\xi\). The two discretizers considered are MDLP (Minimum Description Length Principle) and tertile binning [2507.19155].

The core RegScore estimator is a sparse ridge regression:
\[
\min_{\beta} \left\| \mathbf{y} - \mathbf{\hat{X}}\boldsymbol{\beta} \right\|_2^2 + \lambda_2 \|\boldsymbol{\beta}\|_2^2 \quad \text{subject to} \quad \|\boldsymbol{\beta}\|_0 \le k.
\]
Here \(\boldsymbol{\beta}\) is the vector of feature weights or scores, \(\lambda_2\) is the ridge regularization coefficient, and \(k\) is the sparsity budget. Operationally, prediction takes the additive scorecard form
\[
\hat{y} = \beta_0 + \sum_{j=1}^{D} \hat{x}_j \beta_j,
\]
with at most \(k\) nonzero coefficients.

This formulation keeps the usual scorecard workflow—activate a small number of binary rules, attach coefficients, and sum them—but differs from classical systems such as RiskSLIM or FasterRisk in one specific respect: RegScore allows continuous coefficients rather than restricting weights to small integers [2507.19155]. The paper’s rationale is that, for regression targets such as mPAP, forcing integer points can reduce fidelity. A plausible implication is that RegScore treats interpretability as arising primarily from sparse, human-readable binary rules rather than from integer arithmetic alone.

## 3. Optimization and learning procedures

Because the constraint \(\|\boldsymbol{\beta}\|_0 \le k\) makes the optimization problem NP-hard, the paper introduces two training strategies [2507.19155].

The first is beam-search RegScore, denoted \(\mathrm{RegScore}_{BS}\). It adapts the beam-search phase of FasterRisk from logistic classification to sparse ridge regression. The method assumes that a good model of size \(k\) likely contains a good model of size \(k-1\). It therefore grows candidate sparse supports incrementally, optimizes the nonzero coefficients by ridge regression for each candidate, keeps only the top \(B\) candidates at each stage, and then fine-tunes the nonzero weights among the retained supports. The paper sets the beam width to
\[
B = 10.
\]

The second is OKRidge RegScore, denoted \(\mathrm{RegScore}_{OKR}\), which uses branch-and-bound for optimal \(k\)-sparse ridge regression. The search-tree logic is described in terms of computing a lower bound for a node, checking whether that bound is promising relative to the current incumbent, updating the best solution when appropriate, and pruning unpromising regions.

The paper also emphasizes computational practicality. The beam-search variant can be generated in minutes, approximately \(55\) seconds, which is contrasted with deep learning models that require hours [2507.19155]. This is presented as enabling clinicians or domain experts to inspect multiple near-optimal sparse models rather than a single opaque solution.

## 4. Personalized bimodal extensions

The multimodal extensions use TIP, a bimodal framework combining tabular data and cardiac MRI images. TIP consists of a convolutional image encoder \(\phi^i\), a transformer-based tabular encoder \(\phi^t\), and a multimodal interaction module \(\psi\). Given image representation
\[
I \in \mathbb{R}^{(H'W') \times E}
\]
and tabular representation
\[
T \in \mathbb{R}^{(N+1) \times E},
\]
the multimodal block outputs
\[
F \in \mathbb{R}^{(N+1) \times E}.
\]
TIP is pretrained with contrastive learning between image and tabular representations, image-tabular matching, and tabular reconstruction from \(F\) [2507.19155].

PLR replaces a standard scalar regression head with a personalized linear regression over tabular features. The CLS token is mapped to \(N+1\) parameters: \(N\) personalized coefficients \(\beta_{p,i}\) and one personalized bias \(\beta_{p,0}\). Prediction is
\[
\hat{y}_p = \beta_{p,0} + \sum_{i=1}^{N} x^t_{p,i} \times \beta_{p,i}.
\]
The coefficients are patient-specific because they are generated from the multimodal representation rather than shared globally.

PRS applies the same idea to the binary scorecard representation. It scores the binary rules and keeps only the top \(k\) features for each patient. The gating equations are
\[
S = W_g\left(\frac{1}{E}\sum_{i=1}^{E} F_i\right), \quad \tau_k = \mathrm{topk}(S)_{\min},
\]
\[
K_h = \mathds{1}(S \ge \tau_k), \qquad K_s = \sigma\!\left(\frac{S - \tau_k}{\tau}\right),
\]
with
\[
\tau = 0.1.
\]
Here \(K_h\) is the hard top-\(k\) selector used at inference and \(K_s\) is the differentiable approximation used in training [2507.19155].

These extensions preserve interpretability at the final layer. In PLR, the output remains a linear expression in clinically meaningful tabular variables. In PRS, the active rules can differ across patients, but the decision still depends on a small subset of human-readable binary conditions. This suggests a shift from a single global scorecard to patient-specific sparse scorecards without abandoning additive structure.

## 5. Data, preprocessing, and evaluation design

The experimental data come from the ASPIRE Registry and include 2051 invasively measured mPAP values matched with cardiac MRI videos from one cardiac cycle, drawn from 1918 patients. The cohort contains 1171 female and 747 male patients, with age \(64 \pm 14\) years. Some patients had repeated procedures over time [2507.19155].

For tabular data, the authors retain demographic and MRI-derived variables with fewer than 500 missing values. Numerical features are standardized, and only statistically significant ones are retained using f-regression. For imaging, cardiac MRIs from Siemens, Philips, and GE are reduced to systolic, diastolic, and intermediate frames as a 3-channel image, resampled to \(0.9375 \text{mm} \times 0.9735 \text{mm}\) and resized to \(128 \times 128\) [2507.19155].

The split is 1790 training samples and 261 test samples, with 5-fold cross-validation on the training set. Patient-level separation is enforced so that a patient appears in only one split, and stratification is based on mPAP divided into four bins. Regression is evaluated using MAE and Pearson correlation \(R\); downstream PH classification is evaluated using Accuracy and F1 after thresholding predicted mPAP at \(25 \text{ mmHg}\) [2507.19155].

The principal hyperparameters reported are:
\[
B=10,\qquad k=5 \text{ in the main sparse personalized experiments},\qquad \lambda_2 = 10^{-8},\qquad \tau = 0.1.
\]
RegScore uses MDLP discretization, whereas PRS uses tertiles. Deep models are trained in PyTorch on an NVIDIA A100 80GB GPU for up to 500 epochs of self-supervised learning and fine-tuning using Adam [2507.19155].

## 6. Empirical results and interpretability

On tabular scoring-system experiments, RegScore improves over classification-oriented scoring methods even when assessed on downstream PH diagnosis. For \(k=5\), the reported results are:
\[
\mathrm{RegScore}_{BS}: \text{MAE } 8.53 \pm 0.15,\quad R = 63.39 \pm 1.44,\quad \text{Accuracy } 86.59 \pm 0.27,\quad F1 = 92.43 \pm 0.15
\]
and
\[
\mathrm{RegScore}_{OKR}: \text{MAE } 8.69 \pm 0.30,\quad R = 61.73 \pm 2.03,\quad \text{Accuracy } 86.74 \pm 0.79,\quad F1 = 92.54 \pm 0.46.
\]
The paper contrasts these with MISS \(k=5\) at Accuracy \(84.52\), F1 \(90.88\); RiskSLIM \(k=5\) at Accuracy \(85.21\), F1 \(91.31\); and FasterRisk \(k=5\) at Accuracy \(85.36\), F1 \(91.40\) [2507.19155].

At \(k=50\), performance further improves:
\[
\mathrm{RegScore}_{BS}: \text{MAE } 7.75 \pm 0.13,\quad R = 69.90 \pm 1.02,\quad \text{Accuracy } 88.05 \pm 0.57,\quad F1 = 93.24 \pm 0.31,
\]
\[
\mathrm{RegScore}_{OKR}: \text{MAE } 7.73 \pm 0.13,\quad R = 70.06 \pm 0.96,\quad \text{Accuracy } 88.12 \pm 0.72,\quad F1 = 93.28 \pm 0.38.
\]
The paper identifies these as the best results in that table [2507.19155].

In the multimodal setting, the strongest black-box baseline is TIP:
\[
\text{TIP: MAE } 6.88 \pm 0.25,\quad R = 77.30 \pm 1.46,\quad \text{Accuracy } 88.58 \pm 0.63,\quad F1 = 93.39 \pm 0.35.
\]
The interpretable personalized variants remain close:
\[
\text{PLR: MAE } 7.14 \pm 0.14,\quad R = 75.07 \pm 0.87,\quad \text{Accuracy } 88.66 \pm 1.29,\quad F1 = 93.46 \pm 0.73,
\]
\[
\text{PRS}_5: \text{MAE } 7.19 \pm 0.16,\quad R = 74.85 \pm 1.26,\quad \text{Accuracy } 89.43 \pm 1.00,\quad F1 = 93.84 \pm 0.60.
\]
Thus TIP has the best pure regression performance, while PRS has the best classification metrics in that table [2507.19155].

The ablation results also identify specific dependencies. For PLR, removing images changes performance from MAE \(7.14\), \(R=75.07\) to MAE \(8.78\), \(R=62.28\), while removing self-supervised learning yields MAE \(7.79\), \(R=70.00\). For PRS, the full model gives MAE \(7.19\), \(R=74.85\), compared with MAE \(7.93\), \(R=70.10\) without self-supervised learning and MAE \(7.60\), \(R=71.53\) without image input [2507.19155]. The paper therefore attributes part of the multimodal performance to both image information and self-supervised pretraining.

Interpretability is illustrated by an explicit RegScore example. The scorecard contains a bias term \(40.46\) and the following rules: \(1.0 \le \texttt{reveal\_score} < 6.0\) contributes \(-11.23\); \(0.73 \le \texttt{vmi} \le 2.87\) contributes \(8.14\); \(49.17 \le \texttt{rvef} \le 82.0\) contributes \(-5.90\); \(311.46 \le \texttt{systolic\_pa\_area} < 672.0\) contributes \(-8.52\); and \(166.0 \le \texttt{septal\_angle\_syst}\) contributes \(10.71\). For a patient satisfying all five conditions,
\[
\widehat{\text{mPAP}} = 40.46 - 11.23 + 8.14 - 5.90 - 8.52 + 10.71.
\]
This is exactly the operational interpretation the paper emphasizes: a small table of rules whose contributions can be inspected and summed manually [2507.19155].

## 7. Limitations and relation to adjacent scoring-system research

The paper explicitly notes a performance–interpretability trade-off. Moving from the strongest black-box multimodal model, TIP, to RegScore, PLR, or PRS improves transparency but can reduce raw regression accuracy because the interpretable variants constrain the prediction to sparse or additive expressions in tabular variables [2507.19155].

Other stated limitations are dependence on discretization and binning, dependence on feature engineering and feature availability, the fact that PLR and PRS still rely on a deep multimodal encoder even though the final layer is interpretable, and the concentration of empirical validation in a single clinical domain. The authors identify incorporating binning into the optimization process as a direction for future work [2507.19155].

Within the broader scoring-system literature, RegScore occupies a specific position. “Score Engineered Logistic Regression” formulates constrained logistic scorecards for binary outcomes using sequential quadratic programming and linear equality and inequality score-engineering constraints [2003.00958]. “Gradient Boosted Risk Scores” learns compact additive point systems from boosted decision stumps and supports regression, classification, and time-to-event tasks [2605.02593]. This suggests that RegScore belongs to a broader research program that extends interpretable additive scoring systems beyond classical classification scorecards, but does so in a distinct way: by combining binary rule representations, \(k\)-sparse ridge regression, and multimodal personalized extensions targeted at continuous clinical prediction.

Source: https://www.emergentmind.com/topics/regscore