Wednesday, November 4, 2026
HomeData ScienceProbabilistic Forecasting – Quantile Regression, Conformal Prediction, NGBoost and CRPS

Probabilistic Forecasting – Quantile Regression, Conformal Prediction, NGBoost and CRPS

Table of Content

📋 KEY INSIGHTS

  • Probabilistic forecasting produces a full predictive distribution over future values β€” not a single point estimate β€” enabling decision-makers to reason about forecast uncertainty, compute confidence intervals, and optimise decisions under risk. The key output formats are: quantile forecasts (the Ο„-th quantile q_Ο„ such that the true value falls below q_Ο„ with probability Ο„, e.g. P10/P50/P90), prediction intervals (a range [l, u] containing the true value with probability 1βˆ’Ξ±), and full predictive distributions (parametric, e.g. Gaussian/Student-t, or non-parametric, e.g. samples from a generative model). The choice of output format depends on the downstream decision: inventory safety stock uses P90/P95 quantiles; risk management uses full distribution tails; point-forecast consumers use P50.
  • Quantile regression directly minimises the pinball loss (also called quantile loss): L_Ο„(y, q) = Ο„(y βˆ’ q) if y β‰₯ q, (1βˆ’Ο„)(q βˆ’ y) if y < q. Unlike MSE minimisation (which gives the conditional mean), quantile regression at Ο„=0.5 gives the conditional median, and minimising pinball loss at Ο„ simultaneously across all quantiles gives the full conditional quantile function. Any regression model can be adapted for quantile regression by replacing the MSE loss with pinball loss β€” gradient boosting (LightGBM, XGBoost with quantile objective), neural networks (multi-output quantile heads), and linear regression (quantile regression via linear programming).
  • Conformal prediction provides distribution-free, finite-sample coverage guarantees for prediction intervals without parametric assumptions about the data distribution. Split conformal prediction: (1) fit a base model on a training set; (2) compute non-conformity scores (e.g. absolute residuals |y_i βˆ’ Ε·_i|) on a held-out calibration set; (3) at test time, set the interval width to the (1βˆ’Ξ±) empirical quantile of calibration residuals. This guarantees marginal coverage: P(y_test ∈ interval) β‰₯ 1βˆ’Ξ±, regardless of the data distribution or model quality β€” a provably valid interval that works with any black-box model.
  • NGBoost (Natural Gradient Boosting, Duan et al., 2020) extends gradient boosting to probabilistic prediction by modelling the full conditional distribution: instead of boosting a single point estimate, NGBoost uses natural gradient descent to boost the parameters of a parametric distribution (Gaussian, log-normal, etc.), fitting K separate gradient-boosted trees for K distribution parameters (mean, variance). The natural gradient β€” the gradient of the log-likelihood scaled by the Fisher information matrix β€” accounts for the geometry of the distribution parameter space, achieving better calibration and coverage than naive boosting of distributional parameters with ordinary gradients.
  • Forecast calibration measures whether a probabilistic forecast’s stated confidence matches its empirical accuracy: a well-calibrated forecaster’s P80 prediction intervals should contain the true value 80% of the time. The Probability Integral Transform (PIT) histogram is the standard calibration diagnostic: for each observation, compute the CDF of the predictive distribution at the true value β€” if the forecast is calibrated, PIT values are uniformly distributed on [0,1]. Deviations from uniformity indicate over-dispersion (intervals too wide), under-dispersion (intervals too narrow), or systematic bias (mean offset). The Continuous Ranked Probability Score (CRPS) is the standard proper scoring rule for evaluating probabilistic forecasts: CRPS(F, y) = E_F[|Xβˆ’y|] βˆ’ 0.5 E_F[|Xβˆ’X’|], where X, X’ are independent draws from the forecast distribution F β€” proper because it rewards calibrated, sharp distributions.
  • Hierarchical probabilistic forecasting reconciles probabilistic forecasts at different levels of a hierarchy (total β†’ region β†’ product β†’ SKU) so that probabilistic summaries are coherent: quantiles at the aggregate level should be consistent with the distribution of the sum of the disaggregate forecasts. MinT (Minimum Trace) reconciliation for point forecasts extends to probabilistic reconciliation by transforming the full covariance structure of forecast errors across hierarchy levels. The connection to our time series forecasting guides is direct: hierarchical reconciliation is a standard postprocessing step that improves both accuracy and consistency of probabilistic forecasts produced by any base forecasting model.

Point forecasts β€” single-number predictions of future values β€” are systematically misleading for high-stakes decisions under uncertainty: an inventory manager who orders to the mean demand forecast will stockout 50% of the time (since the mean falls at the 50th percentile of demand), and a financial planner who uses a point estimate for future returns cannot assess downside risk. Probabilistic forecasting addresses this by estimating the full predictive distribution of future values, enabling decisions that explicitly account for uncertainty. This guide covers the full toolkit for probabilistic forecasting in production: quantile regression with pinball loss, conformal prediction for model-free coverage guarantees, Bayesian forecasting with Prophet and pyro, NGBoost for probabilistic gradient boosting, deep learning probabilistic models (DeepAR, Temporal Fusion Transformer), forecast calibration with CRPS and PIT diagnostics, and hierarchical probabilistic reconciliation.

Quantile Regression and Pinball Loss

Quantile regression is the most widely deployed probabilistic forecasting method in industry because it integrates seamlessly with any tabular ML pipeline: replace the MSE loss with the pinball (quantile) loss, and any model that minimises a differentiable or approximable loss function produces calibrated quantile estimates. The pinball loss at quantile Ο„ for a single observation: L_Ο„(y, q_Ο„) = max(Ο„(y βˆ’ q_Ο„), (Ο„βˆ’1)(y βˆ’ q_Ο„)) = τ·max(yβˆ’q_Ο„, 0) + (1βˆ’Ο„)Β·max(q_Ο„βˆ’y, 0). This asymmetric loss penalises over-prediction (q_Ο„ > y) by factor (1βˆ’Ο„) and under-prediction (q_Ο„ < y) by factor Ο„: at Ο„=0.9 the loss for under-prediction is 9Γ— the loss for over-prediction, incentivising the model to find q such that 90% of training observations fall below q. LightGBM and XGBoost implement quantile regression natively via the objective=’quantile’ parameter with alpha=Ο„; training K separate models (one per quantile) produces K quantile forecasts for P10/P50/P90 or any desired quantile set. The connection to our gradient boosting guide is direct: quantile LightGBM is the standard industry approach for P10/P50/P90 demand forecasting because it achieves state-of-the-art tabular accuracy while producing calibrated quantile intervals at negligible additional training cost. The connection to our time series deep learning guide is direct: Temporal Fusion Transformer (TFT) produces quantile forecasts at all horizons simultaneously by using multi-quantile output heads with joint pinball loss optimisation.

MethodOutputCoverage GuaranteeWorks WithBest For
Quantile regression (pinball loss)Quantiles q_Ο„Asymptotic, model-dependentLightGBM, XGBoost, NNsDemand forecasting; tabular data
Conformal predictionPrediction intervalsFinite-sample, distribution-freeAny black-box modelGuaranteed coverage; compliance
NGBoostFull parametric distributionAsymptotic, model-dependentGradient boostingRisk quantification; calibrated probabilities
DeepAR (Amazon)Samples from learned distributionAsymptoticRNN/Transformer decoderLarge-scale hierarchical forecasting
Gaussian ProcessesPosterior distributionExact (Gaussian likelihood)GP regressionSmall data; known covariance structure

Conformal Prediction for Distribution-Free Coverage Guarantees

Metallic sphere warps grid representing spacetime curvature
Photo by Brecht Corbeel on Unsplash

Conformal prediction (Vovk et al., 2005; Angelopoulos & Bates, 2022) provides the strongest theoretical guarantee of any interval forecasting method: finite-sample marginal coverage without any assumptions about the data distribution, model family, or model accuracy. Split conformal prediction for regression: partition data into train (80%), calibration (10%), and test (10%) sets. Train any regression model on the training set. On the calibration set, compute non-conformity scores Ξ±_i = |y_i βˆ’ Ε·_i| (absolute residuals). At test time, construct the prediction interval ΕΆ Β± qΜ‚_{1βˆ’Ξ±} where qΜ‚_{1βˆ’Ξ±} is the ⌈(1βˆ’Ξ±)(n+1)/nβŒ‰-th smallest value among the n calibration non-conformity scores. This interval satisfies P(y_test ∈ [Ε·_test βˆ’ qΜ‚, Ε·_test + qΜ‚]) β‰₯ 1βˆ’Ξ± for any Ξ± ∈ (0,1), regardless of how the base model was trained, what distribution the data follows, or how large n is β€” the only assumption is exchangeability (the calibration and test points are drawn from the same distribution). The connection to our conformal prediction guide is direct: that guide covers conformal prediction in full depth including conditional coverage, covariate shift, and conformalised quantile regression (CQR), which adapts interval width based on local difficulty. The connection to our Bayesian Deep Learning guide is direct: conformal prediction and Bayesian uncertainty quantification are complementary β€” Bayesian methods produce calibrated uncertainty without held-out calibration data but require correct model specification, while conformal prediction is model-agnostic but requires a calibration set.

NGBoost, DeepAR and Forecast Calibration

NGBoost (Natural Gradient Boosting) produces fully probabilistic predictions by gradient-boosting the parameters of a parametric distribution. For a Gaussian output distribution with parameters (ΞΌ, σ²), NGBoost maintains two gradient-boosted tree ensembles β€” one predicting ΞΌ and one predicting log Οƒ β€” and updates both simultaneously using the natural gradient of the log-likelihood. The natural gradient F^{-1}βˆ‡_ΞΈ log p(y|ΞΈ) accounts for the Fisher information matrix F of the distribution, ensuring that parameter updates of equal magnitude in the natural gradient space correspond to equal changes in the predictive distribution (invariant to parametrisation). This produces significantly better-calibrated variance estimates than simply training a second model to predict squared residuals. The connection to our Gaussian Processes guide is direct: Gaussian Processes are the Bayesian non-parametric alternative to NGBoost for probabilistic regression β€” GPs provide exact posterior distributions under Gaussian likelihood and known covariance structure, while NGBoost uses parametric distributions but scales to large datasets where GP inference becomes intractable. Forecast calibration measurement is essential before deploying any probabilistic model in production. The CRPS (Continuous Ranked Probability Score) is the standard proper scoring rule: it rewards sharpness (narrow intervals) while penalising miscalibration. CRPS decomposes into reliability (calibration) and resolution (sharpness) components, allowing diagnosis of whether a poor CRPS score is due to bias, over-dispersion, under-dispersion, or poor mean accuracy. The PIT (Probability Integral Transform) histogram provides a visual calibration diagnostic: plot the histogram of F(y_i) where F is the predictive CDF at each observation β€” a uniform PIT histogram confirms calibration; a U-shaped histogram indicates under-dispersion; a hump-shaped histogram indicates over-dispersion. The connection to our time series deep learning guide is direct: DeepAR, N-BEATS+ (probabilistic), and Temporal Fusion Transformer are the dominant deep learning probabilistic forecasters for time series β€” DeepAR uses an autoregressive RNN decoder to generate samples from the conditional distribution, evaluated by CRPS on held-out windows.

✦ SUMMARIZE THIS ARTICLE WITH AI

Time series deep learning models (TFT, DeepAR, N-BEATS) for probabilistic forecasting are in our Time Series Deep Learning guide. Conformal prediction theory and conditional coverage are in our Conformal Prediction guide. Bayesian methods including Gaussian Processes for probabilistic regression are in our Gaussian Processes guide. Gradient boosting (LightGBM, XGBoost) for quantile regression is in our Gradient Boosting guide. Time series analysis (ARIMA, Prophet, LSTM) with uncertainty intervals is in our Time Series Analysis guide. Bayesian deep learning (MC Dropout, Deep Ensembles, SWAG) for predictive uncertainty is in our Bayesian Deep Learning guide.

Leave feedback about this

  • Rating

Durgesh Kekare
Durgesh Kekarehttps://www.dataexpertise.in
Durgesh Kekare is a data science educator and founder of DataExpertise.in. With expertise in Python, machine learning, and analytics, he helps 10,000+ learners break into data careers.

Latest Posts

List of Categories