mlsanityData to 14 Oct 2026

FasterRisk: Fast and Accurate Interpretable Risk Scores

arXiv 2210.05846 ↗First posted 12 Oct 2022cs.LGcited by 21

Not on the map. Why?

Abstract (arXiv)

Over the last century, risk scores have been the most popular form of predictive model used in healthcare and criminal justice. Risk scores are sparse linear models with integer coefficients; often these models can be memorized or placed on an index card. Typically, risk scores have been created either without data or by rounding logistic regression coefficients, but these methods do not reliably produce high-quality risk scores. Recent work used mathematical programming, which is computationally slow. We introduce an approach for efficiently producing a collection of high-quality risk scores learned from data. Specifically, our approach produces a pool of almost-optimal sparse continuous solutions, each with a different support set, using a beam-search algorithm. Each of these continuous solutions is transformed into a separate risk score through a "star ray" search, where a range of multipliers are considered before rounding the coefficients sequentially to maintain low logistic loss. Our algorithm returns all of these high-quality risk scores for the user to consider. This method completes within minutes and can be valuable in a broad variety of applications.

Key facts. Cited by 21 papers in the map (data through 14 Oct 2026). Builds on 9 of its 57 references that are in the map. First posted on arXiv 12 Oct 2022.

Builds on

9 of 57 references.

References · 9

  1. 2022Exploring the Whole Rashomon Set of Sparse Decision Treescited by 81
  2. 2015Supersparse Linear Integer Models for Optimized Medical Scoring Systemscited by 76
  3. 2016Restricted Strong Convexity Implies Weak Submodularitycited by 52
  4. 2016Learning Optimized Risk Scorescited by 47
  5. 2015Interpretable Classification Models for Recidivism Predictioncited by 44
  6. 2020In Pursuit of Interpretable, Fair and Accurate Machine Learning for Criminal Recidivism Predictioncited by 42
  7. 2020Learning Sparse Classifiers: Continuous and Mixed Integer Optimization Perspectivescited by 26
  8. 2022Fast Sparse Classification for Generalized Linear and Additive Modelscited by 19
  9. 2013Supersparse Linear Integer Models for Predictive Scoring Systemscited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 1; 2023: 3; 2024: 3; 2025: 8; 2026: 6.

21 papers.

Sort:

By area:

  1. 2024Amazing Things Come From Having Many Good Modelscited by 55
  2. 2022Logic-Based Explainability in Machine Learningcited by 48
  3. 2025Systemizing Multiplicity: The Curious Case of Arbitrariness in Machine Learningcited by 17
  4. 2025Rashomon Sets for Prototypical-Part Networks: Editing Interpretable Models in Real-Timecited by 13
  5. 2023On (assessing) the fairness of risk score modelscited by 12
  6. 2025SORTeD Rashomon Sets of Sparse Decision Trees: Anytime Enumerationcited by 6
  7. 2023Fast and Interpretable Mortality Risk Scores for Critical Care Patientscited by 4
  8. 2025Doctor Rashomon and the UNIVERSE of Madness: Variable Importance with Unobserved Confounding and the Rashomon Effectcited by 3
  9. 2023Feature Importance Measurement based on Decision Tree Samplingcited by 2
  10. 2024FastSurvival: Hidden Computational Blessings in Training Cox Proportional Hazards Modelscited by 1
  11. 2025Scalable First-order Method for Certifying Optimal k-Sparse GLMscited by 1
  12. 2025Leo Breiman, the Rashomon Effect, and the Occam Dilemmacited by 1
9 more
  1. 2026Why are there many equally good models? An Anatomy of the Rashomon Effectcited by 1
  2. 2026Automatic Construction of Clinical Scoring Systems with LLM Agentscited by 1
  3. 2024MISS: Multiclass Interpretable Scoring Systemscited by 0
  4. 2025SHAPoint: Task-Agnostic, Efficient, and Interpretable Point-Based Risk Scoring via Shapley Valuescited by 0
  5. 2025The Double-Edged Nature of the Rashomon Set for Trustworthy Machine Learningcited by 0
  6. 2026Same Error, Different Function: The Optimizer as an Implicit Prior in Financial Time Seriescited by 0
  7. 2026From Sequential Nodes to GPU Batches: Parallel Branch and Bound for Optimal k-Sparse GLMscited by 0
  8. 2026Model Multiplicity and Predictive Arbitrariness in Recidivism Risk Assessmentcited by 0
  9. 2026How Simple Can It Get? From Interpretable Equations to Readable Rules for Financial Decision Makingcited by 0