Accurate Parameter-Efficient Test-Time Adaptation for Time Series Forecasting
read the original abstract
Real-world time series often exhibit a non-stationary nature, degrading the performance of pre-trained forecasting models. Test-Time Adaptation (TTA) addresses this by adjusting models during inference, but existing methods typically update the full model, increasing memory and compute costs. We propose PETSA, a parameter-efficient method that adapts forecasters at test time by only updating small calibration modules on the input and output. PETSA uses low-rank adapters and dynamic gating to adjust representations without retraining. To maintain accuracy despite limited adaptation capacity, we introduce a specialized loss combining three components: (1) a robust term, (2) a frequency-domain term to preserve periodicity, and (3) a patch-wise structural term for structural alignment. PETSA improves the adaptability of various forecasting backbones while requiring fewer parameters than baselines. Experimental results on benchmark datasets show that PETSA achieves competitive or better performance across all horizons. Our code is available at: https://github.com/BorealisAI/PETSA
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
STEPS: A Temporal Smooth Error Propagation Solver on the Manifolds for Test-Time Adaptation in Time Series Forecasting
STEPS reformulates test-time adaptation for time series forecasting as a Dirichlet boundary value problem on a temporal manifold and solves for smooth error corrections, yielding 26.82% average relative MSE reduction ...
-
Adapt Only When It Pays: Budgeted Decision-Loss Priority for Delayed Online Time-Series Adaptation
ADOWIP uses a decision-loss priority gate to update only when loss exceeds an empirical quantile under budget constraints, showing lower held-out decision loss than always-update or fixed-period baselines on ETT tasks.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.