TSFM in-context learning for time-series classification of bearing-health status

• URL: http://arxiv.org/abs/2511.15447v1
• Date: Wed, 19 Nov 2025 14:01:12 GMT
• Title: TSFM in-context learning for time-series classification of bearing-health status
• Authors: Michel Tokic, Slobodan Djukanović, Anja von Beuningen, Cheng Feng,
• Abstract summary: This paper introduces a classification method using in-context learning in time-series foundation models (TSFM)<n>We show how data, which was not part of the TSFM training data corpus, can be classified without the need of finetuning the model.<n>We apply this method to vibration data for assessing the health state of a bearing within a servo-press motor.
• Score: 2.1569807291469454
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper introduces a classification method using in-context learning in time-series foundation models (TSFM). We show how data, which was not part of the TSFM training data corpus, can be classified without the need of finetuning the model. Examples are represented in the form of targets (class id) and covariates (data matrix) within the prompt of the model, which enables to classify an unknown covariate data pattern alongside the forecast axis through in-context learning. We apply this method to vibration data for assessing the health state of a bearing within a servo-press motor. The method transforms frequency domain reference signals into pseudo time-series patterns, generates aligned covariate and target signals, and uses the TSFM to predict probabilities how classified data corresponds to predefined labels. Leveraging the scalability of pre-trained models this method demonstrates efficacy across varied operational conditions. This marks significant progress beyond custom narrow AI solutions towards broader, AI-driven maintenance systems.

Related papers

• Reinforcement learning based data assimilation for unknown state model [3.032674692886751]
  We propose a novel method that integrates reinforcement learning with ensemble-based Bayesian ffltering methods.<n>The proposed framework accommodates a wide range of observation scenarios, including nonlinear and partially observed measurement models.<n>A few numerical examples demonstrate that the proposed method achieves superior accuracy and robustness in high-dimensional settings.
  arXiv  Detail & Related papers  (2025-11-04T05:58:37Z)
• Time Series Similarity Score Functions to Monitor and Interact with the Training and Denoising Process of a Time Series Diffusion Model applied to a Human Activity Recognition Dataset based on IMUs [0.0]
  diffusion probabilistic models are able to generate synthetic sensor signals.<n>The training process is controlled by a loss function which measures the difference between the noise that was added in the forward process and the noise that was predicted by the diffusion model.<n>We examine multiple similarity metrics and adapt an existing metric to overcome this issue by monitoring the training and synthetisation process.
  arXiv  Detail & Related papers  (2025-05-20T06:38:17Z)
• Classification of High-dimensional Time Series in Spectral Domain using Explainable Features [8.656881800897661]
  We propose a model-based approach for classifying high-dimensional stationary time series. Our approach emphasizes the interpretability of model parameters, making it especially suitable for fields like neuroscience. The novelty of our method lies in the interpretability of the model parameters, addressing critical needs in neuroscience.
  arXiv  Detail & Related papers  (2024-08-15T19:10:12Z)
• Semi-Supervised Model-Free Bayesian State Estimation from Compressed Measurements [57.04370580292727]
  We consider data-driven Bayesian state estimation from compressed measurements.<n>The dimension of the temporal measurement vector is lower than that of the temporal state vector to be estimated.<n>The underlying dynamical model of the state's evolution is unknown for a'model-free process'
  arXiv  Detail & Related papers  (2024-07-10T05:03:48Z)
• Exploring Beyond Logits: Hierarchical Dynamic Labeling Based on Embeddings for Semi-Supervised Classification [49.09505771145326]
  We propose a Hierarchical Dynamic Labeling (HDL) algorithm that does not depend on model predictions and utilizes image embeddings to generate sample labels. Our approach has the potential to change the paradigm of pseudo-label generation in semi-supervised learning.
  arXiv  Detail & Related papers  (2024-04-26T06:00:27Z)
• Fusing Conditional Submodular GAN and Programmatic Weak Supervision [5.300742881753571]
  Programmatic Weak Supervision (PWS) and generative models serve as crucial tools to maximize the utility of existing datasets without resorting to data gathering and manual annotation processes. PWS uses various weak supervision techniques to estimate the underlying class labels of data, while generative models primarily concentrate on sampling from the underlying distribution of the given dataset. Recently, WSGAN proposed a mechanism to fuse these two models.
  arXiv  Detail & Related papers  (2023-12-16T07:49:13Z)
• 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)
• CSDI: Conditional Score-based Diffusion Models for Probabilistic Time Series Imputation [107.63407690972139]
  Conditional Score-based Diffusion models for Imputation (CSDI) is a novel time series imputation method that utilizes score-based diffusion models conditioned on observed data. CSDI improves by 40-70% over existing probabilistic imputation methods on popular performance metrics. In addition, C reduces the error by 5-20% compared to the state-of-the-art deterministic imputation methods.
  arXiv  Detail & Related papers  (2021-07-07T22:20:24Z)
• Learning summary features of time series for likelihood free inference [93.08098361687722]
  We present a data-driven strategy for automatically learning summary features from time series data. Our results indicate that learning summary features from data can compete and even outperform LFI methods based on hand-crafted values.
  arXiv  Detail & Related papers  (2020-12-04T19:21:37Z)
• BREEDS: Benchmarks for Subpopulation Shift [98.90314444545204]
  We develop a methodology for assessing the robustness of models to subpopulation shift. We leverage the class structure underlying existing datasets to control the data subpopulations that comprise the training and test distributions. Applying this methodology to the ImageNet dataset, we create a suite of subpopulation shift benchmarks of varying granularity.
  arXiv  Detail & Related papers  (2020-08-11T17:04:47Z)

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.