{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:02:43Z","timestamp":1750309363769,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T00:00:00Z","timestamp":1724457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,8,25]]},"DOI":"10.1145\/3637528.3671996","type":"proceedings-article","created":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T04:55:12Z","timestamp":1724561712000},"page":"1863-1874","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["FAST: An Optimization Framework for Fast Additive Segmentation in Transparent ML"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2520-1688","authenticated-orcid":false,"given":"Brian","family":"Liu","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1384-9743","authenticated-orcid":false,"given":"Rahul","family":"Mazumder","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,8,24]]},"reference":[{"issue":"405","key":"e_1_3_2_1_1_1","first-page":"289","article-title":"Additive isotonic models","volume":"84","author":"Bacchetti Peter","year":"1989","unstructured":"Peter Bacchetti. Additive isotonic models. Journal of the American Statistical Association, 84(405):289--294, 1989.","journal-title":"Journal of the American Statistical Association"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2788613"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467453"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-013-9215-9"},{"key":"e_1_3_2_1_5_1","first-page":"24","article-title":"Nearest neighbor based greedy coordinate descent","author":"Dhillon Inderjit","year":"2011","unstructured":"Inderjit Dhillon, Pradeep Ravikumar, and Ambuj Tewari. Nearest neighbor based greedy coordinate descent. Advances in Neural Information Processing Systems, 24, 2011.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOAS131"},{"key":"e_1_3_2_1_7_1","volume-title":"Generalized additive models for medical research. Statistical methods in medical research, 4(3):187--196","author":"Hastie Trevor","year":"1995","unstructured":"Trevor Hastie and Robert Tibshirani. Generalized additive models for medical research. Statistical methods in medical research, 4(3):187--196, 1995."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1214\/19-STS733"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1919"},{"issue":"205","key":"e_1_3_2_1_10_1","first-page":"1","article-title":"A scalable package for sparse learning using l0 regularization","volume":"24","author":"Hazimeh Hussein","year":"2023","unstructured":"Hussein Hazimeh, Rahul Mazumder, and Tim Nonet. L0learn: A scalable package for sparse learning using l0 regularization. Journal of Machine Learning Research, 24(205):1--8, 2023.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_11_1","volume-title":"A selective review of group selection in high-dimensional models. Statistical science: a review journal of the Institute of Mathematical Statistics, 27(4)","author":"Huang Jian","year":"2012","unstructured":"Jian Huang, Patrick Breheny, and Shuangge Ma. A selective review of group selection in high-dimensional models. Statistical science: a review journal of the Institute of Mathematical Statistics, 27(4), 2012."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2012.681238"},{"key":"e_1_3_2_1_13_1","first-page":"2887","volume-title":"The 22nd International Conference on Artificial Intelligence and Statistics","author":"Karimireddy Sai Praneeth","year":"2019","unstructured":"Sai Praneeth Karimireddy, Anastasia Koloskova, Sebastian U Stich, and Martin Jaggi. Efficient greedy coordinate descent for composite problems. In The 22nd International Conference on Artificial Intelligence and Statistics, pages 2887--2896. PMLR, 2019."},{"key":"e_1_3_2_1_14_1","volume-title":"Lightgbm: A highly efficient gradient boosting decision tree. Advances in neural information processing systems, 30","author":"Ke Guolin","year":"2017","unstructured":"Guolin Ke, Qi Meng, Thomas Finley, Taifeng Wang, Wei Chen, Weidong Ma, Qiwei Ye, and Tie-Yan Liu. Lightgbm: A highly efficient gradient boosting decision tree. Advances in neural information processing systems, 30, 2017."},{"key":"e_1_3_2_1_15_1","first-page":"2022","volume-title":"Death by round numbers: Glass-box machine learning uncovers biases in medical practice. medRxiv","author":"Lengerich Benjamin J","year":"2022","unstructured":"Benjamin J Lengerich, Rich Caruana, Mark E Nunnally, and Manolis Kellis. Death by round numbers: Glass-box machine learning uncovers biases in medical practice. medRxiv, pages 2022--04, 2022."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467387"},{"key":"e_1_3_2_1_17_1","volume-title":"fastsparsegams","author":"Liu Jiachang","year":"2023","unstructured":"Jiachang Liu. fastsparsegams, 2023. URL https:\/\/pypi.org\/project\/fastsparsegams\/."},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of machine learning research, 151:9304","author":"Liu Jiachang","year":"2022","unstructured":"Jiachang Liu, Chudi Zhong, Margo Seltzer, and Cynthia Rudin. Fast sparse classification for generalized linear and additive models. Proceedings of machine learning research, 151:9304, 2022."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339556"},{"key":"e_1_3_2_1_20_1","volume-title":"Discussion of ?best subset, forward stepwise or lasso? analysis and recommendations based on extensive comparisons\". Statistical Science, 35(4)","author":"Mazumder Rahul","year":"2020","unstructured":"Rahul Mazumder. Discussion of ?best subset, forward stepwise or lasso? analysis and recommendations based on extensive comparisons\". Statistical Science, 35(4), 2020."},{"key":"e_1_3_2_1_21_1","volume-title":"Interpretml: A unified framework for machine learning interpretability. arXiv preprint arXiv:1909.09223","author":"Nori Harsha","year":"2019","unstructured":"Harsha Nori, Samuel Jenkins, Paul Koch, and Rich Caruana. Interpretml: A unified framework for machine learning interpretability. arXiv preprint arXiv:1909.09223, 2019."},{"key":"e_1_3_2_1_22_1","first-page":"1632","volume-title":"International Conference on Machine Learning","author":"Nutini Julie","year":"2015","unstructured":"Julie Nutini, Mark Schmidt, Issam Laradji, Michael Friedlander, and Hoyt Koepke. Coordinate descent converges faster with the gauss-southwell rule than random selection. In International Conference on Machine Learning, pages 1632--1641. PMLR, 2015."},{"issue":"131","key":"e_1_3_2_1_23_1","first-page":"1","article-title":"make block coordinate descent converge faster: faster greedy rules, message-passing, active-set complexity, and superlinear convergence","volume":"23","author":"Nutini Julie","year":"2022","unstructured":"Julie Nutini, Issam Laradji, and Mark Schmidt. Let's make block coordinate descent converge faster: faster greedy rules, message-passing, active-set complexity, and superlinear convergence. Journal of Machine Learning Research, 23(131):1--74, 2022.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_24_1","volume-title":"Sep","author":"NYPD.","year":"2023","unstructured":"NYPD. Motor vehicle collisions - crashes: Nyc open data, Sep 2023."},{"key":"e_1_3_2_1_25_1","volume-title":"flam: Fits Piecewise Constant Models with Data-Adaptive Knots","author":"Petersen Ashley","year":"2018","unstructured":"Ashley Petersen. flam: Fits Piecewise Constant Models with Data-Adaptive Knots, 2018. URL https:\/\/CRAN.R-project.org\/package=flam. R package version 3.2."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2015.1073155"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2015.08.013"},{"key":"e_1_3_2_1_28_1","volume-title":"Proceedings of the American Statistical Association Original pagination is p, 45:48","author":"Stone Charles J","year":"1985","unstructured":"Charles J Stone and Cha-Yong Koo. Additive splines in statistics. Proceedings of the American Statistical Association Original pagination is p, 45:48, 1985."},{"key":"e_1_3_2_1_29_1","volume-title":"PMLR","author":"Ness Mike Van","year":"2023","unstructured":"Mike Van Ness, Tomas Bosschieter, Natasha Din, Andrew Ambrosy, Alexander Sandhu, and Madeleine Udell. Interpretable survival analysis for heart failure risk prediction. In Machine Learning for Health (ML4H), pages 574--593. PMLR, 2023."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2641190.2641198"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2016.1195744"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOAS147"}],"event":{"name":"KDD '24: The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Barcelona Spain","acronym":"KDD '24"},"container-title":["Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671996","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3637528.3671996","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:06:05Z","timestamp":1750291565000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671996"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,24]]},"references-count":32,"alternative-id":["10.1145\/3637528.3671996","10.1145\/3637528"],"URL":"https:\/\/doi.org\/10.1145\/3637528.3671996","relation":{},"subject":[],"published":{"date-parts":[[2024,8,24]]},"assertion":[{"value":"2024-08-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}