Pith. sign in

REVIEW 1 cited by

Distributional Gradient Boosting Machines

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2204.00778 v1 pith:XKUARUDG submitted 2022-04-02 stat.ML cs.LG

Distributional Gradient Boosting Machines

classification stat.ML cs.LG
keywords conditionaldistributionboostingframeworkgradientallowsentirefunction
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We present a unified probabilistic gradient boosting framework for regression tasks that models and predicts the entire conditional distribution of a univariate response variable as a function of covariates. Our likelihood-based approach allows us to either model all conditional moments of a parametric distribution, or to approximate the conditional cumulative distribution function via Normalizing Flows. As underlying computational backbones, our framework is based on XGBoost and LightGBM. Modelling and predicting the entire conditional distribution greatly enhances existing tree-based gradient boosting implementations, as it allows to create probabilistic forecasts from which prediction intervals and quantiles of interest can be derived. Empirical results show that our framework achieves state-of-the-art forecast accuracy.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Parallel gradient boosting for flexible estimation of conditional distributions

    stat.ML 2026-07 conditional novelty 6.0

    A modified gradient-boosting algorithm trains one univariate weak learner per iteration for all output targets, giving similar accuracy to XGBoost for multiple quantile regression while cutting runtime by up to roughly 50x.