FasterRisk: Fast and Accurate Interpretable Risk Scores
Jiachang Liu, Chudi Zhong, Boxuan Li, Margo I. Seltzer, Cynthia Rudin
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 1d50ad25-a47f-49f6-ab38-4c852da41e5bCited by top-tier papers6
- OKRidge: Scalable Optimal k-Sparse Ridge RegressionJiachang Liu, Sam Rosen, Chudi Zhong, Cynthia RudinNeurIPS 2023 · 10 citations
- SORTeD Rashomon Sets of Sparse Decision Trees: Anytime EnumerationElif Arslan, Jacobus G. M. van der Linden, Serge P. Hoogendoorn, Marco Rinaldi et al.NeurIPS 2025 · 8 citations
- Automatic Construction of Clinical Scoring Systems with LLM AgentsSilas Ruhrberg Estevez, Chris Chiu, Mihaela van der SchaarICML 2026 · 1 citation
- The Double-Edged Nature of the Rashomon Set for Trustworthy Machine LearningEthan Hsu, Harry Chen, Chudi Zhong, Lesia SemenovaICML 2026 · 1 citation
- FastSurvival: Hidden Computational Blessings in Training Cox Proportional Hazards ModelsJiachang Liu, Rui Zhang, Cynthia RudinNeurIPS 2024 · 1 citation
Builds on1
Related papers
- Learning Sparse Group Models Through Boolean RelaxationYijie Wang, Yuan Zhou, Xiaoqing Huang, Kun Huang et al.ICLR 2023
- Predictive Multiplicity in Probabilistic ClassificationJamelle Watson-Daniels, David C. Parkes, Berk UstunAAAI 2023 · 58 citations
- Algorithmic Risk Assessments Can Alter Human Decision-Making Processes in High-Stakes Government ContextsBen Green, Yiling ChenCSCW 2021 · 63 citations
- Principal Component Hierarchy for Sparse Quadratic ProgramsRobbie Vreugdenhil, Viet Anh Nguyen, Armin Eftekhari, Peyman Mohajerin EsfahaniICML 2021 · 2 citations
- A GNN-Guided Predict-and-Search Framework for Mixed-Integer Linear ProgrammingQingyu Han, Linxin Yang, Qian Chen, Xiang Zhou et al.ICLR 2023 · 9 citations
