{"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/optimal-sparse-survival-trees","title":"Optimal Sparse Survival Trees","arxiv_id":"2401.15330","date":"2024-01-27","proceeding":null,"authors":["Rui Zhang","Rui Xin","Margo Seltzer","Cynthia Rudin"],"abstract":"Interpretability is crucial for doctors, hospitals, pharmaceutical companies and biotechnology corporations to analyze and make decisions for high stakes problems that involve human health. Tree-based methods have been widely adopted for survival analysis due to their appealing interpretablility and their ability to capture complex relationships. However, most existing methods to produce survival trees rely on heuristic (or greedy) algorithms, which risk producing sub-optimal models. We present a dynamic-programming-with-bounds approach that finds provably-optimal sparse survival tree models, frequently in only a few seconds.","url_abs":"https://arxiv.org/abs/2401.15330v3","url_pdf":"https://arxiv.org/pdf/2401.15330v3.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":"optimal-sparse-survival-trees","repo_url":"https://github.com/ruizhang1996/optimal-sparse-survival-trees-public","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"survival-analysis","task_name":"Survival Analysis"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2401.15330","atlas_url":"https://app.syntology.ai/?focus=2401.15330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.15330"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+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/ruizhang1996/optimal-sparse-survival-trees-public","reach":{"status":"ok","spdx":"NOASSERTION"}}],"summary":{"ran":9,"unverified":3},"by_repo_kind":{"official":{"samples":12,"ran":9,"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":12,"samples":[{"code_sha256_prefix":"31c4228643e23966","entry":"cart","repo":"ruizhang1996/optimal-sparse-survival-trees-public","repo_kind":"official","path":"osst/model/imbalance/osdt_sup.py","file_url":"https://github.com/ruizhang1996/optimal-sparse-survival-trees-public/blob/HEAD/osst/model/imbalance/osdt_sup.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"31c4228643e23966"}},{"code_sha256_prefix":"f0a82d5c9574c28b","entry":"cut","repo":"ruizhang1996/optimal-sparse-survival-trees-public","repo_kind":"official","path":"osst/model/threshold_guess.py","file_url":"https://github.com/ruizhang1996/optimal-sparse-survival-trees-public/blob/HEAD/osst/model/threshold_guess.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"f0a82d5c9574c28b"}},{"code_sha256_prefix":"48c94535d9f42dcd","entry":"encode_feature","repo":"ruizhang1996/optimal-sparse-survival-trees-public","repo_kind":"official","path":"experiments/datasets/preprocessing.py","file_url":"https://github.com/ruizhang1996/optimal-sparse-survival-trees-public/blob/HEAD/experiments/datasets/preprocessing.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"48c94535d9f42dcd"}},{"code_sha256_prefix":"c2c93e1427a73dd8","entry":"fit_boosted_tree","repo":"ruizhang1996/optimal-sparse-survival-trees-public","repo_kind":"official","path":"osst/model/threshold_guess.py","file_url":"https://github.com/ruizhang1996/optimal-sparse-survival-trees-public/blob/HEAD/osst/model/threshold_guess.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"c2c93e1427a73dd8"}},{"code_sha256_prefix":"6378f6dece0a3ee1","entry":"get_false","repo":"ruizhang1996/optimal-sparse-survival-trees-public","repo_kind":"official","path":"osst/model/imbalance/osdt_imb_v9.py","file_url":"https://github.com/ruizhang1996/optimal-sparse-survival-trees-public/blob/HEAD/osst/model/imbalance/osdt_imb_v9.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"6378f6dece0a3ee1"}},{"code_sha256_prefix":"91a29b5d2f76fec8","entry":"get_fixed_false","repo":"ruizhang1996/optimal-sparse-survival-trees-public","repo_kind":"official","path":"osst/model/imbalance/osdt_imb_v9.py","file_url":"https://github.com/ruizhang1996/optimal-sparse-survival-trees-public/blob/HEAD/osst/model/imbalance/osdt_imb_v9.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"91a29b5d2f76fec8"}},{"code_sha256_prefix":"3124c55e58633650","entry":"get_split","repo":"ruizhang1996/optimal-sparse-survival-trees-public","repo_kind":"official","path":"osst/model/imbalance/osdt_imb_v9.py","file_url":"https://github.com/ruizhang1996/optimal-sparse-survival-trees-public/blob/HEAD/osst/model/imbalance/osdt_imb_v9.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"3124c55e58633650"}},{"code_sha256_prefix":"6d71fd9c09e9d427","entry":"get_thresholds","repo":"ruizhang1996/optimal-sparse-survival-trees-public","repo_kind":"official","path":"osst/model/threshold_guess.py","file_url":"https://github.com/ruizhang1996/optimal-sparse-survival-trees-public/blob/HEAD/osst/model/threshold_guess.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"6d71fd9c09e9d427"}},{"code_sha256_prefix":"f91919b30c6914f9","entry":"harrell_c_index","repo":"ruizhang1996/optimal-sparse-survival-trees-public","repo_kind":"official","path":"osst/model/metrics.py","file_url":"https://github.com/ruizhang1996/optimal-sparse-survival-trees-public/blob/HEAD/osst/model/metrics.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"f91919b30c6914f9"}},{"code_sha256_prefix":"47effd42a0a6af4a","entry":"brier_score","repo":"ruizhang1996/optimal-sparse-survival-trees-public","repo_kind":"official","path":"osst/model/metrics.py","file_url":"https://github.com/ruizhang1996/optimal-sparse-survival-trees-public/blob/HEAD/osst/model/metrics.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"47effd42a0a6af4a"}},{"code_sha256_prefix":"853df50d15ebc2ef","entry":"get_z","repo":"ruizhang1996/optimal-sparse-survival-trees-public","repo_kind":"official","path":"osst/model/imbalance/osdt_sup.py","file_url":"https://github.com/ruizhang1996/optimal-sparse-survival-trees-public/blob/HEAD/osst/model/imbalance/osdt_sup.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"853df50d15ebc2ef"}},{"code_sha256_prefix":"77068e0650de5e6b","entry":"integrated_brier_score","repo":"ruizhang1996/optimal-sparse-survival-trees-public","repo_kind":"official","path":"osst/model/metrics.py","file_url":"https://github.com/ruizhang1996/optimal-sparse-survival-trees-public/blob/HEAD/osst/model/metrics.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"77068e0650de5e6b"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}