- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes Granular Neighbor Assembly (GNA) for retrieval-augmented multivariate time-series forecasting. Motivated by the limitations of the fixed-length lookback windows and different neighbors by different variables, the proposed GNA combines global retrieval with per-variate retrieval. It further introduces a future-aware retrieval embedding trained using forecasting supervision and a learned gating mechanism to adaptively combine retrieved future trajectories, persistence forecasts, and backbone predictions.
The experimental results are quite competitive. The proposed GNA improves GridTST and iTransformer in 43 and 42 out of 48 dataset–horizon settings, respectively, and achieves the lowest MSE on 8 out of 12 benchmark datasets.
Overall, the proposed framework seems combine multiple existing components together. In addition, the robustness of generality of the proposed method remains unclear to me as its performance decrease substantially with longer lookback windows, and the proposed method even degrades performance on ETTh1 and ETTh2.
Critical strengths
- It is a well-motivated paper. The combination of global and per-variate retrieval, which is similar to ensemble learning, sounds interesting to me.
- The experimental results are competitive, with substantial improvements on several benchmarks.
Critical weaknesses
- The novelty is somewhat limited. The proposed framework mainly combines existing techniques, including nearest-neighbor retrieval, forecasting-based representation earning, adaptive gating, and cross-attention.
- The effectiveness of retrieval is highly dependent on the datasets and the lookback length. For example, the improvements decrease substantially with longer lookback windows, and the proposed method even degrades performance on ETTh1 and ETTh2. Thus, the robustness of generality of the proposed method may remain unclear to me.
Questions for authors
- Can you justify the performance improvement for longer lookback windows empirically?
We thank the reviewer for the positive assessment of the motivation and the results.
W2 / Q1 (longer lookbacks). We extended the lookback study to three datasets. Change in MSE of GNA vs. the plain backbone at the same L (H = 96):
L = 48: ETTm1 −33.4%, PEMS08 −86.6%, Weather −4.3% L = 96: ETTm1 −8.0%, PEMS08 −72.6%, Weather −1.7% L = 192: ETTm1 −1.2%, PEMS08 −67.8%, Weather −3.9% L = 336: ETTm1 +5.3%, PEMS08 −52.6%, Weather +2.2%
On all three datasets, the gain is largest at L = 48 and smallest at L = 336. On the sensor network it persists at L = 336 (−53%). On ETTm1 and Weather, where 336 steps span 3.5 and 2.3 days, the plain backbone is slightly better. We agree with the reviewer's reading and state this scope explicitly: GNA supplies context that a short window lacks, and on ETTm1 and Weather it does not add to a long window. Short windows are often imposed rather than chosen. After a restart or a change of operating conditions, only a short stretch of relevant history exists, and processes that stop and start face this repeatedly. At L = 48 the gains are largest, and they extend to foundation models: with a 48-step context, GNA lowers the MSE of a frozen zero-shot TimesFM-3 from 3.33 to 0.105 (PEMS08) and from 3.53 to 0.311 (ETTm1).
W2 (ETTh1/ETTh2). We report and analyze this failure (Sec. 7, App. I). On three-seed means, GNA's MSE is 1.1% higher on ETTh1 and 7.2% higher on ETTh2. The loss concentrates at the longest horizon. In the seed-2023 runs, GNA is 8.8% (ETTh1) and 22% (ETTh2) worse at H = 720, while it is better at H = 96 on both (−0.2%, −4.0%) and at H = 336 on ETTh1 (−6.0%). The same recordings sampled every 15 min (ETTm1, ETTm2) improve at every horizon, so this is not a failure on the domain as such. Hourly data at H = 720 forecast 30 days ahead from a 4-day window, with a 4× smaller bank. A hindsight oracle suggests that level-free retrieved futures would cut the ETTh error by 26–36%. A level correction of retrieved futures is our next step.
W1 (novelty). Nearest neighbors, learned embeddings, gates and attention are standard tools, and we do not claim them. The contribution is what is retrieved and how it is assembled. Among the retrieval forecasters in Tab. 17, RAFT and RATD retrieve whole past windows; TS-RAG, RAF and TimeRAF retrieve univariate series separately; and GTR uses a learned periodic memory instead of past windows. GNA builds composite slots in which each variate takes the future of its own best-matching past, combines them with coherent whole-window slots, and learns per forecast step and variate how much to trust each. Reviewer 548Z also notes that neighbor assembly has received little attention. The ablations show that the combination matters: global slots alone raise the MSE by 1.9–8.3%, and per-variate slots alone by 0.3–15.8%. The best per-variate slot is 17–45% closer to the true future than the best global slot. Your ensemble view fits well: the two slot types are complementary members, and the gate weights them per step and variate.
Generality. One retrieval configuration serves all datasets. GNA with GridTST beats the plain GridTST in every seed on 10 of 12 datasets and in 44 of 48 settings on seed means (Wilcoxon p < 1e-8). With PatchTST as a new third backbone, GNA improves 15 of 16 settings. Halving or doubling the fixed fusion weights changes the MSE by at most 3.1%.