STEPS: A Temporal Smooth Error Propagation Solver on the Manifolds for Test-Time Adaptation in Time Series Forecasting

• URL: http://arxiv.org/abs/2605.08005v1
• Date: Fri, 08 May 2026 16:58:10 GMT
• Title: STEPS: A Temporal Smooth Error Propagation Solver on the Manifolds for Test-Time Adaptation in Time Series Forecasting
• Abstract summary: Test-Time Adaptation (TTA) aims to improve time series forecasting under distribution shifts by using limited observations revealed during inference.<n>Existing methods can suffer from weak identifiability, error accumulation, and unstable long-horizon corrections when the revealed prefix is sparse or contaminated.
• Score: 6.053929364291382
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Test-Time Adaptation (TTA) aims to improve time series forecasting under distribution shifts by using limited observations revealed during inference. However, forecasting TTA must operate in a source-free online setting, where the adaptation signal is short, temporally correlated, and potentially noisy. Existing methods can therefore suffer from weak identifiability, error accumulation, and unstable long-horizon corrections when the revealed prefix is sparse or contaminated. To address these issues, we propose STEPS, a Smooth Temporal Error Propagation Solver for TTA in time-series forecasting. STEPS reformulates forecasting TTA as a Dirichlet Boundary Value Problem on a temporal manifold, where the revealed prefix error serves as the boundary condition for the unknown future error field. Then, STEPS solves a smooth and bounded correction field in prediction space: a Local Solver propagates prefix errors under temporal smoothness, a Global Solver retrieves stable cross-window error memory and Spatiotemporal Manifold Fusion (SMF) integrates both solutions into the final correction. Across six standard benchmarks and four frozen backbones, STEPS achieves an average relative MSE reduction of 26.82% over the zero-shot backbone, exceeding the strongest compared TTA baseline by 12.77%. Additional sparse prefix and contamination tests confirm the robustness of STEPS under limited and noisy prefixes.

Related papers

• TTSD-FAR: Test-Time Self-Distillation with Fisher-Anchored Restoration for Missing-Modality Emotion Recognition in LVLMs [83.78708832901194]
  Large video-language models (LVLMs) have shown remarkable performance on multimodal tasks like multimodal emotion recognition (ER) in the wild.<n>However, real-world deployment remains challenging: modalities may be missing or noisy at test time.<n>We propose a solution in which a frozen teacher guides an adaptive low-rank student via self-distillation.<n>Experiments on MELD, DFEW, and BAH under 0%-50% missing modalities show that this unified adaptation-restoration design consistently outperforms entropy-based adaptation, RAG, and perplexity-based generation.
  arXiv  Detail & Related papers  (2026-08-18T23:40:28Z)
• Retrieval-Corrected Conformal Prediction for Time Series [31.867011243141818]
  Conformal prediction (CP) provides distribution-free prediction intervals for fixed forecasters.<n>Recent time series CP methods improve local calibration using recent, weighted, or localized residuals.<n>Local calibration can remain indirect, since broad residual weighting or additional adaptation procedures may dilute the evidence most relevant to the current prediction.<n>We propose Retrieval-Corrected Conformal Prediction (RCCP), a retrieval-augmented calibration method for time series prediction intervals.
  arXiv  Detail & Related papers  (2026-08-11T06:43:01Z)
• Improving Spatio-Temporal Residual Error Propagation by Mitigating Over-Squashing [4.62541204592513]
  We introduce Teger, a structured uncertainty module that overcomes the spa- tial and temporal limitations of error-related autoregressive forecasting.<n>Teger is backbone-agnostic, requiring only the latent state produced by any autoregressive encoder.
  arXiv  Detail & Related papers  (2026-05-18T08:51:33Z)
• RareCP: Regime-Aware Retrieval for Efficient Conformal Prediction [11.259098206661077]
  We introduce RareCP, a regime-aware retrieval method for adaptive conformal time series prediction.<n>RareCP learns local calibration representations through a mixture of cosine-attention experts.<n>It forms a weighted conformal quantile over their signed residuals, yielding asymmetric prediction intervals.
  arXiv  Detail & Related papers  (2026-05-09T10:12:07Z)
• Majorization-Guided Test-Time Adaptation for Vision-Language Models under Modality-Specific Shift [0.0]
  Vision-language models transfer well in zero-shot settings, but at deployment the visual and textual branches often shift asymmetrically.<n>We study this failure mode through a majorization view of multimodal posteriors and cast adaptation as a constrained de-mixing problem on the fused prediction.<n>We propose MG-MTTA, which keeps the backbone frozen and updates only a lightweight gate or adapter.
  arXiv  Detail & Related papers  (2026-04-27T15:29:35Z)
• TimeAPN: Adaptive Amplitude-Phase Non-Stationarity Normalization for Time Series Forecasting [67.91113180885601]
  TimeAPN explicitly models and predicts non-stationary factors from both the time and frequency domains.<n>TimeAPN consistently improves long-term forecasting accuracy across multiple prediction horizons.<n>It outperforms state-of-the-art reversible normalization methods.
  arXiv  Detail & Related papers  (2026-03-18T07:21:24Z)
• DistDF: Time-Series Forecasting Needs Joint-Distribution Wasserstein Alignment [92.70019102733453]
  Training time-series forecast models requires aligning the conditional distribution of model forecasts with that of the label sequence.<n>We propose DistDF, which achieves alignment by alternatively minimizing a discrepancy between the conditional forecast and label distributions.
  arXiv  Detail & Related papers  (2025-10-28T16:09:59Z)
• Adapt in the Wild: Test-Time Entropy Minimization with Sharpness and Feature Regularization [85.50560211492898]
  Test-time adaptation (TTA) may fail to improve or even harm the model performance when test data have mixed distribution shifts.<n>This is often a key obstacle preventing existing TTA methods from being deployed in the real world.<n>We propose a sharpness-aware and reliable entropy minimization method, called SAR, for stabilizing TTA from two aspects.
  arXiv  Detail & Related papers  (2025-09-05T10:03:00Z)
• BayesTTA: Continual-Temporal Test-Time Adaptation for Vision-Language Models via Gaussian Discriminant Analysis [41.09181390655176]
  Vision-language models (VLMs) such as CLIP achieve strong zero-shot recognition but degrade significantly under textittemporally evolving distribution shifts common in real-world scenarios.<n>We formalize this practical problem as textitContinual-Temporal Test-Time Adaptation (CT-TTA), where test distributions evolve gradually over time.<n>We propose textitBayesTTA, a Bayesian adaptation framework that enforces temporally consistent predictions and dynamically aligns visual representations.
  arXiv  Detail & Related papers  (2025-07-11T14:02:54Z)
• Stable Symmetry-Protected Topological Phases in Systems with Heralded Noise [0.0]
  We present a family of local quantum channels whose steady-states exhibit stable mixed-state symmetry-protected topological (SPT) order.<n>We construct a correction protocol that confines errors into short-ranged pairs in the steady-state.<n>As the rate of heralded noise increases, SPT order is eventually lost through a directed percolation transition.
  arXiv  Detail & Related papers  (2024-04-25T18:21:48Z)
• Uncertainty-Calibrated Test-Time Model Adaptation without Forgetting [65.21599711087538]
  Test-time adaptation (TTA) seeks to tackle potential distribution shifts between training and test data by adapting a given model w.r.t. any test sample.<n>Prior methods perform backpropagation for each test sample, resulting in unbearable optimization costs to many applications.<n>We propose an Efficient Anti-Forgetting Test-Time Adaptation (EATA) method which develops an active sample selection criterion to identify reliable and non-redundant samples.
  arXiv  Detail & Related papers  (2024-03-18T05:49:45Z)
• Stochastic Approximation with Delayed Updates: Finite-Time Rates under Markovian Sampling [73.5602474095954]
  We study the non-asymptotic performance of approximation schemes with delayed updates under Markovian sampling. Our theoretical findings shed light on the finite-time effects of delays for a broad class of algorithms.
  arXiv  Detail & Related papers  (2024-02-19T03:08:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.