{"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/grande-gradient-based-decision-tree-ensembles","title":"GRANDE: Gradient-Based Decision Tree Ensembles for Tabular Data","arxiv_id":"2309.17130","date":"2023-09-29","proceeding":null,"authors":["Sascha Marton","Stefan Lüdtke","Christian Bartelt","Heiner Stuckenschmidt"],"abstract":"Despite the success of deep learning for text and image data, tree-based ensemble models are still state-of-the-art for machine learning with heterogeneous tabular data. However, there is a significant need for tabular-specific gradient-based methods due to their high flexibility. In this paper, we propose $\\text{GRANDE}$, $\\text{GRA}$die$\\text{N}$t-Based $\\text{D}$ecision Tree $\\text{E}$nsembles, a novel approach for learning hard, axis-aligned decision tree ensembles using end-to-end gradient descent. GRANDE is based on a dense representation of tree ensembles, which affords to use backpropagation with a straight-through operator to jointly optimize all model parameters. Our method combines axis-aligned splits, which is a useful inductive bias for tabular data, with the flexibility of gradient-based optimization. Furthermore, we introduce an advanced instance-wise weighting that facilitates learning representations for both, simple and complex relations, within a single model. We conducted an extensive evaluation on a predefined benchmark with 19 classification datasets and demonstrate that our method outperforms existing gradient-boosting and deep learning frameworks on most datasets. The method is available under: https://github.com/s-marton/GRANDE","url_abs":"https://arxiv.org/abs/2309.17130v3","url_pdf":"https://arxiv.org/pdf/2309.17130v3.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":"grande-gradient-based-decision-tree-ensembles","repo_url":"https://github.com/s-marton/grande","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"grande-gradient-based-decision-tree-ensembles","repo_url":"https://github.com/s-marton/gradientbaseddecisiontrees","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"grande-gradient-based-decision-tree-ensembles","repo_url":"https://github.com/s-marton/gradtree","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[{"method_slug":"grande","method_name":"GRANDE"}],"datasets_introduced":[],"methods_introduced":[{"slug":"grande","name":"GRANDE","full_name":"Gradient-Based Decision Tree Ensembles"}],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2309.17130","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.17130"}},"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/s-marton/gradtree","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/s-marton/gradientbaseddecisiontrees","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/s-marton/grande","reach":null}],"summary":{"ran_draft_wrong":1,"ran":6,"unverified":5},"by_repo_kind":{"official":{"samples":3,"ran":1,"repositories":1},"listed":{"samples":9,"ran":6,"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":"72f1542c18d5bf8e","entry":"embed_data","repo":"s-marton/grande","repo_kind":"official","path":"GRANDE/GRANDE.py","file_url":"https://github.com/s-marton/grande/blob/HEAD/GRANDE/GRANDE.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"72f1542c18d5bf8e"}},{"code_sha256_prefix":"1ea888d2a2b1221d","entry":"entmax15","repo":"s-marton/gradtree","repo_kind":"listed","path":"GradTree/GradTree.py","file_url":"https://github.com/s-marton/gradtree/blob/HEAD/GradTree/GradTree.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":"1ea888d2a2b1221d"}},{"code_sha256_prefix":"5cd213cdf1030eee","entry":"flatten_dict","repo":"s-marton/gradtree","repo_kind":"listed","path":"experiments_paper_gradtree/utilities/utilities_GDT.py","file_url":"https://github.com/s-marton/gradtree/blob/HEAD/experiments_paper_gradtree/utilities/utilities_GDT.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":"5cd213cdf1030eee"}},{"code_sha256_prefix":"8336c9e8ba6d9dd4","entry":"gather_over_axis","repo":"s-marton/gradtree","repo_kind":"listed","path":"GradTree/GradTree.py","file_url":"https://github.com/s-marton/gradtree/blob/HEAD/GradTree/GradTree.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":"8336c9e8ba6d9dd4"}},{"code_sha256_prefix":"d229e72a357706bf","entry":"mergeDict","repo":"s-marton/gradtree","repo_kind":"listed","path":"experiments_paper_gradtree/utilities/utilities_GDT.py","file_url":"https://github.com/s-marton/gradtree/blob/HEAD/experiments_paper_gradtree/utilities/utilities_GDT.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":"d229e72a357706bf"}},{"code_sha256_prefix":"c8115ab39abe7f68","entry":"my_gather_nd","repo":"s-marton/gradtree","repo_kind":"listed","path":"experiments_paper_gradtree/utilities/GDT.py","file_url":"https://github.com/s-marton/gradtree/blob/HEAD/experiments_paper_gradtree/utilities/GDT.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":"c8115ab39abe7f68"}},{"code_sha256_prefix":"b62cf67dc11a1f54","entry":"top_k_over_axis","repo":"s-marton/gradtree","repo_kind":"listed","path":"GradTree/GradTree.py","file_url":"https://github.com/s-marton/gradtree/blob/HEAD/GradTree/GradTree.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":"b62cf67dc11a1f54"}},{"code_sha256_prefix":"e82568961456e67f","entry":"evaluate","repo":"s-marton/grande","repo_kind":"official","path":"GRANDE/GRANDE.py","file_url":"https://github.com/s-marton/grande/blob/HEAD/GRANDE/GRANDE.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":"e82568961456e67f"}},{"code_sha256_prefix":"5194732dbb0292ff","entry":"evaluate_regression","repo":"s-marton/grande","repo_kind":"official","path":"GRANDE/GRANDE.py","file_url":"https://github.com/s-marton/grande/blob/HEAD/GRANDE/GRANDE.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":"5194732dbb0292ff"}},{"code_sha256_prefix":"aefc54c084793353","entry":"flatten_list","repo":"s-marton/gradtree","repo_kind":"listed","path":"experiments_paper_gradtree/utilities/utilities_GDT.py","file_url":"https://github.com/s-marton/gradtree/blob/HEAD/experiments_paper_gradtree/utilities/utilities_GDT.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":"aefc54c084793353"}},{"code_sha256_prefix":"00ecfa2a9dd20434","entry":"sigmoid","repo":"s-marton/gradtree","repo_kind":"listed","path":"experiments_paper_gradtree/utilities/GDT.py","file_url":"https://github.com/s-marton/gradtree/blob/HEAD/experiments_paper_gradtree/utilities/GDT.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":"00ecfa2a9dd20434"}},{"code_sha256_prefix":"8ee3af50bfaddadd","entry":"tanh","repo":"s-marton/gradtree","repo_kind":"listed","path":"experiments_paper_gradtree/utilities/GDT.py","file_url":"https://github.com/s-marton/gradtree/blob/HEAD/experiments_paper_gradtree/utilities/GDT.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":"8ee3af50bfaddadd"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}