mlsanityData to 7 Oct 2026

Fast and Interpretable Mortality Risk Scores for Critical Care Patients

arXiv 2311.13015 ↗First posted 21 Nov 2023cs.LG cs.CYcited by 4

Not on the map. Why?

Abstract (arXiv)

Prediction of mortality in intensive care unit (ICU) patients typically relies on black box models (that are unacceptable for use in hospitals) or hand-tuned interpretable models (that might lead to the loss in performance). We aim to bridge the gap between these two categories by building on modern interpretable ML techniques to design interpretable mortality risk scores that are as accurate as black boxes. We developed a new algorithm, GroupFasterRisk, which has several important benefits: it uses both hard and soft direct sparsity regularization, it incorporates group sparsity to allow more cohesive models, it allows for monotonicity constraint to include domain knowledge, and it produces many equally-good models, which allows domain experts to choose among them. For evaluation, we leveraged the largest existing public ICU monitoring datasets (MIMIC III and eICU). Models produced by GroupFasterRisk outperformed OASIS and SAPS II scores and performed similarly to APACHE IV/IVa while using at most a third of the parameters. For patients with sepsis/septicemia, acute myocardial infarction, heart failure, and acute kidney failure, GroupFasterRisk models outperformed OASIS and SOFA. Finally, different mortality prediction ML approaches performed better based on variables selected by GroupFasterRisk as compared to OASIS variables. GroupFasterRisk's models performed better than risk scores currently used in hospitals, and on par with black box ML models, while being orders of magnitude sparser. Because GroupFasterRisk produces a variety of risk scores, it allows design flexibility - the key enabler of practical model creation. GroupFasterRisk is a fast, accessible, and flexible procedure that allows learning a diverse set of sparse risk scores for mortality prediction.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 10 of its 80 references that are in the map. First posted on arXiv 21 Nov 2023.

Builds on

10 of 80 references.

References · 10

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  2. 2019A Survey on Bias and Fairness in Machine Learningcited by 1,911
  3. 2018All Models are Wrong, but Many are Useful: Learning a Variable's Importance by Studying an Entire Class of Prediction Models Simultaneouslycited by 364
  4. 2021Interpretable Machine Learning: Fundamental Principles and 10 Grand Challengescited by 364
  5. 2019On the Existence of Simpler Machine Learning Modelscited by 87
  6. 2016Learning Optimized Risk Scorescited by 47
  7. 2020In Pursuit of Interpretable, Fair and Accurate Machine Learning for Criminal Recidivism Predictioncited by 42
  8. 2019Feature Robustness in Non-stationary Health Records: Caveats to Deployable Model Performance in Common Clinical Machine Learning Taskscited by 39
  9. 2022Interpretability, Then What? Editing Machine Learning Models to Reflect Human Knowledge and Valuescited by 25
  10. 2022FasterRisk: Fast and Accurate Interpretable Risk Scorescited by 21

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 1; 2026: 2.

4 papers.