{"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/proper-scoring-rules-for-survival-analysis","title":"Proper Scoring Rules for Survival Analysis","arxiv_id":"2305.00621","date":"2023-05-01","proceeding":null,"authors":["Hiroki Yanagisawa"],"abstract":"Survival analysis is the problem of estimating probability distributions for future event times, which can be seen as a problem in uncertainty quantification. Although there are fundamental theories on strictly proper scoring rules for uncertainty quantification, little is known about those for survival analysis. In this paper, we investigate extensions of four major strictly proper scoring rules for survival analysis and we prove that these extensions are proper under certain conditions, which arise from the discretization of the estimation of probability distributions. We also compare the estimation performances of these extended scoring rules by using real datasets, and the extensions of the logarithmic score and the Brier score performed the best.","url_abs":"https://arxiv.org/abs/2305.00621v3","url_pdf":"https://arxiv.org/pdf/2305.00621v3.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":"proper-scoring-rules-for-survival-analysis","repo_url":"https://github.com/ibm/dqs","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"survival-analysis","task_name":"Survival Analysis"},{"task_slug":"uncertainty-quantification","task_name":"Uncertainty Quantification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=2305.00621","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.00621"}},"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":"deterministic:regex_extraction","url":"https://github.com/IBM/dqs","reach":{"status":"ok","spdx":"Apache-2.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ibm/dqs","reach":{"status":"ok","spdx":"Apache-2.0"}}],"summary":{"unverified":5},"by_repo_kind":{"official":{"samples":5,"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":"85bd6774a6e75b3a","entry":"Dcalibration","repo":"IBM/dqs","repo_kind":"official","path":"dqs/calibration.py","file_url":"https://github.com/IBM/dqs/blob/HEAD/dqs/calibration.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"85bd6774a6e75b3a"}},{"code_sha256_prefix":"7341fd58f4c2586a","entry":"estimate_curve","repo":"IBM/dqs","repo_kind":"official","path":"dqs/kaplan_meier.py","file_url":"https://github.com/IBM/dqs/blob/HEAD/dqs/kaplan_meier.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"7341fd58f4c2586a"}},{"code_sha256_prefix":"eeeda660c3afa1dc","entry":"estimate_dist","repo":"IBM/dqs","repo_kind":"official","path":"dqs/kaplan_meier.py","file_url":"https://github.com/IBM/dqs/blob/HEAD/dqs/kaplan_meier.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"eeeda660c3afa1dc"}},{"code_sha256_prefix":"75c4b6f47d86bf7d","entry":"hierarchical_softmax","repo":"IBM/dqs","repo_kind":"official","path":"dqs/torch/layer.py","file_url":"https://github.com/IBM/dqs/blob/HEAD/dqs/torch/layer.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"75c4b6f47d86bf7d"}},{"code_sha256_prefix":"d7cb641ceb178f95","entry":"sigsoftmax","repo":"IBM/dqs","repo_kind":"official","path":"dqs/torch/layer.py","file_url":"https://github.com/IBM/dqs/blob/HEAD/dqs/torch/layer.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"d7cb641ceb178f95"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}