Explainable Boosting Machine (EBM)

• Explainable Boosting Machine (EBM) is a glass-box model that combines additive methods, modern boosting, and automatic interaction detection to ensure both global and local interpretability.
• EBM enhances traditional generalized additive models using cyclic gradient boosting, bagging, and randomized splitting to reduce overfitting while maintaining competitive accuracy.
• EBM has been successfully applied in healthcare, insurance, and cybersecurity, providing actionable insights and transparent explanations that match or exceed black-box model performance.

An Explainable Boosting Machine (EBM) is a glass-box machine learning model that combines the interpretability of additive models with the predictive accuracy of modern ensemble methods. EBMs were first introduced in the InterpretML framework, which exposes interpretability algorithms under a unified API, and have since become central to interpretable machine learning applications spanning healthcare, insurance, scientific simulations, and autonomous systems. The EBM is built as a refined instance of a Generalized Additive Model (GAM), extended with modern boosting and interaction detection algorithms, enabling both global and local interpretability while maintaining competitive accuracy to leading black-box models.

1. Model Structure and Mathematical Formulation

EBM is formulated as a Generalized Additive Model (GAM), whose core predictive function is

$g(E[y]) = \beta_0 + \sum_j f_j(x_j)$

where $g$ is the link function (identity for regression, logistic for binary classification, etc.), $\beta_0$ is the intercept, and each $f_j(x_j)$ is a learned, potentially non-linear univariate function—often referred to as a “shape function”—that captures how the $j$ⁿᵗʰ feature influences the prediction independently.

EBMs extend this basic form to a Generalized Additive Model with Pairwise Interactions (GA²M), incorporating selected bivariate terms:

$$g(E[y]) = \beta_0 + \sum_j f_j(x_j) + \sum_{i<j} f_{ij}(x_i, x_j)$$

Each interaction term $f_{ij}$ models the joint contribution of a pair of features, discovered automatically during model fitting. All $f_j$ and $f_{ij}$ are estimated as non-parametric functions, typically stored as lookup tables derived from boosted shallow decision trees (Nori et al., 2019).

2. Algorithmic Enhancements over Traditional GAMs

Classical GAMs often use fitting procedures like penalized least squares or smoothing splines, which limit modeling capacity. EBM introduces several advances:

• Cyclic Gradient Boosting and Bagging: Each $f_j$ is learned using gradient boosting applied one feature at a time (cyclic or round-robin boosting). Bagging is applied to produce an ensemble of models, providing robust error estimates for the shape functions (Nori et al., 2019).
• Randomized or Predefined Splits: Instead of data-greedy splits, EBMs commonly adopt randomized or pre-chosen splits within each feature dimension. This reduces variance and guards against overfitting and bias due to collinearity (Nori et al., 2021).
• Automatic Interaction Detection: EBM can detect and model pairwise interactions by screening residuals after the main effects are fit, using procedures like the “FAST” quadrant method or other importance-rank heuristics (e.g., reduction in error when modeling residuals by 2D piecewise constant trees) (Nori et al., 2019, Hu et al., 2022).
• Additive Lookup-table Structure: Each $f_j$ is implemented as a table mapping feature values to additive contributions. This enables extremely fast scoring and straightforward explanation (Nori et al., 2019).

3. Interpretability: Global and Local Explanation

A central feature of EBM is interpretability at both the model and prediction level:

• Global Explanations: Each $f_j$ and $f_{ij}$ can be visualized independently (e.g., via line plots for univariate shape functions or heatmaps for bivariate interactions). This allows users to assess how features such as “age,” “vehicle price class,” or “exposure time” influence the overall model output, and to audit for domain-specific expectations or data quality issues (Nori et al., 2019, Krùpovà et al., 27 Mar 2025).
• Local Explanations: For any individual prediction, the EBM provides an additive decomposition—summed contributions from each feature and relevant interaction—prior to application of the link function. This enables precise attribution of a prediction (for instance, risk for a specific patient, or reason for detection of phishing) to the influencing input variables.

Because EBMs are additive, both global and local explanations require only inspection of the stored shape functions and summing their values for the given input (Nori et al., 2019, Bosschieter et al., 2022, Kundu et al., 2022).

4. Predictive Performance and Comparison to Black-box Models

EBMs have demonstrated predictive accuracy on par with or exceeding leading black-box models such as Random Forests, XGBoost, LightGBM, and Deep Neural Networks across numerous tabular data tasks (Nori et al., 2019, Bosschieter et al., 2022, Krùpovà et al., 27 Mar 2025):

Application Domain	EBM Accuracy (AUROC/other)	Comparator Models (e.g., XGBoost)	Notes
Healthcare Complication Risk	AUROC ≈ 0.757	Similar	Comparable to DNN, RF, XGBoost; full interpretability(Bosschieter et al., 2022)
Insurance Claim Modeling	Highest normalized Gini/dev.	GLM, GAM, CART, XGB	Outperforms or matches XGB, with glass-box interpretability(Krùpovà et al., 27 Mar 2025)
Phishing Detection	100% (small DS), 94.5% (large)	CatBoost, XGBoost	High, but runtime is less efficient for large data(Fajar et al., 11 Nov 2024)
VR Cybersickness Detection	99.75%/94.10% accuracy	DT, LR	EBM achieves highest scores(Kundu et al., 2022)

A key tradeoff is that EBM training time can be higher than black-box methods due to cyclic boosting and additive constraints. However, prediction time remains fast, as scoring is the sum of a small number of table lookups and additions (Nori et al., 2019).

5. Functional and Operational Details

Training Workflow

1. Initialization: $f_j$ are set to zero.
2. Cyclic Update: In round-robin order, each $f_j$ is updated using boosted shallow decision trees, fitting residuals from the current model estimate.
3. Bagging: An ensemble of such models is trained to produce uncertainty estimates and improve robustness.
4. Interaction Fitting: Periodically, candidate pairwise interaction terms $f_{ij}$ are screened, selected, and included based on their marginal contribution to reducing loss.
5. Prediction: For an input $x$, sum the relevant $f_j(x_j)$ and $f_{ij}(x_i, x_j)$, then apply the link function.

This procedure is repeated until a pre-specified number of epochs or until convergence (Nori et al., 2019).

Data and Feature Handling

• Discretization/Binning: Continuous features are often binned either by quantile, uniform, or randomized strategies before tree fitting, especially in high-cardinality settings or under privacy constraints (Nori et al., 2021).
• Pairwise Interactions: To maintain interpretability, only a small set (e.g., top $k$ by gain or importance) of pairwise interaction terms are included, avoiding overfitting and complexity (Nori et al., 2019, Krùpovà et al., 27 Mar 2025).
• Bagging Parameters: The number of outer and inner bags, min_samples_leaf, and interaction count are subject to tuning for optimal bias-variance control (Bosschieter et al., 2022).

6. Advanced Features and Extensions

Differential Privacy Integration

The DP-EBM extends EBM to settings with sensitive data by:

• Private feature binning: Using a differentially-private quantile binning procedure.
• Noisy leaf value updates: Applying Gaussian noise calibrated to data sensitivity during boosting (using bounds $R$ and scale $\sigma$ to ensure privacy as per the GDP framework).
• Post-processing: Shape functions may be safely edited post hoc (e.g., via isotonic regression to enforce monotonicity) without additional privacy cost (Nori et al., 2021).

This approach yields “exact” interpretability for private models and allows post-training expert corrections (Nori et al., 2021).

High-dimensional and Workflow Scalability

• Sparsity via LASSO: In high-dimensional applications (hundreds to thousands of features), EBMs can lose interpretability due to the number of additive terms. Post-processing the fitted EBM with LASSO shrinks many terms to zero, drastically reducing model complexity and scoring time with minimal performance loss (Greenwell et al., 2023).
• Multi-step Feature Selection: To mitigate spurious interactions and single feature dominance, multi-stage, ensemble-based cross-feature pre-selection (using filter methods like SHAP, XGBoost, Random Forests, permutation, or correlation metrics) can be employed prior to EBM fitting, ensuring more stable and meaningful interaction detection (R et al., 2023).
• Tabularization for Scientific Data: For non-tabular data (e.g., images), domain-specific feature extraction (e.g., Gabor Wavelet Transform for cold-atom soliton images) can convert scientific images into interpretable tabular representations suitable for EBM (Schug et al., 2023).

7. Practical Impact and Application Domains

EBMs have been widely adopted for their unique combination of accuracy and interpretability:

• Healthcare: Prediction of severe maternal morbidity, preterm preeclampsia, etc., with model transparency enabling novel risk factor discovery and actionable insights (Bosschieter et al., 2022).
• Finance and Insurance: Accurate, transparent models for pricing and claims prediction ensure regulatory compliance (e.g., GDPR), allow for expert auditing, and support tariff calibration with visual shape function explanations of risk factors (Krùpovà et al., 27 Mar 2025).
• Scientific Computing and Physics: Used for interpretable modeling of the baryon cycle in galaxies, exposing the role of mass, velocity dispersion, and star-forming gas in governing baryon retention, via interpretable feature and interaction functions (Khanom et al., 13 Apr 2025, Hausen et al., 2022).
• Cybersecurity: Phishing detection pipelines leverage EBM's explanations to validate and refine detection logic (Fajar et al., 11 Nov 2024).
• Autonomous Systems and Traffic Prediction: EBM models have achieved competitive accuracy with deep networks on traffic destination tasks, with the added advantage of feature importance and interaction visualization for debugging and system trust (Yousif et al., 5 Feb 2024).
• Human-in-the-Loop Labeling and Dimensionality Reduction: Visual-labeling frameworks and interactive cluster explanation tools directly integrate EBM for uncertainty-guided sample selection, label correction, and cluster interpretation (Ponnoprat et al., 2022, Salmanian et al., 10 Feb 2024).

EBMs thus address a broad need for models that are both auditable and high-performing in domains where explanation and regulatory transparency are as important as predictive power.

---

In summary, the Explainable Boosting Machine is a glass-box modeling technique that operationalizes interpretability and accuracy through additive, tree-boosted, and interaction-aware architectures. Its modern algorithmic foundations—cyclic boosting, automatic interaction selection, and ensemble averaging—make it robust to collinearity and high-dimensionality (with optional post-fitting sparsity), while its additive structure supports transparent and actionable explanations at both the global and local level. Through iterative refinement and extensive benchmarking, EBM has established itself as a key methodology in interpretable machine learning for scientific, medical, and industrial environments.