FAST: An Optimization Framework for Fast Additive Segmentation in Transparent ML
Brian Liu, Rahul Mazumder
Abstract
We present FAST, an optimization framework for fast additive segmentation. FAST segments piecewise constant shape functions for each feature in a dataset to produce transparent additive models. The framework leverages a novel optimization procedure to fit these models ∼2 orders of magnitude faster than existing state-of-the-art methods, such as explainable boosting machines [20]. We also develop new feature selection algorithms in the FAST framework to fit parsimonious models that perform well. Through experiments and case studies, we show that FAST improves the computational efficiency and interpretability of additive models.
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.
Builds on2
Related papers
- GRAND-SLAMIN' Interpretable Additive Modeling with Structural ConstraintsShibal Ibrahim, Gabriel Afriat, Kayhan Behdin, Rahul MazumderNeurIPS 2023 · 15 citations
- Additive Models Explained: A Computational Complexity ApproachShahaf Bassan, Michal Moshkovitz, Guy KatzNeurIPS 2025 · 4 citations
- Fire: An Optimization Approach for Fast Interpretable Rule ExtractionBrian Liu, Rahul MazumderKDD 2023 · 7 citations
- Scalable Interpretability via PolynomialsAbhimanyu Dubey, Filip Radenovic, Dhruv MahajanNeurIPS 2022 · 42 citations
- Provably Explaining Neural Additive ModelsShahaf Bassan, Yizhak Yisrael Elboher, Tobias Ladner, Volkan Şahin et al.ICLR 2026 · 3 citations
