Supersparse Linear Integer Models for Interpretable Classification
Not on the map. Why?
Abstract (arXiv)
Scoring systems are classification models that only require users to add, subtract and multiply a few meaningful numbers to make a prediction. These models are often used because they are practical and interpretable. In this paper, we introduce an off-the-shelf tool to create scoring systems that both accurate and interpretable, known as a Supersparse Linear Integer Model (SLIM). SLIM is a discrete optimization problem that minimizes the 0-1 loss to encourage a high level of accuracy, regularizes the L0-norm to encourage a high level of sparsity, and constrains coefficients to a set of interpretable values. We illustrate the practical and interpretable nature of SLIM scoring systems through applications in medicine and criminology, and show that they are are accurate and sparse in comparison to state-of-the-art classification models using numerical experiments.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 Jun 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 3; 2023: 0; 2024: 0; 2025: 2.
8 papers.
- 2022Rethinking Explainability as a Dialogue: A Practitioner's Perspectivecited by 52
- 2021Interpretable Clustering via Multi-Polytope Machinescited by 11
- 2021Interpretable and Fair Boolean Rule Sets via Column Generationcited by 10
- 2022Trade-off Between Efficiency and Consistency for Removal-based Explanationscited by 6
- 2021Fair Decision Rules for Binary Classificationcited by 4
- 2025Fairness and Sparsity within Rashomon sets: Enumeration-Free Exploration and Characterizationcited by 4
- 2022On the Importance of Application-Grounded Experimental Design for Evaluating Explainable ML Methodscited by 0
- 2025Additive Large Language Models for Semi-Structured Textcited by 0
- 2025Additive Large Language Models for Semi-Structured Text14 Nov 2025
- 2025Fairness and Sparsity within Rashomon sets: Enumeration-Free Exploration and Characterization7 Feb 2025
- 2022Trade-off Between Efficiency and Consistency for Removal-based Explanations31 Oct 2022
- 2022On the Importance of Application-Grounded Experimental Design for Evaluating Explainable ML Methods24 Jun 2022
- 2022Rethinking Explainability as a Dialogue: A Practitioner's Perspective3 Feb 2022
- 2021Interpretable Clustering via Multi-Polytope Machines10 Dec 2021
- 2021Interpretable and Fair Boolean Rule Sets via Column Generation16 Nov 2021
- 2021Fair Decision Rules for Binary Classification3 Jul 2021