mlsanityData to 14 Oct 2026

Multivariate Probabilistic Regression with Natural Gradient Boosting

arXiv 2106.03823 ↗First posted 7 Jun 2021stat.ML cs.LG stat.COcited by 5

Not on the map. Why?

Abstract (arXiv)

Many single-target regression problems require estimates of uncertainty along with the point predictions. Probabilistic regression algorithms are well-suited for these tasks. However, the options are much more limited when the prediction target is multivariate and a joint measure of uncertainty is required. For example, in predicting a 2D velocity vector a joint uncertainty would quantify the probability of any vector in the plane, which would be more expressive than two separate uncertainties on the x- and y- components. To enable joint probabilistic regression, we propose a Natural Gradient Boosting (NGBoost) approach based on nonparametrically modeling the conditional parameters of the multivariate predictive distribution. Our method is robust, works out-of-the-box without extensive tuning, is modular with respect to the assumed target distribution, and performs competitively in comparison to existing approaches. We demonstrate these claims in simulation and with a case study predicting two-dimensional oceanographic velocity data. An implementation of our method is available at https://github.com/stanfordmlgroup/ngboost.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 5 of its 25 references that are in the map. First posted on arXiv 7 Jun 2021.

Builds on

5 of 25 references.

References · 5

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2018Neural networks for post-processing ensemble weather forecastscited by 95
  3. 2019NGBoost: Natural Gradient Boosting for Probabilistic Predictioncited by 94
  4. 2018Natural Gradients in Practice: Non-Conjugate Variational Inference in Gaussian Process Modelscited by 38
  5. 2019Deep Distribution Regressioncited by 16

Built on by

Cited by year

Citing papers per year: 2022: 3; 2023: 0; 2024: 0; 2025: 2.

5 papers.