Challenges of Explainability in Continual Learning for Time Series Forecasting
- URL: http://arxiv.org/abs/2607.19382v1
- Date: Wed, 01 Jul 2026 08:35:26 GMT
- Title: Challenges of Explainability in Continual Learning for Time Series Forecasting
- Abstract summary: We study explainability as a central tool for understanding continual learning in adaptive time series forecasting.<n>Explainability is leveraged through attention rollout and gradient-based attribution methods.<n>Our results highlight the challenges and opportunities of using explainability to understand continual learning behaviors.
- Score: 0.9949801888214528
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Deep learning models have shown strong potential for time series forecasting, yet their deployment in real-world environmental monitoring remains challenging due to non-stationary dynamics and limited explainability. In this work, we investigate explainability as a central tool for understanding continual learning in adaptive time series forecasting, with Experience Replay strategies. We study neural forecasting architectures such as PatchMixer, PatchTST and DLinear, augmented with attention-based sampling mechanisms to support model adaptation over time. Explainability is leveraged through attention rollout and gradient-based attribution methods (Grad-CAM) to analyze both predictive behavior and sampling strategies within a continual learning framework. Experiments conducted on real-world piezometric time series exhibiting heterogeneous patterns and regime shifts show that analyzing model and sampling behaviors provides valuable insights into the dynamics of the continual learning framework. Beyond predictive performance, our results highlight the challenges and opportunities of using explainability to understand continual learning behaviors, revealing how attribution patterns evolve over time and how they can inform data selection and adaptation strategies in non-stationary forecasting scenarios.
Related papers
- A Survey on Self-Improving Test-Time Intelligence: Feedback-Driven Adapting, Learning, and Scaling at Inference [72.19201465132619]
We present feedback-driven Test-Time Intelligence (TTI) as a unified perspective for understanding such deployment-time improvement.<n>We use this view to relate test-time adaptation, test-time learning, and test-time scaling, highlighting both their distinctions and their growing overlap in hybrid systems.<n>Our goal is to provide a coherent foundation and research roadmap for the study of self-improving AI systems at test time.
arXiv Detail & Related papers (2026-09-01T11:41:39Z) - Attention-based Experience Replay Framework for Continual Learning of Agnostic Time Series Forecasting Models [0.9668407688201359]
Continual learning aims to develop models capable of adapting incrementally while maintaining a balance between stability and plasticity under computational constraints.<n>We introduce a novel framework for continual time series forecasting, designed to extend existing static forecasting models.<n>Results show that our approach effectively increases or maintains predictive performance over time while reducing retraining costs and data requirements.
arXiv Detail & Related papers (2026-06-12T11:44:05Z) - Factorize to Generalize: Retrieval-Guided Invariant-Dynamic Decomposition for Time Series Forecasting [64.2640656619583]
Time series foundation models (TSFMs) have recently achieved strong zero-shot forecasting performance through large-scale pretraining and retrieval-augmented prediction.<n>We propose a Retrieval-guided Invariant-Dynamic DEcomposition framework for time series forecasting.
arXiv Detail & Related papers (2026-05-24T07:31:55Z) - Model-Based Reinforcement Learning for Control under Time-Varying Dynamics [40.96573079787976]
We study reinforcement learning for control under time-varying dynamics.<n>We propose a practical optimistic model-based reinforcement learning algorithm with adaptive data buffer mechanisms.
arXiv Detail & Related papers (2026-04-02T16:52:59Z) - Position: Beyond Model-Centric Prediction -- Agentic Time Series Forecasting [49.05788441962762]
We argue for agentic time series forecasting (ATSF), which reframes forecasting as an agentic process composed of perception, planning, action, reflection, and memory.<n>We outline three representative implementation paradigms -- workflow-based design, agentic reinforcement learning, and a hybrid agentic workflow paradigm -- and discuss the opportunities and challenges that arise when shifting from model-centric prediction to agentic forecasting.
arXiv Detail & Related papers (2026-02-02T08:01:11Z) - Characteristic Root Analysis and Regularization for Linear Time Series Forecasting [9.254995889539716]
Time series forecasting remains a critical challenge across numerous domains.<n>Recent studies highlight the surprising competitiveness of simple linear models.<n>This paper focuses on the role of characteristic roots in temporal dynamics.
arXiv Detail & Related papers (2025-09-28T03:06:30Z) - From Physics to Machine Learning and Back: Part II - Learning and Observational Bias in PHM [52.64097278841485]
Review examines how incorporating learning and observational biases through physics-informed modeling and data strategies can guide models toward physically consistent and reliable predictions.<n>Fast adaptation methods including meta-learning and few-shot learning are reviewed alongside domain generalization techniques.
arXiv Detail & Related papers (2025-09-25T14:15:43Z) - Robust Multi-Modal Forecasting: Integrating Static and Dynamic Features [0.0]
Time series forecasting plays a crucial role in various applications, particularly in healthcare.<n> Ensuring transparency and explainability of the models responsible for these tasks is essential for their adoption in critical settings.<n>Recent work has explored a top-down approach to bi-level transparency, focusing on understanding trends and properties of predicted time series.
arXiv Detail & Related papers (2025-05-21T04:12:12Z) - iTFKAN: Interpretable Time Series Forecasting with Kolmogorov-Arnold Network [29.310194531870323]
We propose a novel interpretable model, iTFKAN, for credible time series forecasting.<n>iTFKAN enables further exploration of model decision rationales and underlying data patterns due to its interpretability achieved through model symbolization.
arXiv Detail & Related papers (2025-04-23T05:34:49Z) - A Poisson-Gamma Dynamic Factor Model with Time-Varying Transition Dynamics [51.147876395589925]
A non-stationary PGDS is proposed to allow the underlying transition matrices to evolve over time.
A fully-conjugate and efficient Gibbs sampler is developed to perform posterior simulation.
Experiments show that, in comparison with related models, the proposed non-stationary PGDS achieves improved predictive performance.
arXiv Detail & Related papers (2024-02-26T04:39:01Z) - OpenSTL: A Comprehensive Benchmark of Spatio-Temporal Predictive
Learning [67.07363529640784]
We propose OpenSTL to categorize prevalent approaches into recurrent-based and recurrent-free models.
We conduct standard evaluations on datasets across various domains, including synthetic moving object trajectory, human motion, driving scenes, traffic flow and forecasting weather.
We find that recurrent-free models achieve a good balance between efficiency and performance than recurrent models.
arXiv Detail & Related papers (2023-06-20T03:02:14Z) - Stochastically forced ensemble dynamic mode decomposition for
forecasting and analysis of near-periodic systems [65.44033635330604]
We introduce a novel load forecasting method in which observed dynamics are modeled as a forced linear system.
We show that its use of intrinsic linear dynamics offers a number of desirable properties in terms of interpretability and parsimony.
Results are presented for a test case using load data from an electrical grid.
arXiv Detail & Related papers (2020-10-08T20:25:52Z)
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.