{"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/maptree-beating-optimal-decision-trees-with","title":"MAPTree: Beating \"Optimal\" Decision Trees with Bayesian Decision Trees","arxiv_id":"2309.15312","date":"2023-09-26","proceeding":null,"authors":["Colin Sullivan","Mo Tiwari","Sebastian Thrun"],"abstract":"Decision trees remain one of the most popular machine learning models today, largely due to their out-of-the-box performance and interpretability. In this work, we present a Bayesian approach to decision tree induction via maximum a posteriori inference of a posterior distribution over trees. We first demonstrate a connection between maximum a posteriori inference of decision trees and AND/OR search. Using this connection, we propose an AND/OR search algorithm, dubbed MAPTree, which is able to recover the maximum a posteriori tree. Lastly, we demonstrate the empirical performance of the maximum a posteriori tree both on synthetic data and in real world settings. On 16 real world datasets, MAPTree either outperforms baselines or demonstrates comparable performance but with much smaller trees. On a synthetic dataset, MAPTree also demonstrates greater robustness to noise and better generalization than existing approaches. Finally, MAPTree recovers the maxiumum a posteriori tree faster than existing sampling approaches and, in contrast with those algorithms, is able to provide a certificate of optimality. The code for our experiments is available at https://github.com/ThrunGroup/maptree.","url_abs":"https://arxiv.org/abs/2309.15312v3","url_pdf":"https://arxiv.org/pdf/2309.15312v3.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":"maptree-beating-optimal-decision-trees-with","repo_url":"https://github.com/thrungroup/maptree","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2309.15312","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.15312"}},"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/thrungroup/maptree","reach":{"status":"ok"}}],"summary":{"ran_honours":3,"ran":1},"by_repo_kind":{"official":{"samples":4,"ran":4,"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":4,"samples":[{"code_sha256_prefix":"9ec31dfbe9fa01e9","entry":"get_num_valid_splits","repo":"thrungroup/maptree","repo_kind":"official","path":"experiments/searchers/binary_classification_tree.py","file_url":"https://github.com/thrungroup/maptree/blob/HEAD/experiments/searchers/binary_classification_tree.py","link_basis":"plan_row","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"9ec31dfbe9fa01e9"}},{"code_sha256_prefix":"ee4d7df60586ee29","entry":"log_prob_split","repo":"thrungroup/maptree","repo_kind":"official","path":"experiments/searchers/binary_classification_tree.py","file_url":"https://github.com/thrungroup/maptree/blob/HEAD/experiments/searchers/binary_classification_tree.py","link_basis":"plan_row","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"ee4d7df60586ee29"}},{"code_sha256_prefix":"bec01134474047f2","entry":"log_prob_stop","repo":"thrungroup/maptree","repo_kind":"official","path":"experiments/searchers/binary_classification_tree.py","file_url":"https://github.com/thrungroup/maptree/blob/HEAD/experiments/searchers/binary_classification_tree.py","link_basis":"plan_row","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"bec01134474047f2"}},{"code_sha256_prefix":"9291ac973e58f7b7","entry":"search_target_decorator","repo":"thrungroup/maptree","repo_kind":"official","path":"experiments/globals.py","file_url":"https://github.com/thrungroup/maptree/blob/HEAD/experiments/globals.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"9291ac973e58f7b7"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}