← 返回论文检索
KDD 2024Research Track Papers

FAST: An Optimization Framework for Fast Additive Segmentation in Transparent ML

Brian Liu 0002, Rahul Mazumder

PDF 由论文原始站点提供,PaperCompass 不保存论文文件。DOI 10.1145/3637528.3671996 ↗

摘要

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.