Locally Linear Continual Learning for Time Series based on VC-Theoretical Generalization Bounds

• URL: http://arxiv.org/abs/2603.13674v1
• Date: Sat, 14 Mar 2026 00:48:02 GMT
• Title: Locally Linear Continual Learning for Time Series based on VC-Theoretical Generalization Bounds
• Abstract summary: SyMPLER is an explainable model for time series forecasting in nonstationary environments.<n>Unlike other locally linear models, SyMPLER uses bounds generalization from Statistical Learning Theory to automatically determine when to add new local models.
• Score: 0.18848440735415498
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Most machine learning methods assume fixed probability distributions, limiting their applicability in nonstationary real-world scenarios. While continual learning methods address this issue, current approaches often rely on black-box models or require extensive user intervention for interpretability. We propose SyMPLER (Systems Modeling through Piecewise Linear Evolving Regression), an explainable model for time series forecasting in nonstationary environments based on dynamic piecewise-linear approximations. Unlike other locally linear models, SyMPLER uses generalization bounds from Statistical Learning Theory to automatically determine when to add new local models based on prediction errors, eliminating the need for explicit clustering of the data. Experiments show that SyMPLER can achieve comparable performance to both black-box and existing explainable models while maintaining a human-interpretable structure that reveals insights about the system's behavior. In this sense, our approach conciliates accuracy and interpretability, offering a transparent and adaptive solution for forecasting nonstationary time series.

Related papers

• Unveiling Stochasticity: Universal Multi-modal Probabilistic Modeling for Traffic Forecasting [3.268970214362015]
  This paper proposes an elegant yet universal approach that transforms existing models into probabilistic predictors.<n> Experiments on multiple traffic datasets show that our approach generalizes from classic to modern model architectures.<n>A more detailed study on a real-world dense urban traffic network is presented to examine the impact of data quality uncertainty.
  arXiv  Detail & Related papers  (2026-04-17T14:10:16Z)
• Real-Time Performance Analysis of Multi-Fidelity Residual Physics-Informed Neural Process-Based State Estimation for Robotic Systems [0.0]
  We present a novel real-time, data-driven estimation approach based on the multi-fidelity residual physics-informed neural process (MFR-PINP)<n>Specifically, we address the model-mismatch issue of selecting an accurate kinematic model by tasking the MFR-PINP to also learn the residuals between simple, low-fidelity predictions and complex, high-fidelity ground-truth dynamics.<n>We provide implementation details of our MFR-PINP-based estimator for a hybrid online learning setting to validate our model's usage in real-time applications.
  arXiv  Detail & Related papers  (2025-11-11T13:30:51Z)
• Diffusion models for probabilistic programming [56.47577824219207]
  Diffusion Model Variational Inference (DMVI) is a novel method for automated approximate inference in probabilistic programming languages (PPLs) DMVI is easy to implement, allows hassle-free inference in PPLs without the drawbacks of, e.g., variational inference using normalizing flows, and does not make any constraints on the underlying neural network model.
  arXiv  Detail & Related papers  (2023-11-01T12:17:05Z)
• 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)
• Kalman Filter for Online Classification of Non-Stationary Data [101.26838049872651]
  In Online Continual Learning (OCL) a learning system receives a stream of data and sequentially performs prediction and training steps. We introduce a probabilistic Bayesian online learning model by using a neural representation and a state space model over the linear predictor weights. In experiments in multi-class classification we demonstrate the predictive ability of the model and its flexibility to capture non-stationarity.
  arXiv  Detail & Related papers  (2023-06-14T11:41:42Z)
• Time Series Continuous Modeling for Imputation and Forecasting with Implicit Neural Representations [15.797295258800638]
  We introduce a novel modeling approach for time series imputation and forecasting, tailored to address the challenges often encountered in real-world data. Our method relies on a continuous-time-dependent model of the series' evolution dynamics. A modulation mechanism, driven by a meta-learning algorithm, allows adaptation to unseen samples and extrapolation beyond observed time-windows.
  arXiv  Detail & Related papers  (2023-06-09T13:20:04Z)
• Uncertainty Quantification for Local Model Explanations Without Model Access [0.44241702149260353]
  We present a model-agnostic algorithm for generating post-hoc explanations for a machine learning model. Our algorithm uses a bootstrapping approach to quantify the uncertainty that inevitably arises when generating explanations from a finite sample of model queries.
  arXiv  Detail & Related papers  (2023-01-13T21:18:00Z)
• Mixed moving average field guided learning for spatio-temporal data [0.0]
  We define a novel Bayesian-temporal embedding and a theory-guided machine learning approach to make ensemble forecasts. We use Lipschitz predictors to determine fixed-time and any-time PAC in the batch learning setting. We then test the performance of our learning methodology by using linear predictors and data sets simulated from a dependence- Ornstein-Uhlenbeck process.
  arXiv  Detail & Related papers  (2023-01-02T16:11:05Z)
• Continuous-Time Modeling of Counterfactual Outcomes Using Neural Controlled Differential Equations [84.42837346400151]
  Estimating counterfactual outcomes over time has the potential to unlock personalized healthcare. Existing causal inference approaches consider regular, discrete-time intervals between observations and treatment decisions. We propose a controllable simulation environment based on a model of tumor growth for a range of scenarios.
  arXiv  Detail & Related papers  (2022-06-16T17:15:15Z)
• Learning Interpretable Deep State Space Model for Probabilistic Time Series Forecasting [98.57851612518758]
  Probabilistic time series forecasting involves estimating the distribution of future based on its history. We propose a deep state space model for probabilistic time series forecasting whereby the non-linear emission model and transition model are parameterized by networks. We show in experiments that our model produces accurate and sharp probabilistic forecasts.
  arXiv  Detail & Related papers  (2021-01-31T06:49:33Z)
• Remaining Useful Life Estimation Under Uncertainty with Causal GraphNets [0.0]
  A novel approach for the construction and training of time series models is presented. The proposed method is appropriate for constructing predictive models for non-stationary time series.
  arXiv  Detail & Related papers  (2020-11-23T21:28:03Z)
• Generative Temporal Difference Learning for Infinite-Horizon Prediction [101.59882753763888]
  We introduce the $gamma$-model, a predictive model of environment dynamics with an infinite probabilistic horizon. We discuss how its training reflects an inescapable tradeoff between training-time and testing-time compounding errors.
  arXiv  Detail & Related papers  (2020-10-27T17:54:12Z)

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.