Metraipolis › archive › dc_98f69fe38aa8
GNA: Granular Neighbor Assembly for Retrieval-Augmented Multivariate Time-Series Forecasting — arXiv:2609.36281
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.36281
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T17:28:57.443Z
- SHA-256 of the archived text
e8f2f6445ba862da9c8377143080237a758a618375b768201995f875f59538d2- Stable URL of this page
https://metraipolis.com/documento/dc_98f69fe38aa8
How to cite
GNA: Granular Neighbor Assembly for Retrieval-Augmented Multivariate Time-Series Forecasting — arXiv:2609.36281 — arXiv (en), https://arxiv.org/abs/2609.36281 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_98f69fe38aa8 (Metraipolis archive dc_98f69fe38aa8, sha256 e8f2f6445ba862da9c8377143080237a758a618375b768201995f875f59538d2)
BibTeX
@misc{dc98f69fe38aa8,
title = {GNA: Granular Neighbor Assembly for Retrieval-Augmented Multivariate Time-Series Forecasting — arXiv:2609.36281},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.36281},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_98f69fe38aa8; sha256 e8f2f6445ba862da9c8377143080237a758a618375b768201995f875f59538d2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.36281. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Deep forecasters predict from a fixed-length lookback window, and lengthening it gives diminishing returns at a growing cost. Retrieval augmentation instead shows the model how similar past situations continued. Retrieving a whole past window gives every variate the continuation of the same past moment. In multivariate series, however, the best past match differs from variate to variate. We present GNA (Granular Neighbor Assembly), a retrieval layer for forecasting backbones that assembles neighbors at two granularities: whole past windows, which keep the variates coherent, and per-variate neighbors, in which each variate takes its future from its own best-matching past. A learned gate decides, per forecast step and variate, how much to trust these futures against a persistence forecast, next to the backbone's own forecast. Candidates come from an embedding trained to predict each window's future, and retrieval is strictly causal: a past window is used only once its future has been observed. With the same lookback for every model and the same retrieval constants for all datasets, GNA improves two Transformer backbones in 85 of 96 dataset-horizon settings, gives the lowest MSE on 8 of 12 standard benchmarks and beats its backbone in every seed on 10 of them. Both granularities are needed, and neighbors of mismatched queries are worse than none. Retrieval helps most where the lookback says least: the gate shifts trust to retrieved futures further ahead. Where it fails, on hourly non-stationary series at long horizons, the loss is consistent with a drifting level of the retrieved futures. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-30 in cs.LG). Categorie arXiv: Machine Learning (cs.LG) ; Machine Learning (stat.ML). Pagina del lavoro: https://arxiv.org/abs/2609.36281 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T16:59:48.147Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).