SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 1909.04373 · 2019

GBDT-MO: Gradient Boosted Decision Trees for Multiple Outputs

arXiv · PDF · Open in the Atlas

Code that ran

1 of 5 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure of our instrument; 4 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/1909.04373.json · badge: /api/ran/1909.04373.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
zzd1992/GBDTMO canonical (classifier label)
classifier basis: census
1 ran · 4 no recorded run
FunctionStatusWhere it lives
map_bin_column Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
zzd1992/GBDTMO/gbdtmo/histogram.py
code served (permissive licence) · get_code("8ee82463b6ec6dec")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned ndarray, ndim 1, dtype family int, shape (6,) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import numpy as np

# Create sample data for x parameter
x = np.array([0.5, 1.2, 2.3, 3.1, 4.7, 5.9])

# Create sample bins parameter
bins = np.array([1.0, 2.0, 3.0, 4.0, 5.0])

ARGS = {
    'x': x,
    'bins': bins
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
numpy — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type ndarray, ndim 1, dtype family int, shape (6,) — shape (6,) as a later run recorded it
dtype family
int means an integer dtype; float means any other dtype the instrument saw, bool and complex included (fixture_check.py records only these two families)
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
construct_bin_column Not yet run
unverified (harvested, no recorded run)
zzd1992/GBDTMO/gbdtmo/histogram.py
code served (permissive licence) · get_code("f41d658394d54c33")
How it ran

no invocation recorded.

create_graph Not yet run
unverified (harvested, no recorded run)
zzd1992/GBDTMO/gbdtmo/plotting.py
code served (permissive licence) · get_code("305159c8b01940d0")
How it ran

no invocation recorded.

get_bins_maps Not yet run
unverified (harvested, no recorded run)
zzd1992/GBDTMO/gbdtmo/histogram.py
code served (permissive licence) · get_code("0cf3230edaa62165")
How it ran

no invocation recorded.

load_lib Not yet run
unverified (harvested, no recorded run)
zzd1992/GBDTMO/gbdtmo/lib_utils.py
code served (permissive licence) · get_code("4b7c4c6f7c977e1a")
How it ran

no invocation recorded.

Also present in other papers' code

Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 2 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 2 later) and 3 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
get_bins_maps 1 other paper
1 later
2211.12858 (2022-11)
SketchBoost: Fast Gradient Boosted Decision Tree for Multioutput Problems
map_bin_column 1 other paper
1 later
2211.12858 (2022-11)
SketchBoost: Fast Gradient Boosted Decision Tree for Multioutput Problems

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Gradient boosted decision trees (GBDTs) are widely used in machine learning, and the output of current GBDT implementations is a single variable. When there are multiple outputs, GBDT constructs multiple trees corresponding to the output variables. The correlations between variables are ignored by such a strategy causing redundancy of the learned tree structures. In this paper, we propose a general method to learn GBDT for multiple outputs, called GBDT-MO. Each leaf of GBDT-MO constructs predictions of all variables or a subset of automatically selected variables. This is achieved by considering the summation of objective gains over all output variables. Moreover, we extend histogram approximation into multiple output case to speed up the training process. Various experiments on synthetic and real-world datasets verify that GBDT-MO achieves outstanding performance in terms of both accuracy and training speed. Our codes are available on-line.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("1909.04373")
get_code_for_paper("1909.04373")
have("1909.04373")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/1909.04373.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/1909.04373.svg)](https://syntology.ai/paper/1909.04373)

Connect an agent — have() is free.