Papers › Neural Random Forests

Neural Random Forests

25 Apr 2016arXiv:1604.07143archive 2025-07-28

Gérard Biau, Erwan Scornet, Johannes Welbl

Given an ensemble of randomized regression trees, it is possible to restructure them as a collection of multilayered neural networks with particular connection weights. Following this principle, we reformulate the random forest method of Breiman (2001) into a neural network setting, and in turn propose two new hybrid procedures that we call neural random forests. Both predictors exploit prior knowledge of regression trees for their architecture, have less parameters to tune than standard networks, and less restrictions on the geometry of the decision boundaries than trees. Consistency results are proved, and substantial numerical evidence is provided on both synthetic and real data sets to assess the excellent performance of our methods in a large variety of prediction problems.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

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

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 15 code samples harvested from 2 repositories linked to this paper: 10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: community (archive-listed): 15 samples from 2 repositories, 10 ran (9 with no instrument failure; 1 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-26 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

JohannesMaxWel/neural_random_forests mentioned on GitHubtfSyntology: 2 samples, 1 ran (1 instrument-failed) · 1 unverified report
dhuynh95/cryptotree mentioned on GitHubpytorchApache-2.0Syntology: 13 samples, 9 ran (0 instrument-failed) · 4 unverified 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

15 samples harvested: 10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · our draft was wrong
9ran
5unverified

Licence: 2 of the 15 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; the list below is grouped by repository, each group headed by its name and what it is to the paper. “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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

JohannesMaxWel/neural_random_forests community (archive-listed) 2 samples, 1 ran (1 instrument-failed) · 1 unverified
split_data in 68 papers dataloader.py ran · our draft was wrong fingerprinted no licence file found · pointer only · 75b8158e943d040c · report fixture: signature X:ndarray/2/float, Y:ndarray/1/int, seed:int/0/int · returned tuple · level recorded 2026-09-22
load_data in 700 papers dataloader.py unverified no licence file found · pointer only · 1df04c3a3f2a1745 · report
dhuynh95/cryptotree community (archive-listed) 13 samples, 9 ran (0 instrument-failed) · 4 unverified
compute_leaves cryptotree/activations.py ran Apache-2.0 (permissive) · d73c97995a2c56c8 · report fixture: signature n_nodes:int/0/int, children_left:list/1/int, children_right:list/1/int · returned tuple · level recorded 2026-09-26
create_parent_of cryptotree/activations.py ran Apache-2.0 (permissive) · dac03d02b81c3b40 · report fixture: signature n_nodes:int/0/int, is_leaves:ndarray/1/bool, children_left:ndarray/1/int, children_right:ndarray/1/int, left_value:int/0/int, right_value:int/0/int · returned dict · level recorded 2026-09-26
extract_diagonals cryptotree/linear.py ran Apache-2.0 (permissive) · fd06bb6eff933360 · report fixture: signature matrix:ndarray/2/int · returned list · level recorded 2026-09-26
pad_along_axis in 6 papers cryptotree/linear.py ran fingerprinted Apache-2.0 (permissive) · 231c0df12681fba8 · report fixture: signature array:ndarray/2/float, target_length:int/0/int, axis:int/0/int · returned ndarray · level recorded 2026-09-26
pad_tensor in 27 papers cryptotree/tree.py ran fingerprinted Apache-2.0 (permissive) · 254afcaedc5de2a9 · report fixture: signature tensor:Tensor/2/float, target:int/0/int, dim:int/0/int, value:int/0/int · returned Tensor · level recorded 2026-09-26
plot_graph_function_approximation cryptotree/polynomials.py ran Apache-2.0 (permissive) · c72bffa93c2d2e9a · report fixture: signature f:callable/0/?, dilatation_factor:int/0/int, polynomial_degree:int/0/int, bound:int/0/int, convertToTensor:bool/0/bool · returned tuple · level recorded 2026-09-26
to_list_and_duplicate cryptotree/cryptotree.py ran fingerprinted Apache-2.0 (permissive) · 8f266d95629d3860 · report fixture: signature array:list/1/int · returned list · level recorded 2026-09-26
to_list_and_pad cryptotree/cryptotree.py ran fingerprinted Apache-2.0 (permissive) · 88efd816ad8e0c07 · report fixture: signature array:list/1/int · returned list · level recorded 2026-09-26
vrep cryptotree/seal_helper.py ran fingerprinted Apache-2.0 (permissive) · cebcc134f236462c · report fixture: signature x:list/1/int, n:int/0/int · returned list · level recorded 2026-09-26
chebyshev_approximation cryptotree/polynomials.py unverified Apache-2.0 (permissive) · 6b7f9a11ed22c570 · report
create_linear_node_comparator cryptotree/activations.py unverified Apache-2.0 (permissive) · 24733aa993117a45 · report
custom_doc_links in 10 papers cryptotree/_nbdev.py unverified Apache-2.0 (permissive) · c00f1d9594b0678a · report
polynomial_approximation_coefficients cryptotree/polynomials.py unverified Apache-2.0 (permissive) · d8493782f4a6908e · report

Tasks

regression

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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