Methods › General › Deep Tabular Learning › NODE

Neural Oblivious Decision Ensembles

NODE

42 papers tagged archive 2025-07-28

Introduced by Sergei Popov et al. in Neural Oblivious Decision Ensembles for Deep Learning on Tabular Data

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Neural Oblivious Decision Ensembles (NODE) is a tabular data architecture that consists of differentiable oblivious decision trees (ODT) that are trained end-to-end by backpropagation.

The core building block is a Neural Oblivious Decision Ensemble (NODE) layer. The layer is composed of m differentiable oblivious decision trees (ODTs) of equal depth d. As an input, all m trees get a common vector x ∈ℝⁿ, containing n numeric features. Below we describe a design of a single differentiable ODT.

In its essence, an ODT is a decision table that splits the data along d splitting features and compares each feature to a learned threshold. Then, the tree returns one of the 2ᵈ possible responses, corresponding to the comparisons result. Therefore, each ODT is completely determined by its splitting features f ∈ℝᵈ, splitting thresholds b ∈ℝᵈ and a d-dimensional tensor of responses R ∈ℝ 2 ×2 ×2_d. In this notation, the tree output is defined as:

h(x)=R[1(f₁(x)-b₁), …, 1(f_d(x)-b_d)] where 1(·) denotes the Heaviside function.

PaperSource

In Syntology about another paper, arXiv:2102.02248: repository known, no verified implementation (declared_code; repositories: 1 listed of 1 in the graph, strongest link: official). About another paper: this answer is about arXiv:2102.02248, while the archive credits arXiv:1909.06312.

Code Syntology holds under other names, as the lookup lists them (code_nearby); not a complete list, and none of them is this method.

Origin paper of this answer, arXiv:2102.02248 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 2 harvested samples) · 2 pointer-only (licence). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

What each level means, quoted from Syntology's server card: V0 “imports”; V1 “executes against a synthesized fixture and returns a value of the recorded type”; V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” The card adds: “No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.” A level quoted in two parts is one definition the card writes as two clauses joined by a double hyphen, each clause quoted on its own (how these levels are quoted).

Papers archive 2025-07-28

archive papers tagged: 42 · with a code link: 16 · where Syntology ran a sample: 5 (4 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (5 of 42 tagged: 4 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 42 of 42, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 43 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Time Series5
Image Classification4
image-classification4
Adversarial Robustness2
Autonomous Driving2
Computational Efficiency2
Deep Learning2
Density Estimation2
Model Selection2
Representation Learning2
Self-Supervised Learning2
Spatio-Temporal Forecasting2
Time Series Analysis2
Variational Inference2
BIG-bench Machine Learning1
Collaborative Filtering1
Continuous Control1
Data Augmentation1
Decision Making1
Denoising1

Usage over time archive 2025-07-28

Papers per year tagged with NODE: 2019 to 2025, peak 11 11 0 2019: 1 paper 2019 2020: 0 papers 2020 2021: 6 papers 2021 2022: 11 papers 2022 2023: 10 papers 2023 2024: 8 papers 2024 2025: 6 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (42 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Deep Tabular Learning

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