{"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/leveraging-predictive-equivalence-in-decision","title":"Leveraging Predictive Equivalence in Decision Trees","arxiv_id":"2506.14143","date":"2025-06-17","proceeding":null,"authors":["Hayden McTavish","Zachery Boner","Jon Donnelly","Margo Seltzer","Cynthia Rudin"],"abstract":"Decision trees are widely used for interpretable machine learning due to their clearly structured reasoning process. However, this structure belies a challenge we refer to as predictive equivalence: a given tree's decision boundary can be represented by many different decision trees. The presence of models with identical decision boundaries but different evaluation processes makes model selection challenging. The models will have different variable importance and behave differently in the presence of missing values, but most optimization procedures will arbitrarily choose one such model to return. We present a boolean logical representation of decision trees that does not exhibit predictive equivalence and is faithful to the underlying decision boundary. We apply our representation to several downstream machine learning tasks. Using our representation, we show that decision trees are surprisingly robust to test-time missingness of feature values; we address predictive equivalence's impact on quantifying variable importance; and we present an algorithm to optimize the cost of reaching predictions.","url_abs":"https://arxiv.org/abs/2506.14143v1","url_pdf":"https://arxiv.org/pdf/2506.14143v1.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":"leveraging-predictive-equivalence-in-decision","repo_url":"https://github.com/haydenmct/predictive-equivalence","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"interpretable-machine-learning","task_name":"Interpretable Machine Learning"},{"task_slug":"missing-values","task_name":"Missing Values"},{"task_slug":"model-selection","task_name":"Model Selection"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2506.14143","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.14143"}},"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/haydenmct/predictive-equivalence","reach":null}],"summary":{"ran":1,"ran_draft_wrong":2,"unverified":1},"by_repo_kind":{"official":{"samples":4,"ran":3,"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":"2c5958e110c2b329","entry":"PCC","repo":"haydenmct/predictive-equivalence","repo_kind":"official","path":"models/pcc.py","file_url":"https://github.com/haydenmct/predictive-equivalence/blob/HEAD/models/pcc.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"2c5958e110c2b329"}},{"code_sha256_prefix":"ef2860296a12014d","entry":"merge_pccs","repo":"haydenmct/predictive-equivalence","repo_kind":"official","path":"models/pcc.py","file_url":"https://github.com/haydenmct/predictive-equivalence/blob/HEAD/models/pcc.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ef2860296a12014d"}},{"code_sha256_prefix":"f0eb654fa74c19b0","entry":"tree_to_leaf_pccs","repo":"haydenmct/predictive-equivalence","repo_kind":"official","path":"models/pcc.py","file_url":"https://github.com/haydenmct/predictive-equivalence/blob/HEAD/models/pcc.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f0eb654fa74c19b0"}},{"code_sha256_prefix":"276342bb0ec1d263","entry":"pcc_representation","repo":"haydenmct/predictive-equivalence","repo_kind":"official","path":"models/pcc.py","file_url":"https://github.com/haydenmct/predictive-equivalence/blob/HEAD/models/pcc.py","link_basis":"first_harvest_node","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":"276342bb0ec1d263"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}