{"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/born-again-tree-ensembles","title":"Born-Again Tree Ensembles","arxiv_id":"2003.11132","date":"2020-03-24","proceeding":"ICML 2020 1","authors":["Thibaut Vidal","Toni Pacheco","Maximilian Schiffer"],"abstract":"The use of machine learning algorithms in finance, medicine, and criminal justice can deeply impact human lives. As a consequence, research into interpretable machine learning has rapidly grown in an attempt to better control and fix possible sources of mistakes and biases. Tree ensembles offer a good prediction quality in various domains, but the concurrent use of multiple trees reduces the interpretability of the ensemble. Against this background, we study born-again tree ensembles, i.e., the process of constructing a single decision tree of minimum size that reproduces the exact same behavior as a given tree ensemble in its entire feature space. To find such a tree, we develop a dynamic-programming based algorithm that exploits sophisticated pruning and bounding rules to reduce the number of recursive calls. This algorithm generates optimal born-again trees for many datasets of practical interest, leading to classifiers which are typically simpler and more interpretable without any other form of compromise.","url_abs":"https://arxiv.org/abs/2003.11132v3","url_pdf":"https://arxiv.org/pdf/2003.11132v3.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":"born-again-tree-ensembles","repo_url":"https://github.com/vidalt/BA-Trees","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"interpretable-machine-learning","task_name":"Interpretable Machine Learning"}],"methods":[{"method_slug":"interpretability","method_name":"Interpretability"},{"method_slug":"pruning","method_name":"Pruning"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2003.11132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.11132"}},"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/vidalt/BA-Trees","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":4},"by_repo_kind":{"official":{"samples":4,"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":"4eaf4c6f3327f98a","entry":"compute_info_from_dataset","repo":"vidalt/BA-Trees","repo_kind":"official","path":"src/persistence.py","file_url":"https://github.com/vidalt/BA-Trees/blob/HEAD/src/persistence.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":"4eaf4c6f3327f98a"}},{"code_sha256_prefix":"4ec96334e24c80af","entry":"create_nodes","repo":"vidalt/BA-Trees","repo_kind":"official","path":"src/persistence.py","file_url":"https://github.com/vidalt/BA-Trees/blob/HEAD/src/persistence.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":"4ec96334e24c80af"}},{"code_sha256_prefix":"6ab0f9698e827fab","entry":"importTreeCollection","repo":"vidalt/BA-Trees","repo_kind":"official","path":"src/persistence.py","file_url":"https://github.com/vidalt/BA-Trees/blob/HEAD/src/persistence.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":"6ab0f9698e827fab"}},{"code_sha256_prefix":"46e2c2857115a244","entry":"to_dot_format","repo":"vidalt/BA-Trees","repo_kind":"official","path":"src/visualization.py","file_url":"https://github.com/vidalt/BA-Trees/blob/HEAD/src/visualization.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":"46e2c2857115a244"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}