Papers › GRANDE: Gradient-Based Decision Tree Ensembles for Tabular Data

GRANDE: Gradient-Based Decision Tree Ensembles for Tabular Data

29 Sep 2023arXiv:2309.17130archive 2025-07-28

Sascha Marton, Stefan Lüdtke, Christian Bartelt, Heiner Stuckenschmidt

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 GRANDE, GRAdieNt-Based Decision Tree Ensembles, 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

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2309.17130")

Code

Syntology Ran 7 of 12 code samples harvested from 2 repositories linked to this paper; 5 have no recorded run. Of those that ran: 1 ran · our draft was wrong; 6 ran with no contract checked.

By repository: official repository: 3 samples from 1 repository, 1 ran; community (archive-listed): 9 samples from 1 repository, 6 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

s-marton/grande officialmentioned in papermentioned on GitHubpytorch report
s-marton/gradientbaseddecisiontrees mentioned on GitHubtfMIT report
s-marton/gradtree mentioned on GitHubtfMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

12 samples harvested; 7 ran; 0 honoured the contract we drafted; 5 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · our draft was wrong
6ran
5unverified

Licence: 0 of the 12 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: 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. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

embed_data s-marton/grande/GRANDE/GRANDE.py official repository ran · our draft was wrong MIT (permissive) · 72f1542c18d5bf8e · report
evaluate s-marton/grande/GRANDE/GRANDE.py official repository unverified MIT (permissive) · e82568961456e67f · report
evaluate_regression s-marton/grande/GRANDE/GRANDE.py official repository unverified MIT (permissive) · 5194732dbb0292ff · report
entmax15 s-marton/gradtree/GradTree/GradTree.py community (archive-listed) ran MIT (permissive) · 1ea888d2a2b1221d · report
flatten_dict s-marton/gradtree/experiments_paper_gradtree/utilities/utilities_GDT.py community (archive-listed) ran MIT (permissive) · 5cd213cdf1030eee · report
gather_over_axis s-marton/gradtree/GradTree/GradTree.py community (archive-listed) ran MIT (permissive) · 8336c9e8ba6d9dd4 · report
mergeDict s-marton/gradtree/experiments_paper_gradtree/utilities/utilities_GDT.py community (archive-listed) ran MIT (permissive) · d229e72a357706bf · report
my_gather_nd s-marton/gradtree/experiments_paper_gradtree/utilities/GDT.py community (archive-listed) ran MIT (permissive) · c8115ab39abe7f68 · report
top_k_over_axis s-marton/gradtree/GradTree/GradTree.py community (archive-listed) ran MIT (permissive) · b62cf67dc11a1f54 · report
flatten_list s-marton/gradtree/experiments_paper_gradtree/utilities/utilities_GDT.py community (archive-listed) unverified MIT (permissive) · aefc54c084793353 · report
sigmoid s-marton/gradtree/experiments_paper_gradtree/utilities/GDT.py community (archive-listed) unverified MIT (permissive) · 00ecfa2a9dd20434 · report
tanh s-marton/gradtree/experiments_paper_gradtree/utilities/GDT.py community (archive-listed) unverified MIT (permissive) · 8ee3af50bfaddadd · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Introduced by this paper: GRANDE

GRANDE

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections