Inferensys

Glossary

Forecast Reconciliation

The mathematical process of aligning and making consistent the statistical forecasts generated independently at different hierarchical levels to ensure that the sum of bottom-up item forecasts equals the top-down category forecast.
Stylish WeWork-like workspace with hot desks and document wall, professional searching through enterprise knowledge base on a mounted ultrawide display, warm industrial pendants overhead.
HIERARCHICAL ALIGNMENT

What is Forecast Reconciliation?

The mathematical process of enforcing consistency across independently generated statistical forecasts at different aggregation levels of a product hierarchy.

Forecast reconciliation is the algorithmic process of adjusting independently generated statistical forecasts across a hierarchical structure—such as product, location, and time dimensions—so that they are mathematically coherent. The core constraint is that the sum of bottom-level item forecasts must exactly equal the forecast for the aggregate category, eliminating the inherent numerical inconsistency that arises when forecasts are generated in isolation at each node.

This is typically achieved through optimal reconciliation methods, such as the MinT (Minimum Trace) estimator, which uses the covariance structure of forecast errors to distribute adjustments proportionally across the hierarchy. By leveraging generalized least squares regression, reconciliation ensures that the final coherent forecasts minimize information loss and preserve the signal accuracy of the base forecasts generated by the underlying statistical or machine learning models.

HIERARCHICAL ALIGNMENT

Key Reconciliation Methods

The core mathematical approaches used to enforce consistency between independently generated statistical forecasts at different levels of a supply chain hierarchy.

01

Top-Down Reconciliation

A hierarchical approach where a high-level aggregate forecast is generated first and then disaggregated or allocated down to lower-level nodes based on historical proportions.

  • Process: Forecast total category demand, then distribute to individual SKUs based on their average sales mix.
  • Strength: Produces highly stable aggregate numbers and is simple to compute.
  • Weakness: Ignores distinct demand patterns and volatility at the granular item level, potentially masking localized stockout risks.
  • Example: A national sales forecast of 10,000 units is split to regional warehouses purely by their 12-month average contribution percentage.
Aggregate Stability
Primary Advantage
02

Bottom-Up Reconciliation

A granular methodology where statistical forecasts are generated independently at the most detailed level and then summed upward to produce higher-level forecasts.

  • Process: Forecast each SKU at each location separately, then aggregate to regional and national totals.
  • Strength: Captures unique demand signals, seasonality, and volatility at the execution level where inventory decisions are made.
  • Weakness: Individual forecast errors compound during summation, often leading to a less accurate aggregate forecast without correction.
  • Example: A machine learning model predicts daily sales for every individual store-SKU combination, and the corporate financial plan is the sum of these predictions.
Granular Precision
Primary Advantage
03

Middle-Out Reconciliation

A hybrid strategy that selects an intermediate level of the hierarchy as the anchor point. Forecasts are generated at this middle tier, then summed up to the top and allocated down to the bottom.

  • Process: Generate forecasts at the product category or regional level, aggregate for the CEO-level view, and prorate down to the SKU level.
  • Strength: Balances the stability of top-down with the detail of bottom-up, often capturing the 'sweet spot' of forecastability.
  • Weakness: The accuracy is highly dependent on selecting the correct middle level; a poor choice inherits the flaws of both other methods.
  • Example: Forecasting at the 'Product Family per Distribution Center' level, then pushing those numbers up to the national level and down to individual stores.
Hybrid Accuracy
Primary Advantage
04

Optimal Reconciliation (MinT)

A statistical regression approach that optimally combines all base forecasts to produce a coherent set that minimizes total forecast variance. The Minimum Trace (MinT) estimator weights forecasts based on the covariance of historical errors.

  • Process: Calculate the full hierarchy's base forecasts, then multiply by a mapping matrix that minimizes the sum of forecast error variances.
  • Strength: Mathematically proven to produce the most accurate reconciled forecasts by leveraging information from every node.
  • Weakness: Requires estimating a large covariance matrix, which can be computationally intensive for massive hierarchies with thousands of nodes.
  • Example: Using the hts package in R or scikit-hts in Python to apply the MinT shrinkage estimator to a retail hierarchy with 5,000 SKU-location combinations.
MinT Shrinkage
Gold Standard Method
05

Proportional Distribution (ProRata)

A simple, deterministic reconciliation method that forces alignment by distributing the difference between the top-down and bottom-up forecasts based on a fixed proportion of historical volume.

  • Process: Calculate the gap between the aggregate forecast and the sum of the bottom-level forecasts, then allocate this gap to each bottom node based on its historical demand share.
  • Strength: Extremely fast, transparent, and easy to explain to non-technical stakeholders.
  • Weakness: Assumes a static relationship between nodes, ignoring changes in trends or volatility, which can distort the final forecast if a product's mix is shifting.
  • Example: A financial controller adjusts the bottom-up sales pipeline forecast to match the quarterly revenue target by spreading the $2M gap across product lines based on last quarter's revenue split.
O(1) Complexity
Computational Speed
06

Game-Theoretic Reconciliation

An advanced approach that treats each node in the hierarchy as a rational agent with its own local forecast. Reconciliation is achieved through a cooperative game where nodes negotiate to reach a consensus forecast.

  • Process: Apply Shapley value attribution to determine the contribution of each node's local forecast to the final coherent forecast.
  • Strength: Provides a mathematically fair allocation of the reconciliation adjustment, giving more weight to nodes with historically higher accuracy.
  • Weakness: Computationally expensive and complex to implement, typically reserved for high-value, low-volume planning scenarios.
  • Example: A pharmaceutical supply chain uses Shapley-based reconciliation to align conflicting demand signals from regional sales directors and the global epidemiology forecasting team.
Shapley Value
Attribution Mechanism
FORECAST RECONCILIATION

Frequently Asked Questions

Clear, authoritative answers to the most common questions about aligning hierarchical statistical forecasts to ensure a unified, coherent demand plan across your global supply chain.

Forecast reconciliation is the mathematical process of adjusting independently generated statistical forecasts at different hierarchical levels to ensure they are coherent—meaning the sum of lower-level forecasts exactly equals the forecast of the higher-level category they roll up to. It works by applying a reconciliation matrix, often derived via ordinary least squares (OLS) or weighted least squares (WLS) regression, to optimally combine the information from all levels. For example, the sum of individual SKU forecasts for 'Blue Widgets' in the West region must equal the aggregate 'Blue Widgets' forecast, which in turn must align with the total 'Widgets' category forecast. This process resolves the inherent inconsistency that arises when generating base forecasts independently at each echelon, producing a single, unified view of future demand that satisfies all aggregation constraints.

Prasad Kumkar

About the author

Prasad Kumkar

CEO & MD, Inference Systems

Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.

His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.