Pith. sign in

REVIEW 2 cited by

NGBoost: Natural Gradient Boosting for Probabilistic Prediction

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 1910.03225 v4 pith:TUNMLU77 submitted 2019-10-08 cs.LG stat.ML

classification cs.LGstat.ML
keywords boostingngboostgradientprobabilisticconditionalnaturalpredictionregression
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present Natural Gradient Boosting (NGBoost), an algorithm for generic probabilistic prediction via gradient boosting. Typical regression models return a point estimate, conditional on covariates, but probabilistic regression models output a full probability distribution over the outcome space, conditional on the covariates. This allows for predictive uncertainty estimation -- crucial in applications like healthcare and weather forecasting. NGBoost generalizes gradient boosting to probabilistic regression by treating the parameters of the conditional distribution as targets for a multiparameter boosting algorithm. Furthermore, we show how the Natural Gradient is required to correct the training dynamics of our multiparameter boosting approach. NGBoost can be used with any base learner, any family of distributions with continuous parameters, and any scoring rule. NGBoost matches or exceeds the performance of existing methods for probabilistic prediction while offering additional benefits in flexibility, scalability, and usability. An open-source implementation is available at github.com/stanfordmlgroup/ngboost.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Frugal Bayesian Optimization: Scalable Surrogates for Data- and Resource-Limited Discovery

    cs.LG 2026-07 conditional novelty 5.0 of 10

    Across 17 benchmark and real-world tasks, non-GP surrogates (RF, NGBoost, BASS) match or beat Gaussian-process BO while using a fraction of the compute and memory, and a cheap-feature classifier can predict the best s...

  2. Comparative Analysis of Global and Local Probabilistic Time Series Forecasting for Contiguous Spatial Demand Regions

    stat.AP 2025-09 conditional novelty 5.0 of 10

    A global LightGBM with a station-ID feature generally beats cluster-level and per-station models for probabilistic hourly bike-share demand forecasting.

Pith tools