{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/fast-sparse-classification-for-generalized","title":"Fast Sparse Classification for Generalized Linear and Additive Models","arxiv_id":"2202.11389","date":"2022-02-23","proceeding":null,"authors":["Jiachang Liu","Chudi Zhong","Margo Seltzer","Cynthia Rudin"],"abstract":"We present fast classification techniques for sparse generalized linear and additive models. These techniques can handle thousands of features and thousands of observations in minutes, even in the presence of many highly correlated features. For fast sparse logistic regression, our computational speed-up over other best-subset search techniques owes to linear and quadratic surrogate cuts for the logistic loss that allow us to efficiently screen features for elimination, as well as use of a priority queue that favors a more uniform exploration of features. As an alternative to the logistic loss, we propose the exponential loss, which permits an analytical solution to the line search at each iteration. Our algorithms are generally 2 to 5 times faster than previous approaches. They produce interpretable models that have accuracy comparable to black box models on challenging datasets.","url_abs":"https://arxiv.org/abs/2202.11389v2","url_pdf":"https://arxiv.org/pdf/2202.11389v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"fast-sparse-classification-for-generalized","repo_url":"https://github.com/jiachangliu/fastSparse","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"fast-sparse-classification-for-generalized","repo_url":"https://github.com/chudizhong/gamsrashomonset","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"additive-models","task_name":"Additive models"},{"task_slug":"classification-1","task_name":"Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2202.11389","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.11389"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/jiachangliu/fastSparse","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/chudizhong/gamsrashomonset","reach":{"status":"ok"}}],"summary":{"unverified":4},"by_repo_kind":{"official":{"samples":4,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"9f6fe0e3825bf0b2","entry":"add_bars_to_1d","repo":"jiachangliu/fastSparse","repo_kind":"official","path":"step_function_visualization/plot_utils.py","file_url":"https://github.com/jiachangliu/fastSparse/blob/HEAD/step_function_visualization/plot_utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9f6fe0e3825bf0b2"}},{"code_sha256_prefix":"d24dc709804c1c1d","entry":"convert_continuous_df_to_binary_df","repo":"jiachangliu/fastSparse","repo_kind":"official","path":"step_function_visualization/binarization_utils.py","file_url":"https://github.com/jiachangliu/fastSparse/blob/HEAD/step_function_visualization/binarization_utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"d24dc709804c1c1d"}},{"code_sha256_prefix":"a5228774077b1d82","entry":"create_fig_object","repo":"jiachangliu/fastSparse","repo_kind":"official","path":"step_function_visualization/plot_utils.py","file_url":"https://github.com/jiachangliu/fastSparse/blob/HEAD/step_function_visualization/plot_utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"a5228774077b1d82"}},{"code_sha256_prefix":"61f4ca7180d2e2ac","entry":"get_avg_of_list","repo":"jiachangliu/fastSparse","repo_kind":"official","path":"step_function_visualization/plot_utils.py","file_url":"https://github.com/jiachangliu/fastSparse/blob/HEAD/step_function_visualization/plot_utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"61f4ca7180d2e2ac"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}