Discussing the article: "Forecast Reconciliation (MinT): One Engine for Timeframe Hierarchies and Currency Graphs"

[MetaQuotes]

Check out the new article: Forecast Reconciliation (MinT): One Engine for Timeframe Hierarchies and Currency Graphs.

This article builds forecast reconciliation in pure MQL5 and applies it to two structures: timeframe aggregation on one symbol and a currency graph linked by no‑arbitrage. The engine projects base forecasts onto linear constraints to make them coherent. We benchmark OLS/WLS and MinT with and without shrinkage on long walk‑forward runs, show when total squared error decreases, and measure the cost that may concentrate in a single node.

Open a chart with a multi-timeframe dashboard and you are looking at forecasts that contradict each other. The H1 model says one thing about the next few hours, the H4 model another about the same hours, and the D1 model a third about a window containing both. All three describe the same stretch of price, and rarely are any two consistent.

The usual answer is a weighted vote: give the higher timeframe more weight and tune until the dashboard agrees with your intuition. That produces one number, but says nothing about whether it beats the ones you started with.

The forecasting literature has an exact answer, and it is not a vote. It is called forecast reconciliation: when the targets are linearly related by construction, one way of making the forecasts consistent, the orthogonal projection, provably cannot increase total squared error. You do not need a better model, only to stop your models contradicting one another. The guarantee has conditions, which section 3 pins down and section 7 tests on real data.

We implement the method in pure MQL5, linear algebra included, and feed one engine two structures with nothing in common: a hierarchy of timeframes on one symbol, and a graph of currency pairs linked by the no-arbitrage identity. Then we measure what it does on years of real bars.

Author: Muhammad Minhas Qamar