Research map / Probabilistic and scientific modeling / Molecules and proteins
GRAND-SLAMIN’ Interpretable Additive Modeling with Structural Constraints
Shibal Ibrahim, Gabriel Isaac Afriat, Kayhan Behdin, Rahul Mazumder
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| GRAND-SLAMIN vs EB2M test AUC | GRAND-SLAMIN · 14 datasets | test ROC AUC: outperforms in 10 of 14 | Improved |
| GRAND-SLAMIN vs NODE-GA2M | GRAND-SLAMIN · 14 datasets | test ROC AUC: outperforms in 50% of datasets | Mixed |
| GRAND-SLAMIN vs NODE-GA2M on Covertype | GRAND-SLAMIN · Covertype | test ROC AUC: 95.39 -> 98.11 | Improved |
| GRAND-SLAMIN vs NODE-GA2M on Madelon | GRAND-SLAMIN · Madelon | test ROC AUC: 60.07 -> 89.25 | Improved |
| add structural hierarchy constraints vs GAMI-Net and SIAN | GRAND-SLAMIN · 8 binary datasets | test ROC AUC: outperform in 7/8 datasets | Improved |
| strong hierarchy instead of weak on Madelon (ablation) | GRAND-SLAMIN · Madelon | test ROC AUC: 89.25 -> 86.23 | Hurt |
| strong hierarchy instead of weak on Bankruptcy (ablation) | GRAND-SLAMIN · Bankruptcy | test ROC AUC: 92.51 -> 90.45 | Hurt |
| add strong hierarchy constraint for feature selection (ablation) | GRAND-SLAMIN · Bankruptcy | number of features: 95 -> 7 | Improved |
| sparse backpropagation instead of dense (ablation) | GRAND-SLAMIN · Activity | training time: 10x faster | Improved |
| hierarchy constraints on main-effect stability (ablation) | GRAND-SLAMIN · bikesharing | variance of main effects | Improved |
| GRAND-SLAMIN vs full-complexity DNN | GRAND-SLAMIN · Madelon | test ROC AUC: 63.60 -> 89.25 | Improved |
| GRAND-SLAMIN sparse vs SPAM all pairwise on Madelon | GRAND-SLAMIN · Madelon | test ROC AUC: 68.59 -> 89.25 | Improved |
Closest papers by meaning
- Fast Automatic Smoothing for Generalized Additive Models (JMLR 2019 · similarity 0.87)
- Additive Models Explained: A Computational Complexity Approach (NeurIPS 2025 · similarity 0.86)
- Interpretable Generalized Additive Models for Datasets with Missing Values (NeurIPS 2024 · similarity 0.86)
- Generalized additive models via direct optimization of regularized decision stump forests (ICML 2025 · similarity 0.85)
- InstaSHAP: Interpretable Additive Models Explain Shapley Values Instantly (ICLR 2025 · similarity 0.83)
- Algorithm- and Data-Dependent Generalization Bounds for Diffusion Models (NeurIPS 2025 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
