When Does Retrieval Help Time-Series Forecasting?
arXiv:2609. 20193v1 Announce Type: new Abstract: Retrieval plug-ins supply a deep forecaster with information its lookback window cannot carry.
arXiv:2609. 20193v1 Announce Type: new Abstract: Retrieval plug-ins supply a deep forecaster with information its lookback window cannot carry.
arXiv:2607. 12248v1 Announce Type: cross Abstract: Large pretrained time-series models such as TimesFM are attractive for financial forecasting, but raw directional accuracy is a misleading scoreboard in equity markets.
arXiv:2606. 27282v1 Announce Type: new Abstract: Time-series forecasting research has been moving steadily toward larger architectures, from specialized transformers to general-purpose foundation models, on the assumption that capacity is what unlocks accuracy.
arXiv:2606. 09877v1 Announce Type: new Abstract: LLM wiki systems compile knowledge into pre-filled KV caches for efficient inference, but assume a static corpus -- an assumption that fails whenever the underlying information landscape evolves.
arXiv:2609.24559v1 Announce Type: new Abstract: We present $t_0$, a family of open-weights foundation models for forecasting with multivariate context. We release its first two members: $\texttt{t0-a...
arXiv:2606. 28670v1 Announce Type: cross Abstract: We introduce MACROCAST, a lightweight Time Series Foundation Model (TSFM) for real-time macroeconomic forecasting.
The paper introduces CASP-LLM, a coverage‑aware semantic prompting framework that mitigates bias toward dominant temporal patterns in prompt‑based time series forecasting. Unlike traditional similarity‑based retrieval that selects top‑K candidates by cosine similarity, CASP‑LLM uses usage‑tracking and a saturating‑gate regularizer to diversify prompt selection without adding learnable parameters. Experiments on six long‑term and the M4 short‑term benchmarks show that CASP‑LLM matches or outperforms similarity‑based LLM forecasters in most settings, with failures traced to cross‑batch usage rather than within‑retrieval redundancy.
Time-series forecasting research has been moving steadily toward larger architectures, from specialized transformers to general-purpose foundation models, on the assumption that capacity is what unlocks accuracy. We take the opposite position: most of the gap can be closed at far lower cost by tuning preprocessing rather than scaling models.
The paper audits the impact of temporal leakage on financial-news direction prediction across 49,799 articles and 16 feature-model combinations, including TF‑IDF, MiniLM, FinBERT, and fine‑tuned RoBERTa‑large / DeBERTa‑v3‑large, as well as zero/few‑shot and LoRA probes of Llama‑3 and Qwen2.5. Random train‑test splits inflate MCC scores by 1.1× to 6.5×, with larger models and richer features showing greater gains, while end‑to‑end FinBERT fine‑tuning actually increases the gap. Only the mergers and acquisitions (M&A) category shows a positive locked‑test signal under near‑temporal chronological evaluation, with the signal localized to 2024‑2025 European‑tilted M&A semantics and not transferring to a 2009‑2020 U.S. corpus.
arXiv:2607. 19383v1 Announce Type: cross Abstract: Pretrained generative foundation models cast forecasting as conditional generation from a learned predictive distribution and forecast unseen series zero-shot.
arXiv:2607. 13006v1 Announce Type: new Abstract: A growing family of indices scores how predictable a series is from its spectrum.
The paper investigates which historical examples are most useful for time‑series forecasting by defining predictive relevance as the expected future utility conditioned on inference‑time information. It introduces a two‑stage approach: a normalized‑pattern retriever generates a coarse candidate set, and a lightweight MLP reranks these candidates using future‑supervised relevance while keeping inference strictly past‑only. Experiments on six benchmarks show that this reranker improves pattern retrieval and outperforms a matched‑protocol baseline, revealing that historical relevance is structured, domain‑dependent, and not governed by a single universal retrieval rule.