- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes HIRA, a gradient-free adaptation method for frozen time-series foundation models. HIRA stores historical forecast residuals indexed by suffix-pooled hidden representations from the frozen backbone. At inference time, it retrieves residual trajectories from similar historical contexts and adds their weighted aggregation to the base forecast. Retrieval configurations and correction strengths are selected separately for different forecast-horizon blocks using chronological validation. The method is evaluated across TimesFM, Chronos-2, Moirai 2.0, and Sundial.
The paper is clearly written, carefully executed, and unusually transparent about development versus confirmation evidence. However, I have a fundamental concern about novelty relative to the previously released RATL paper. In my view, the current submission does not establish a sufficiently substantive contribution beyond RATL to warrant acceptance.
Critical strengths
The motivation is intuitive: a frozen forecaster may make recurring, context-dependent errors that can be reused as an adaptation memory. The proposed method is simple and does not require training an additional encoder, retriever, or fusion network. The chronological availability constraints are carefully designed to avoid direct use of unrevealed future targets. The evaluation covers four foundation-model backbones, and the authors commendably retain negative-transfer cases and explicitly distinguish developmental, confirmation, and post-hoc evidence.
Critical weaknesses
My primary concern is the substantial conceptual and algorithmic overlap with the previously released paper “RATL: Learning from Retrieved Residuals for Robust Multivariate Time-Series Forecasting,” which appeared on arXiv on September 3, 2026 (arXiv:2609.03937). RATL is neither cited nor discussed in the current submission.
The overlap concerns the central idea rather than a broad similarity in topic. Both methods freeze a base forecaster, run it on historical forecasting windows, compute model-specific residual trajectories, store historical context representations as retrieval keys and the corresponding residuals as values, retrieve residuals from similar contexts under causal availability constraints, aggregate the retrieved residuals, and add the resulting correction to the base forecast. Both methods also account for variation across forecast blocks and use validation to control correction strength. Thus, both papers make the same central conceptual move: replacing the retrieval of historical future trajectories with the retrieval of base-model-specific historical forecast errors.
HIRA differs from RATL in several implementation details. It uses native TSFM hidden states, suffix pooling over the last one, three, or five tokens, cosine top-k retrieval, validation-selected block-specific configurations rather than a learned set-aware router, and an optional agreement gate. It also provides a recoverability analysis. However, these differences appear to be choices of representation, router simplification, hyperparameter selection, and analysis around the same residual-memory framework, rather than a substantively different method.
The paper’s own ablations reinforce this concern. Hidden-state retrieval improves the mean gain over raw-input retrieval by only approximately 0.80 percentage points. Horizon-wise configuration improves over a global configuration by approximately 0.37 percentage points, and selecting among last-1/3/5 representations improves over last-1 by approximately 0.21 percentage points. These results suggest that most of the benefit comes from query-dependent residual retrieval itself, which is precisely the idea already developed by RATL, rather than from HIRA’s specific hidden-state or horizon-wise design.
I am not making a claim about whether the work was developed independently, since this cannot be determined from the manuscript. Nevertheless, novelty must be assessed relative to prior work available at submission time. The residual-retrieval idea is conceptually simple and straightforward to reproduce once stated. The burden is therefore on the current paper to distinguish itself through a direct comparison with RATL, a genuinely different technical contribution, or a capability not already covered by the existing framework. The manuscript currently does not meet this burden. Given the absence of any discussion or comparison, I cannot determine whether HIRA constitutes an independent substantive advance or a relatively direct gradient-free instantiation of the RATL residual-memory principle.
Questions for authors
How does HIRA differ substantively from RATL beyond replacing a learned router with validation-selected nonparametric retrieval?
Can the authors provide a direct comparison with RATL under the same backbone, datasets, residual memory, and label-availability protocol?