{"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/hacsurv-a-hierarchical-copula-based-approach","title":"HACSurv: A Hierarchical Copula-Based Approach for Survival Analysis with Dependent Competing Risks","arxiv_id":"2410.15180","date":"2024-10-19","proceeding":null,"authors":["Xin Liu","Weijia Zhang","Min-Ling Zhang"],"abstract":"In survival analysis, subjects often face competing risks; for example, individuals with cancer may also suffer from heart disease or other illnesses, which can jointly influence the prognosis of risks and censoring. Traditional survival analysis methods often treat competing risks as independent and fail to accommodate the dependencies between different conditions. In this paper, we introduce HACSurv, a survival analysis method that learns Hierarchical Archimedean Copulas structures and cause-specific survival functions from data with competing risks. HACSurv employs a flexible dependency structure using hierarchical Archimedean copulas to represent the relationships between competing risks and censoring. By capturing the dependencies between risks and censoring, HACSurv improves the accuracy of survival predictions and offers insights into risk interactions. Experiments on synthetic dataset demonstrate that our method can accurately identify the complex dependency structure and precisely predict survival distributions, whereas the compared methods exhibit significant deviations between their predictions and the true distributions. Experiments on multiple real-world datasets also demonstrate that our method achieves better survival prediction compared to previous state-of-the-art methods.","url_abs":"https://arxiv.org/abs/2410.15180v2","url_pdf":"https://arxiv.org/pdf/2410.15180v2.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":"hacsurv-a-hierarchical-copula-based-approach","repo_url":"https://github.com/raymvp/hacsurv","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"prognosis","task_name":"Prognosis"},{"task_slug":"survival-analysis","task_name":"Survival Analysis"},{"task_slug":"survival-prediction","task_name":"Survival Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2410.15180","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.15180"}},"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/raymvp/hacsurv","reach":{"status":"ok"}}],"summary":{"unverified":8},"by_repo_kind":{"official":{"samples":8,"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":8,"samples":[{"code_sha256_prefix":"30b6ce813c8b878c","entry":"LOG","repo":"raymvp/hacsurv","repo_kind":"official","path":"truth_net.py","file_url":"https://github.com/raymvp/hacsurv/blob/HEAD/truth_net.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"30b6ce813c8b878c"}},{"code_sha256_prefix":"489456c8e0764aed","entry":"cumulative_integral","repo":"raymvp/hacsurv","repo_kind":"official","path":"HACSurv_competing_syn_SurvivalL1.py","file_url":"https://github.com/raymvp/hacsurv/blob/HEAD/HACSurv_competing_syn_SurvivalL1.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"489456c8e0764aed"}},{"code_sha256_prefix":"963ce6359a857359","entry":"process_surv_df_CIF","repo":"raymvp/hacsurv","repo_kind":"official","path":"New_HACSurv_FramingHam_bached.py","file_url":"https://github.com/raymvp/hacsurv/blob/HEAD/New_HACSurv_FramingHam_bached.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"963ce6359a857359"}},{"code_sha256_prefix":"b28270daddb1e419","entry":"process_surv_df_CIF","repo":"raymvp/hacsurv","repo_kind":"official","path":"New_HACSurv_Sym__MIMIC.py","file_url":"https://github.com/raymvp/hacsurv/blob/HEAD/New_HACSurv_Sym__MIMIC.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"b28270daddb1e419"}},{"code_sha256_prefix":"26721fe6903988de","entry":"process_surv_df_SF","repo":"raymvp/hacsurv","repo_kind":"official","path":"New_HACSurv_FramingHam_bached.py","file_url":"https://github.com/raymvp/hacsurv/blob/HEAD/New_HACSurv_FramingHam_bached.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"26721fe6903988de"}},{"code_sha256_prefix":"9888abebb0a8f1b8","entry":"process_surv_df_jointCIF","repo":"raymvp/hacsurv","repo_kind":"official","path":"New_HACSurv_FramingHam_bached.py","file_url":"https://github.com/raymvp/hacsurv/blob/HEAD/New_HACSurv_FramingHam_bached.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"9888abebb0a8f1b8"}},{"code_sha256_prefix":"80ec6b5418fd13df","entry":"process_surv_df_jointCIF","repo":"raymvp/hacsurv","repo_kind":"official","path":"New_HACSurv_MIMIC.py","file_url":"https://github.com/raymvp/hacsurv/blob/HEAD/New_HACSurv_MIMIC.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"80ec6b5418fd13df"}},{"code_sha256_prefix":"67d2a873c8c8fcd0","entry":"sine","repo":"raymvp/hacsurv","repo_kind":"official","path":"truth_net.py","file_url":"https://github.com/raymvp/hacsurv/blob/HEAD/truth_net.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"67d2a873c8c8fcd0"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}