<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMES</journal-id>
<journal-id journal-id-type="nlm-ta">CMES</journal-id>
<journal-id journal-id-type="publisher-id">CMES</journal-id>
<journal-title-group>
<journal-title>Computer Modeling in Engineering &#x0026; Sciences</journal-title>
</journal-title-group>
<issn pub-type="epub">1526-1506</issn>
<issn pub-type="ppub">1526-1492</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">65461</article-id>
<article-id pub-id-type="doi">10.32604/cmes.2025.065461</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Using Time Series Foundation Models for Few-Shot Remaining Useful Life Prediction of Aircraft Engines</article-title>
<alt-title alt-title-type="left-running-head">Using Time Series Foundation Models for Few-Shot Remaining Useful Life Prediction of Aircraft Engines</alt-title>
<alt-title alt-title-type="right-running-head">Using Time Series Foundation Models for Few-Shot Remaining Useful Life Prediction of Aircraft Engines</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Dint&#x00E9;n</surname><given-names>Ricardo</given-names></name><email>ricardo.dinten@unican.es</email></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Zorrilla</surname><given-names>Marta</given-names></name></contrib>
<aff id="aff-1"><institution>Computer Engineering and Electronics Department, Faculty of Sciences, University of Cantabria</institution>, <addr-line>Santander, 39005</addr-line>, <country>Spain</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Ricardo Dint&#x00E9;n. Email: <email>ricardo.dinten@unican.es</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2025</year>
</pub-date>
<pub-date date-type="pub" publication-format="electronic">
<day>31</day><month>07</month><year>2025</year>
</pub-date>
<volume>144</volume>
<issue>1</issue>
<fpage>239</fpage>
<lpage>265</lpage>
<history>
<date date-type="received">
<day>13</day>
<month>3</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>26</day>
<month>6</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2025 The Authors.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Published by Tech Science Press.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMES_65461.pdf"></self-uri>
<abstract>
<p>Predictive maintenance often involves imbalanced multivariate time series datasets with scarce failure events, posing challenges for model training due to the high dimensionality of the data and the need for domain-specific preprocessing, which frequently leads to the development of large and complex models. Inspired by the success of Large Language Models (LLMs), transformer-based foundation models have been developed for time series (TSFM). These models have been proven to reconstruct time series in a zero-shot manner, being able to capture different patterns that effectively characterize time series. This paper proposes the use of TSFM to generate embeddings of the input data space, making them more interpretable for machine learning models. To evaluate the effectiveness of our approach, we trained three classical machine learning algorithms and one neural network using the embeddings generated by the TSFM called Moment for predicting the remaining useful life of aircraft engines. We test the models trained with both the full training dataset and only 10% of the training samples. Our results show that training simple models, such as support vector regressors or neural networks, with embeddings generated by Moment not only accelerates the training process but also enhances performance in few-shot learning scenarios, where data is scarce. This suggests a promising alternative to complex deep learning architectures, particularly in industrial contexts with limited labeled data.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Remaining useful life</kwd>
<kwd>foundation models</kwd>
<kwd>time series forecasting</kwd>
<kwd>benchmark</kwd>
<kwd>predictive maintenance</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>Spanish Government and FEDER funds</funding-source>
<award-id>PID2021-124502OB-C42</award-id>
</award-group>
<award-group id="awg2">
<funding-source>Universidad de Cantabria</funding-source>
<award-id>BOC 18-10-2021</award-id>
</award-group></funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>In the context of Industry 4.0, predictive maintenance (PdM) emerges as a key component to optimize manufacturing processes by improving productivity and reducing costs. PdM harnesses the convergence of advanced technologies, such as the Internet of Things (IoT), real-time data analytics, and machine learning (ML) algorithms, to anticipate equipment failures before they occur. This enables industries to optimize maintenance plans, improve operational efficiency, and ensure the reliability of critical assets [<xref ref-type="bibr" rid="ref-1">1</xref>].</p>
<p>PdM mainly addresses three types of problems [<xref ref-type="bibr" rid="ref-2">2</xref>]: (1) anomaly detection, (2) failure diagnosis, and (3) prediction of the remaining useful life (RUL). Anomaly detection focuses on identifying potential failures that have recently occurred or are about to happen. Failure diagnosis seeks to determine the root cause of a problem, typically using root cause analysis (RCA) techniques. And RUL aims at estimating the time or number of operation cycles remaining before a system or component reaches the end of its operational life, making this one of the most challenging problems to be solved.</p>
<p>To address the problem of RUL prediction, two approaches are generally used: model-based methods and data-driven methods. The former relies on mathematical and physical principles and prior system knowledge to create predictive models. However, these methods can be complex, costly, and time-consuming due to the need for in-depth knowledge of the system. In contrast, data-driven methods explore the relationships between sensor data monitored and RUL values using historical data. But these, despite the numerous success cases mentioned in this survey [<xref ref-type="bibr" rid="ref-3">3</xref>], are also affected by certain inconveniences that hinder the building of accurate and reliable models while keeping the use of resources low. First, industrial assets operate under dynamically changing conditions, making it difficult to generalize prediction models [<xref ref-type="bibr" rid="ref-4">4</xref>]. Furthermore, the scarcity of labeled data poses a significant obstacle, as failures are rare events, and it is not always feasible to run the equipment until it fails to collect representative data [<xref ref-type="bibr" rid="ref-5">5</xref>]. In addition, when possible, the labeling work is labor-intensive, daunting, and time-consuming [<xref ref-type="bibr" rid="ref-3">3</xref>,<xref ref-type="bibr" rid="ref-6">6</xref>]. Finally, data sets are often unbalanced, with a high proportion of normal operating data and a low representation of failures, which can bias models [<xref ref-type="bibr" rid="ref-7">7</xref>].</p>
<p>In response to these limitations, recent advances in ML have introduced a range of innovative frameworks specifically designed to mitigate these challenges. One particularly effective strategy is the use of simulated or synthetic data, which enables the artificial replication of failure scenarios and the generation of full-lifecycle datasets in controlled environments. This approach not only reduces the reliance on costly and time-consuming real-world failure data but also facilitates model evaluation under diverse operational conditions without physically stressing the equipment [<xref ref-type="bibr" rid="ref-8">8</xref>]. Complementing this, semi-supervised learning methods&#x2014;such as likelihood-based pseudo-labelling&#x2014;have been developed to leverage large volumes of unlabelled sensor data while minimizing the need for manual annotation [<xref ref-type="bibr" rid="ref-9">9</xref>]. Hybrid approaches that integrate self-supervised and supervised learning techniques applied to incomplete lifecycle data have also demonstrated considerable effectiveness in extracting relevant degradation features from industrial environments [<xref ref-type="bibr" rid="ref-10">10</xref>]. Further strategies address the combined challenges of data scarcity and class imbalance through the integration of enhanced clustering techniques and synthetic oversampling [<xref ref-type="bibr" rid="ref-11">11</xref>]. To ensure model robustness across varying operational conditions, domain adaptation and transfer learning have been extensively explored to align data representations across multiple working environments, thereby improving generalizability [<xref ref-type="bibr" rid="ref-12">12</xref>]. Additionally, recent advances in uncertainty quantification have introduced probabilistic frameworks capable of estimating confidence in predictions, which is essential in safety-critical applications such as predictive maintenance [<xref ref-type="bibr" rid="ref-13">13</xref>]. Finally, an emerging direction combines several of these techniques within reinforcement learning-based frameworks. Recent studies have integrated synthetic data generation through data diffusion, Bayesian deep learning for uncertainty estimation, and active learning for sample selection, achieving significant improvements in prediction accuracy and reducing uncertainty by 15%&#x2013;42% [<xref ref-type="bibr" rid="ref-14">14</xref>].</p>
<p>Building upon these trends, the necessity to enhance generalization capabilities and reduce labeling costs has catalyzed interest in n-shot learning paradigms, including few-shot, one-shot, and zero-shot learning. Few-shot learning typically leverages transfer learning (use a pretrained model [<xref ref-type="bibr" rid="ref-15">15</xref>]) or meta-learning techniques to train models that can recognize new classes using only a handful of labeled examples, whereas one-shot learning requires just a single labeled instance, and zero-shot learning, none.</p>
<p>Foundation models (FMs) are a class of deep learning (DL) models that are pretrained on vast amounts of data, thus equipped with a wide range of general knowledge and patterns. To this end, these models serve as a versatile starting point for various tasks across different domains. These models have proven to be useful in predicting future values in time series, classifying, detecting anomalies, filling in missing data, or generating synthetic time series that mimic real data for simulation tasks [<xref ref-type="bibr" rid="ref-15">15</xref>]. Additionally, they are valuable for interpreting model outcomes and identifying root causes [<xref ref-type="bibr" rid="ref-16">16</xref>].</p>
<p>In this paper, we explore the use of TSFM as a means to reduce the reliance on large labeled datasets and to enable the development of accurate predictive models with lower computational and energy demands [<xref ref-type="bibr" rid="ref-17">17</xref>]. TSFMs offer a robust, pretrained basis for extracting relevant features from time series data, allowing for the construction of simple, competitive predictors with minimal training data. By leveraging the representational power of TSFMs, we aim to promote model reuse, minimize dataset-specific preprocessing&#x2014;often time-consuming and detrimental to generalizability&#x2014;and enhance robustness in real-world industrial scenarios, where failure events are scarce.</p>
<p>More specifically, in this work, we experimentally assess the potential of a hybrid architecture that leverages the feature extraction strengths of TSFMs in conjunction with lightweight, resource-efficient ML algorithms. To this end, we design and conduct four experiments using the CMAPSS dataset to determine whether such a combination can:
<list list-type="bullet">
<list-item>
<p>Match or surpass the predictive accuracy typically associated with DL models in time series regression problems, and significantly reduce training times compared to deep architectures based on recurrent or attention-based mechanisms.</p></list-item>
<list-item>
<p>Minimize the preprocessing tasks by restricting data preparation to the essential steps required by the learning algorithm, relying on the ability of FM to manage dynamic behaviors and noisy data present in real-world scenarios.</p></list-item>
<list-item>
<p>Utilize a reduced amount of labeled training data for building effective predictors, thereby mitigating the impact of the limited availability of annotated failure cases typically found in real-world industrial environments.</p></list-item>
</list></p>
<p>The performance of the proposed architecture is compared against 22 existing ML and DL models for RUL prediction on the CMAPSS dataset, selected from the recent literature.</p>
<p>This paper is organized as follows: <xref ref-type="sec" rid="s2">Section 2</xref> provides a background about artificial intelligence (AI) strategies followed to estimate the RUL, motivating the need and opportunity of using FM for this goal. <xref ref-type="sec" rid="s3">Section 3</xref> describes the methodology followed in this research. <xref ref-type="sec" rid="s4">Section 4</xref> details the experimentation conducted on the CMAPSS dataset, specifying the preprocessing tasks performed, the setting of models built, and their evaluation under the following metrics: RMSE, score, training time, and inference time. <xref ref-type="sec" rid="s5">Section 5</xref> discusses the findings of this study highlighting scenarios in which TSFM could be a promising alternative. Finally, <xref ref-type="sec" rid="s6">Section 6</xref> draws the conclusions of the paper and the next steps in our research.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related Works</title>
<p>Over the past decade, sensorisation and the adoption of AI techniques have revolutionized predictive maintenance, transforming the industrial sector significantly. The number of research surveys, both general and topic-specific, on PdM is vast, highlighting the importance of this field [<xref ref-type="bibr" rid="ref-2">2</xref>,<xref ref-type="bibr" rid="ref-18">18</xref>,<xref ref-type="bibr" rid="ref-19">19</xref>].</p>
<p>In the literature, we find PdM applications that employ all kind of AI approaches-supervised, unsupervised, and reinforcement learning-to analyze the large volume of data captured by real-time condition monitoring systems [<xref ref-type="bibr" rid="ref-20">20</xref>]. Within each paradigm, different algorithms from the ML and DL arena have been successfully applied. For instance, Li et al. [<xref ref-type="bibr" rid="ref-21">21</xref>] focused on the importance of accurately predicting the RUL of lithium-ion batteries using different algorithms. Their experimentation yielded that RNN (Recurrent Neural Network) and CNN (Convolutional Neural Network) present a good performance and ability for information extraction; SVR (Support Vector Regression) and ELM (Extreme Learning Machine) exhibit a good online updating ability and fast prediction; and AR (Auto-Regression) was the simplest algorithm with acceptable accuracy. Others, such as Ta&#x015F;c&#x0131; et al. [<xref ref-type="bibr" rid="ref-22">22</xref>] proposed a hybrid model for the RUL prediction before production lines stop. They used real-world high-dimensional data from IoT sensors, and among all the proposed methods, RF (Random Forests), an ensemble bagging method, turned out to perform best. Later, Dint&#x00E9;n et al. [<xref ref-type="bibr" rid="ref-23">23</xref>] used transformers to assess their effectiveness in anomaly detection and failure prediction, finding that the hybrid transformer-GRU (Gated Recurrent Unit) configuration delivers the highest accuracy, albeit at the cost of requiring the longest computational time for training. Also, Kim et al. [<xref ref-type="bibr" rid="ref-24">24</xref>] successfully implemented a transformer-based model to predict the RUL of lubricant used in operational rolling bearings. As Yu et al. [<xref ref-type="bibr" rid="ref-25">25</xref>] pointed out, when using transformers directly for failure prediction, the results often fail to meet expectations due to the sparsity of failure events within the datasets, leading to a model that learns temporally sparse features that do not adequately represent the complexity of failure prediction scenarios.</p>
<p>Despite the successes achieved so far, the intrinsic characteristics of industrial time series&#x2014;being inherently temporal and capturing the dynamics of complex systems and processes&#x2014;pose two major challenges in building robust and accurate predictive models. First, the scarcity of labeled datasets, which are also highly imbalanced due to the low frequency of failure events [<xref ref-type="bibr" rid="ref-5">5</xref>,<xref ref-type="bibr" rid="ref-15">15</xref>], often makes it difficult to construct a reliable and robust predictor, as pointed out by [<xref ref-type="bibr" rid="ref-25">25</xref>]. Second, the specificity of the behavior of each industrial asset limits the ability of the models to generalize. As previously mentioned, this has led the scientific community to propose innovative solutions to tackle these challenges, being one of these to develop adaptive approaches capable of transferring knowledge across different systems and operating conditions. Here is where TSFMs come into play&#x2013;large AI models inspired by LLMs such as BERT [<xref ref-type="bibr" rid="ref-26">26</xref>] and GPT-3 [<xref ref-type="bibr" rid="ref-27">27</xref>], but specifically adapted for time series analysis [<xref ref-type="bibr" rid="ref-28">28</xref>]. One of their key advantages is that these models can be fine-tuned or adapted to specific tasks with relatively small amounts of task-specific data (few-shot learning) [<xref ref-type="bibr" rid="ref-29">29</xref>].</p>
<p>Recently, LLMs combining time series with textual prompts have achieved promising performance in TSFM. One approach represents time series as patches and leverages pretrained models for prediction [<xref ref-type="bibr" rid="ref-15">15</xref>]. Another research direction focuses on aligning embeddings between time series and textual data. This is the case of TimeCMA [<xref ref-type="bibr" rid="ref-30">30</xref>] that proposes a framework that uses dual-modality coding, combining time series embeddings generated with a transformer with embeddings obtained from textual cues in a pretrained LLM, improving accuracy and reducing computational costs. The transformer time-series attention is local and variable-specific, whereas LLM textual attention is universal and captures global dependencies between variables. Another proposal is TGForecaster [<xref ref-type="bibr" rid="ref-31">31</xref>], a robust baseline model that fuses textual cues, such as channel descriptions and dynamic news, and time series data using cross-attention mechanisms. Another approach is taken by TimeLLM [<xref ref-type="bibr" rid="ref-29">29</xref>] that adapts LLMs for time series forecasting by transforming time series into text prototypes and using the prompt-as-prefix technique to guide the transformation with natural language instructions. Other strategies convert the numerical input and output into prompts, and the forecasting task is framed in a sentence-to-sentence manner, making it possible to directly apply language models for forecasting purposes, such as PromptCast [<xref ref-type="bibr" rid="ref-32">32</xref>]. Finally, other models entirely rely on textual information for forecasting [<xref ref-type="bibr" rid="ref-33">33</xref>].</p>
<p>Subsequently, LLMs designed exclusively for time series data emerged, with Moment [<xref ref-type="bibr" rid="ref-34">34</xref>] being an outstanding example. Moment is a family of high-capacity transformer models pretrained on extensive time series datasets from diverse domains using a masked time series prediction task. In contrast to TimeCMA and TimeLLM, which may struggle with modelling long-term dependencies and capturing multi-scale temporal variations, Moment takes advantage of advanced pretraining techniques on large time series corpora, resulting in more robust and generalisable representations. Furthermore, its masked time series prediction task enhances the model&#x2019;s ability to handle missing and noisy data, challenges frequently encountered in industrial applications. These capabilities enable Moment to surpass previous models in accuracy and adaptability across various time series analysis tasks, including forecasting, classification, and anomaly detection. Moreover, while the majority of the TSFM focuses on time series forecasting, Moment also offers representational learning, which allows users to obtain the values of the latent space where the most important characteristics of the time series are captured, making it a good feature extraction method that requires no training. This was the main reason for selecting this TSFM for our benchmark.</p>
<p>Another multipurpose model that covers forecasting, classification, regression or embedding generation is TOTEM [<xref ref-type="bibr" rid="ref-35">35</xref>]. TOTEM explores time series unification through discrete tokens instead of patches as used in allM4TS [<xref ref-type="bibr" rid="ref-36">36</xref>] and LLM4TS [<xref ref-type="bibr" rid="ref-37">37</xref>]. Its VQVAE (Vector Quantized Variational Autoencoders) backbone learns a fixed codebook of tokens over a multi-domain corpus of time series data independently from the training of any downstream model. This disentangles the choice of data representation from the choice of task-specific architecture and permits the learning of representations from a large, diverse set of data, which aids in zero-shot generalization. However, as far as we know, the authors have not yet published a pretrained version of the model.</p>
</sec>
<sec id="s3">
<label>3</label>
<title>Methodology</title>
<p>Modern DL architectures such as transformers are revolutionizing the world of AI and time series predictions thanks to the multi-head self-attention mechanism introduced in [<xref ref-type="bibr" rid="ref-38">38</xref>], which can capture really complex non-linear relationships in the data and retain long-term relationships in sequences. However, the training of this kind of architecture requires a vast amount of data and extremely powerful specific hardware (such as GPUs, NPUs, or TPUs), making it very costly and time-consuming when compared to traditional ML models. This makes these models more difficult, when not impossible, to implement in fields like PdM, where the failure events are scarce in the datasets and cost reduction is of utmost importance.</p>
<p>Recently, TSFM have emerged, offering zero-shot forecasting and embedding generation for time series data. These models can help overcome the need to train these complex architectures from scratch. In this paper, we aim to experimentally validate whether a hybrid architecture that combines the feature extraction capabilities of TSFM with lightweight and less resource-intensive ML models can achieve the following goals:
<list list-type="bullet">
<list-item>
<p>Improve or, at least, maintain the prediction performance achieved by DL models in time series regression tasks.</p></list-item>
<list-item>
<p>Minimize the preprocessing tasks by restricting data preparation to the essential steps required by the learning algorithm.</p></list-item>
<list-item>
<p>Minimize the amount of data needed to train the predictors (few-shot).</p></list-item>
<list-item>
<p>Reduce training times compared to DL architectures based on recurrence and attention mechanisms.</p></list-item>
</list></p>
<p>To test our proposal, we designed the following benchmark. First, we chose a well-known RUL dataset, CMAPSS. Then, we selected four ML models from different paradigms: Random Forest, Light Gradient Boosting Machine, Support Vector Regressor, and a simple 1-hidden-layer Perceptron Neural Network. Next, we defined three scenarios to build a predictor with each model:
<list list-type="simple">
<list-item><label>1.</label><p>Using the full original data set.</p></list-item>
<list-item><label>2.</label><p>Using the embeddings generated by Moment on the full dataset.</p></list-item>
<list-item><label>3.</label><p>Using the embedding generated by Moment but only using a 10% of the original number of events (few-shot).</p></list-item>
</list></p>
<p>The 10% subset was selected based on a heuristic, experience-driven approximation, considering that the smallest dataset contains data of about 100 engines. Training with labeled data of 10 engines was deemed sufficient to simulate a realistic few-shot learning scenario while ensuring enough variability for model evaluation (see Experiment 3 in <xref ref-type="sec" rid="s4_5_3">Section 4.5.3</xref>).</p>
<p>The predictive performance of the models is evaluated according to the RMSE and the score achieved with the test dataset. Furthermore, eighteen DL and ML models found in the literature for RUL prediction on this dataset were selected to do an honest comparison. Additionally, we measure the training time and inference time to know the computational cost and power consumption of each model.</p>
<p><xref ref-type="sec" rid="s4">Section 4</xref> describes step-by-step the process followed and shows the measured metrics. Next, <xref ref-type="sec" rid="s5">Section 5</xref> discusses the results and draws the main insights extracted from the benchmark.</p>
</sec>
<sec id="s4">
<label>4</label>
<title>Experimentation</title>
<p>First, we graphically illustrate the process used to evaluate our approach with the CMAPSS dataset, from the data preparation phase to the result analysis (see <xref ref-type="fig" rid="fig-1">Fig. 1</xref>). Based on this figure, we then describe the experimentation step by step.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Workflow followed to carry out this benchmark</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_65461-fig-1.tif"/>
</fig>
<p>CMAPSS is a well-known synthetic benchmark dataset for the RUL prediction of a type of jet engine released by NASA for the PHM08 data challenge. It contains 4 sub-datasets composed by 26 numerical columns and a target variable representing the RUL. These variables are measured once every operational cycle, and the RUL column represents the number of operational cycles before the failure of the engine. The 4 sub-datasets contain some differences, such as varying working conditions or fault modes. These differences between the sub-datasets are summarized in <xref ref-type="table" rid="table-1">Table 1</xref>.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>CMAPSS sub-datasets characteristics</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead align="center" valign="top">
<tr>
<th></th>
<th>FD001</th>
<th>FD002</th>
<th>FD003</th>
<th>FD004</th>
</tr>
</thead>
<tbody align="center" valign="top">
<tr>
<td><bold>Train engines</bold></td>
<td>100</td>
<td>260</td>
<td>100</td>
<td>249</td>
</tr>
<tr>
<td><bold>Test engines</bold></td>
<td>100</td>
<td>259</td>
<td>100</td>
<td>248</td>
</tr>
<tr>
<td><bold>Operating conditions</bold></td>
<td>1</td>
<td>6</td>
<td>1</td>
<td>6</td>
</tr>
<tr>
<td><bold>Fault modes</bold></td>
<td>1</td>
<td>1</td>
<td>2</td>
<td>2</td>
</tr>
</tbody>
</table>
</table-wrap>
<sec id="s4_1">
<label>4.1</label>
<title>Run-to-Failure Experiment Extraction</title>
<p>Each sub-dataset contains multiple trajectories (a.k.a. experiments), each one corresponding to a different engine. To ensure proper data inspection and analysis, it is essential to separate the experiments so that data from different engines do not overlap or mix during normalisation or sequence creation. In this case, the dataset provides a trajectory identifier, which we use to split the data accordingly.</p>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Exploratory Data Analysis</title>
<p>Once each run-to-failure experiment was isolated, we analysed how the different variables evolve. Each plot, presented in <xref ref-type="fig" rid="fig-5">Figs. A1</xref>&#x2013;<xref ref-type="fig" rid="fig-8">A4</xref> in the Appendix, has 100 lines, each one representing the evolution of the feature for one turbofan engine in the FD001 sub-dataset during its useful life. These figures display the values of each variable, aligning the experiments at the end of the RUL (RUL &#x003D; 0). The variables are categorized into four groups according to their behavior when the engine is near failure: variables with increasing trend, variables with decreasing trend, and the rest with random or stationary trend. These two last groups may not offer valuable information; in fact, they may add noise to the model, which negatively affects the predictions. However, as the aim is to reduce the preprocessing tasks to a minimum for both reducing costs and validating the capacity of FM to discard them, we will keep all the variables of the set.</p>
</sec>
<sec id="s4_3">
<label>4.3</label>
<title>Data Preparation</title>
<p>Next, we carried out a minimal set of preprocessing techniques during the data preparation phase to ensure the data was suitable for model input. For this task, we adopted a straightforward three-step approach: (1) missing value imputation, (2) data normalisation, and (3) sequence creation.</p>
<p>First, we addressed missing value imputation, as ML models cannot process them directly. Since this dataset contains no null values, we bypassed this step without applying any modifications to the training data.</p>
<p>Next, we normalized the data so that the input features were in the same range of values. We applied Z-score normalization according to <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref>.
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mi>z</mml:mi><mml:mrow><mml:mtext>-</mml:mtext></mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03BC;</mml:mi></mml:mrow><mml:mi>&#x03C3;</mml:mi></mml:mfrac><mml:mspace width="1em" /><mml:mrow><mml:mtext>where&#xA0;</mml:mtext></mml:mrow><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mtext>&#xA0;is the mean and&#xA0;</mml:mtext></mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mtext>&#xA0;is the standard deviation.</mml:mtext></mml:mrow></mml:math></disp-formula></p>
<p>Finally, as we are working with time series data, the temporal evolution of the variables must be taken into account and not just the last event reported. Therefore, we had to provide the model with all the events that comprise each observation window. To achieve this, a sliding window transformation (see <xref ref-type="fig" rid="fig-2">Fig. 2</xref>) was applied to the dataset. We chose two different values for the window size, 30 and 60. In [<xref ref-type="bibr" rid="ref-39">39</xref>], the authors found out that 30 was the optimal window size for this problem, however, since Moment is such a large and complex model, we tried 60 to check if the model could take advantage of the extra information added to the sequence.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Example of application of the sliding window algorithm with window size &#x003D; 4 and stride &#x003D; 1</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_65461-fig-2.tif"/>
</fig>
</sec>
<sec id="s4_4">
<label>4.4</label>
<title>Model Design and Training</title>
<p>As mentioned earlier, recent trends have focused on developing increasingly complex deep learning models to enhance prediction accuracy. However, this comes at the cost of higher computational demands for both training and inference, as well as the need for larger datasets. While the gain in accuracy may be desirable, these DL models are not always the best alternative for PdM problems, where the scarcity of failure data limits the generalisation capability of these models.</p>
<p>The arrival of TSFM, that have been proven to perform forecast, imputation, or representational learning in zero-shot scenarios successfully [<xref ref-type="bibr" rid="ref-34">34</xref>], can be a way to exploit the potential of the new complex transformer-based architectures without having to deal with costly training. Our proposal, see <xref ref-type="fig" rid="fig-3">Fig. 3</xref>, uses a TSFM to create embeddings of the input data previously preprocessed that are used to train a simpler ML model. This strategy helps us reduce the training time and partially overcome the scarcity of failure data since these simpler models tend to require fewer samples to train (fewer parameters must be tuned).</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Architecture of the proposed hybrid model. Preprocessed sequences are first encoded into embeddings using the TSFM, which are subsequently used to train a machine learning model. The model outputs are then post-processed using a moving average filter to smooth the predictions</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_65461-fig-3.tif"/>
</fig>
<p>Specifically, we compare four fundamental ML models trained on embeddings generated by the Moment model against the same models and several more advanced DL ones trained on the preprocessed dataset. We chose Moment TSFM because, as mentioned in <xref ref-type="sec" rid="s2">Section 2</xref>, it beats almost any available competitor in forecasting accuracy, and it is the only open-source model, as far as we know, that offers a representational learning version that can be directly used for embedding creation. Moreover, this does not require the time or sampling frequency to be specified, which is particularly useful for the CMAPSS dataset, whose events do not include the time, but the operating cycle number.</p>
<p>The training and inference of each model was performed in a two-step process where the TSFM first converts two-dimensional sequences into a one-dimensional embedding vector that can be used as input for the ML models; and then, the training dataset converted to embeddings, along with the original RUL values, is used to train each ML model.</p>
<p>We chose the following four ML models: RF, SVR, NN and LGBM. Each model was tuned using an exhaustive grid search over the hyperparameter ranges specified in <xref ref-type="table" rid="table-9">Tables A1</xref>&#x2013;<xref ref-type="table" rid="table-12">A4</xref>, respectively, in combination with 5-fold cross-validation. This strategy was adopted to ensure a robust hyperparameter optimization process and to minimize the variability introduced by random parameter initialization. Grid search systematically explores a wide set of values for each hyperparameter, and has been proven effective in identifying optimal configurations [<xref ref-type="bibr" rid="ref-40">40</xref>,<xref ref-type="bibr" rid="ref-41">41</xref>]. Meanwhile, 5-fold cross-validation partitions the training set into five equal subsets, iteratively training the model on four folds and validating it on the remaining one. The average of the evaluation metrics over the five folds provides a more stable and reliable estimate of model performance, reducing the sensitivity to randomness in both the train-test data split and model initialization.</p>
<p>For the inference, the TSFM and the trained regressor were pipelined in a model wrapper that implements the <monospace>Estimator</monospace> interface of the sci-kit learn package so, the new data could be passed directly as a sequence to the wrapper. In addition, as a consequence of the fact that the predictions of the first models were unstable and noisy (see <xref ref-type="fig" rid="fig-4">Fig. 4</xref>), we implemented a moving average to control the oscillations of the predictions and to reduce the error.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Predictions of the models for 9 experiments from FD004 dataset. Blue line represents the predicted values, orange line the smoothed predictions and green line the ground truth</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_65461-fig-4.tif"/>
</fig>
</sec>
<sec id="s4_5">
<label>4.5</label>
<title>Models Evaluation</title>
<p>This experimentation shows and compares the 32 models built using two common metrics, the Root Mean Squared Error (see <xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref>) and the score provided in the PHM08 data challenge, where the dataset was first published. The RMSE is the standard metric for regression tasks, and the score is an asymmetric metric specific to this problem that punishes overestimations more than underestimation which is formulated according to <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>.
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mi>R</mml:mi><mml:mi>M</mml:mi><mml:mi>S</mml:mi><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:msqrt><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mn>2</mml:mn></mml:msup></mml:msqrt></mml:math></disp-formula>
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mi>S</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"><mml:mtr><mml:mtd><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mi>d</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mtext>for&#xA0;</mml:mtext></mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mi>d</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mtext>for&#xA0;</mml:mtext></mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow><mml:mspace width="2em" /><mml:mrow><mml:mtext>where&#xA0;</mml:mtext></mml:mrow><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mover><mml:mrow><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:mi>L</mml:mi></mml:mrow><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:mi>L</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#xA0;</mml:mtext><mml:mi>a</mml:mi><mml:mn>1</mml:mn><mml:mo>=</mml:mo><mml:mn>13</mml:mn><mml:mrow><mml:mtext>&#xA0;and&#xA0;</mml:mtext></mml:mrow><mml:mi>a</mml:mi><mml:mn>2</mml:mn><mml:mo>=</mml:mo><mml:mn>10</mml:mn></mml:math></disp-formula></p>
<p>The results are analyzed through four distinct experiments, each designed to address the following research questions:
<list list-type="bullet">
<list-item>
<p>Experiment 1: To what extent does the embedding strategy enhance the RMSE and score achieved by the ML models?</p></list-item>
<list-item>
<p>Experiment 2: How well do the embedding-based models perform compared to the ML and DL models found in the literature? Is it possible to reduce the preprocessing tasks to the essential steps required by the learning algorithm?</p></list-item>
<list-item>
<p>Experiment 3: How robust are the models trained under the few-shot learning paradigm?</p></list-item>
<list-item>
<p>Experiment 4: How much time and power are saved by using ML techniques instead of DL models?</p></list-item>
</list></p>
<sec id="s4_5_1">
<label>4.5.1</label>
<title>Experiment 1: Model Performance with and without Embeddings</title>
<p>First, we compare the results obtained by training the models using the data directly after normalization and sequence generation with those obtained using the Moment-generated embeddings. As can be observed in <xref ref-type="table" rid="table-2">Table 2</xref> our approach of using embeddings fails to improve the performance of tree-based models, i.e., Gradient Boosting Machine and Random Forest. However, it improves the RMSE of SVR models in the two more complex datasets, FD002 and FD004. It is also worth noting, see <xref ref-type="table" rid="table-3">Table 3</xref>, that in other works such as [<xref ref-type="bibr" rid="ref-42">42</xref>] the authors get much worse RMSE using SVR and NN (rows 2 and 3). We think the authors used only the last event or an aggregation of the observation window as input for the models, whereas we used the whole observation window flattened. However, the authors describe this issue neither in their article nor in the reference to the code, thus it could not be verified.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Performance comparison of ML models using embeddings vs. original time series data. These models were trained with window size 30 and 60. The lowest RMSE and score for each technique is highlighted in bold</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead align="center" valign="top">
<tr>
<th>Model</th>
<th colspan="2">FD001</th>
<th colspan="2">FD002</th>
<th colspan="2">FD003</th>
<th colspan="2">FD004</th>
</tr>
<tr>
<th></th>
<th>RMSE</th>
<th>Score</th>
<th>RMSE </th>
<th>Score</th>
<th>RMSE</th>
<th>Score</th>
<th>RMSE</th>
<th>Score</th>
</tr>
</thead>
<tbody align="center" valign="top">
<tr>
<td>LGBM (W60)</td>
<td><bold>12.97</bold></td>
<td>248</td>
<td><bold>18.47</bold></td>
<td>1158</td>
<td><bold>11.87</bold></td>
<td>776</td>
<td><bold>15.75</bold></td>
<td>1935</td>
</tr>
<tr>
<td>LGBM (W30)</td>
<td>14.50</td>
<td>336</td>
<td>19.08</td>
<td>1297</td>
<td>13.05</td>
<td>836</td>
<td>16.44</td>
<td>2009</td>
</tr>
<tr>
<td>LGBM (W60 embeddings)</td>
<td>17.69</td>
<td>804</td>
<td>31.07</td>
<td>7951</td>
<td>15.43</td>
<td>1551</td>
<td>27.10</td>
<td>19,642</td>
</tr>
<tr>
<td>LGBM (W30 embeddings)</td>
<td>17.98</td>
<td>1848</td>
<td>26.77</td>
<td>5474</td>
<td>16.08</td>
<td>4625</td>
<td>23.32</td>
<td>12,204</td>
</tr>
<tr>
<td>Random Forest (W60)</td>
<td>15.23</td>
<td>362</td>
<td>21.42</td>
<td>1536</td>
<td>13.8</td>
<td>895</td>
<td>18.34</td>
<td>5086</td>
</tr>
<tr>
<td>Random forest (W30)</td>
<td><bold>14.05</bold></td>
<td>948</td>
<td><bold>17.56</bold></td>
<td>1624</td>
<td><bold>12.03</bold></td>
<td>1093</td>
<td><bold>14.70</bold></td>
<td>2627</td>
</tr>
<tr>
<td>Random forest (W60 embeddings)</td>
<td>18.67</td>
<td>1604</td>
<td>34.05</td>
<td>14,167</td>
<td>16.64</td>
<td>2306</td>
<td>30.00</td>
<td>34,970</td>
</tr>
<tr>
<td>Random forest (W30 embeddings)</td>
<td>16.29</td>
<td>3576</td>
<td>26.83</td>
<td>10,895</td>
<td>14.60</td>
<td>7061</td>
<td>23.21</td>
<td>24,255</td>
</tr>
<tr>
<td>SVR (W60)</td>
<td>12.79</td>
<td>663</td>
<td>27.77</td>
<td>6,603</td>
<td>11</td>
<td>594</td>
<td>24.84</td>
<td>27,234</td>
</tr>
<tr>
<td>SVR (W30)</td>
<td><bold>11.00</bold></td>
<td>420</td>
<td>23.70</td>
<td>9621</td>
<td><bold>10.52</bold></td>
<td>701</td>
<td>21.89</td>
<td>16,774</td>
</tr>
<tr>
<td>SVR (W60 embeddings)</td>
<td>16.63</td>
<td>8295</td>
<td>24.64</td>
<td>6025</td>
<td>14.00</td>
<td>1497</td>
<td>21.93</td>
<td>11,791</td>
</tr>
<tr>
<td>SVR (W30 embeddings)</td>
<td>15.17</td>
<td>1655</td>
<td><bold>19.79</bold></td>
<td>2641</td>
<td>13.18</td>
<td>2061</td>
<td><bold>16.37</bold></td>
<td>6032</td>
</tr>
<tr>
<td>NN (W60)</td>
<td>12.57</td>
<td>650</td>
<td>21.38</td>
<td>5400</td>
<td>10.82</td>
<td>307</td>
<td>19.24</td>
<td>11,913</td>
</tr>
<tr>
<td>NN (W30)</td>
<td><bold>10.29</bold></td>
<td>418</td>
<td><bold>17.71</bold></td>
<td>3210</td>
<td><bold>9.13</bold></td>
<td>537</td>
<td>16.51</td>
<td>15,596</td>
</tr>
<tr>
<td>NN (W60 embeddings)</td>
<td>17.42</td>
<td>752</td>
<td>21.59</td>
<td>3199</td>
<td>14.81</td>
<td>3385</td>
<td>21.25</td>
<td>97,578</td>
</tr>
<tr>
<td>NN (W30 embeddings)</td>
<td>15.04</td>
<td>1912</td>
<td>20.99</td>
<td>4480</td>
<td>12.66</td>
<td>6834</td>
<td><bold>16.36</bold></td>
<td>28,089</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Comparison of models based on RMSE and score across the four full CMAPSS datasets. Best model in each category is bold</title>
</caption>
<table>
<colgroup>
<col/>
<col align="center"/>
<col/>
<col align="center"/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col align="center"/>
</colgroup>
<thead align="center" valign="top">
<tr>
<th></th>
<th align="center">Model</th>
<th>Year</th>
<th align="center">Preprocessing steps</th>
<th colspan="2">FD001</th>
<th colspan="2">FD002</th>
<th colspan="2">FD003</th>
<th colspan="2">FD004</th>
</tr>
<tr>
<th></th>
<th></th>
<th></th>
<th></th>
<th>RMSE</th>
<th>Score</th>
<th>RMSE</th>
<th>Score</th>
<th>RMSE</th>
<th>Score</th>
<th>RMSE</th>
<th>Score</th>
</tr>
</thead>
<tbody align="center" valign="top">
<tr>
<td>1</td>
<td>CNN [<xref ref-type="bibr" rid="ref-45">45</xref>]</td>
<td>2016</td>
<td>&#x2013;</td>
<td>18.44</td>
<td>129</td>
<td>30.29</td>
<td>1360</td>
<td>19.81</td>
<td>160</td>
<td>29.15</td>
<td>7890</td>
</tr>
<tr>
<td>2</td>
<td>SVR [<xref ref-type="bibr" rid="ref-42">42</xref>]</td>
<td>2017</td>
<td>&#x2013;</td>
<td>20.96</td>
<td>1380</td>
<td>42.00</td>
<td>590,000</td>
<td>21.05</td>
<td>1600</td>
<td>45.35</td>
<td>371,000</td>
</tr>
<tr>
<td>3</td>
<td>MLP [<xref ref-type="bibr" rid="ref-42">42</xref>]</td>
<td>2017</td>
<td>&#x2013;</td>
<td>37.56</td>
<td>18,000</td>
<td>80.03</td>
<td>7,800,000</td>
<td>37.39</td>
<td>17,400</td>
<td>77.37</td>
<td>5,620,000</td>
</tr>
<tr>
<td>4</td>
<td>LSTM [<xref ref-type="bibr" rid="ref-42">42</xref>]</td>
<td>2017</td>
<td>&#x2013;</td>
<td>16.14</td>
<td>338</td>
<td>24.49</td>
<td>4450</td>
<td>16.18</td>
<td>852</td>
<td>28.17</td>
<td>5550</td>
</tr>
<tr>
<td>5</td>
<td>BiLSTM [<xref ref-type="bibr" rid="ref-46">46</xref>]</td>
<td>2018</td>
<td>&#x2013;</td>
<td>13.65</td>
<td>238</td>
<td>23.18</td>
<td>4130</td>
<td>13.74</td>
<td>314</td>
<td>24.86</td>
<td>5.43</td>
</tr>
<tr>
<td>6</td>
<td>DAG [<xref ref-type="bibr" rid="ref-47">47</xref>]</td>
<td>2019</td>
<td>Feature selection</td>
<td>11.96</td>
<td>229</td>
<td>20.34</td>
<td>2735</td>
<td>12.46</td>
<td>535</td>
<td>22.43</td>
<td>3370</td>
</tr>
<tr>
<td>7</td>
<td>CNN&#x002B;LSTM [<xref ref-type="bibr" rid="ref-48">48</xref>]</td>
<td>2019</td>
<td>Feature selection, Health indicator</td>
<td>16.16</td>
<td>303</td>
<td>20.44</td>
<td>344</td>
<td>17.12</td>
<td>142</td>
<td>23.25</td>
<td>463</td>
</tr>
<tr>
<td><bold>8</bold></td>
<td><bold>Random forest</bold> [<xref ref-type="bibr" rid="ref-44">44</xref>]</td>
<td><bold>2020</bold></td>
<td><bold>Data smoothing using polynomial fitting, feature selection, feature extraction, non-overlapping rolling window</bold></td>
<td><bold>12.01</bold></td>
<td><bold>180</bold></td>
<td><bold>22.17</bold></td>
<td><bold>2020</bold></td>
<td><bold>11.19</bold></td>
<td><bold>175</bold></td>
<td><bold>25.23</bold></td>
<td><bold>3,700</bold></td>
</tr>
<tr>
<td>9</td>
<td>Multi-head CNN &#x002B; LSTM [<xref ref-type="bibr" rid="ref-49">49</xref>]</td>
<td>2020</td>
<td>Feature selection</td>
<td>12.19</td>
<td>259</td>
<td>19.93</td>
<td>4350</td>
<td>12.85</td>
<td>343</td>
<td>22.89</td>
<td>4340</td>
</tr>
<tr>
<td>10</td>
<td>CNN &#x002B; LSTM &#x002B; BiLSTM [<xref ref-type="bibr" rid="ref-50">50</xref>]</td>
<td>2020</td>
<td>Feature selection</td>
<td>10.41</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>11</td>
<td>AGCNN [<xref ref-type="bibr" rid="ref-51">51</xref>]</td>
<td>2020</td>
<td>Feature selection</td>
<td>12.42</td>
<td>225</td>
<td>19.43</td>
<td>1494</td>
<td>13.39</td>
<td>227</td>
<td>21.5</td>
<td>3390</td>
</tr>
<tr>
<td>12</td>
<td>LSTM &#x002B; FCLCNN [<xref ref-type="bibr" rid="ref-52">52</xref>]</td>
<td>2021</td>
<td>Feature selection</td>
<td>11.17</td>
<td>204</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>9.99</td>
<td>243</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>13</td>
<td>Hybrid model [<xref ref-type="bibr" rid="ref-53">53</xref>]</td>
<td>2021</td>
<td>Feature selection</td>
<td>15.68</td>
<td>&#x2013;</td>
<td>22.26</td>
<td>&#x2013;</td>
<td>16.89</td>
<td>&#x2013;</td>
<td>22.32</td>
<td>&#x2013;</td>
</tr>
<tr>
<td><bold>14</bold></td>
<td><bold>BLS &#x002B; TCN</bold> [<xref ref-type="bibr" rid="ref-54">54</xref>]</td>
<td><bold>2022</bold></td>
<td><bold>Feature selection</bold></td>
<td><bold>12.08</bold></td>
<td><bold>243</bold></td>
<td><bold>16.87</bold></td>
<td><bold>1280</bold></td>
<td><bold>11.43</bold></td>
<td><bold>244</bold></td>
<td><bold>18.12</bold></td>
<td><bold>2090</bold></td>
</tr>
<tr>
<td>15</td>
<td>Bi-LSTM attention [<xref ref-type="bibr" rid="ref-55">55</xref>]</td>
<td>2022</td>
<td>Feature selection</td>
<td>13.78</td>
<td>255</td>
<td>15.94</td>
<td>1280</td>
<td>14.36</td>
<td>438</td>
<td>16.96</td>
<td>1650</td>
</tr>
<tr>
<td>16</td>
<td>Multi-dimensional attention &#x002B; LSTM [<xref ref-type="bibr" rid="ref-39">39</xref>]</td>
<td>2022</td>
<td>Operational settings cluster based normalization</td>
<td>11.43</td>
<td>209</td>
<td>13.32</td>
<td>1060</td>
<td>11.47</td>
<td>187</td>
<td>14.38</td>
<td>1620</td>
</tr>
<tr>
<td>17</td>
<td>LSTM [<xref ref-type="bibr" rid="ref-43">43</xref>]</td>
<td>2022</td>
<td>Feature selection, Median filter</td>
<td>13.5</td>
<td>238</td>
<td>23.37</td>
<td>2600</td>
<td>13.54</td>
<td>411</td>
<td>23.36</td>
<td>3970</td>
</tr>
<tr>
<td><bold>18</bold></td>
<td><bold>LSTM with automatic piecewise RUL function</bold> [<xref ref-type="bibr" rid="ref-43">43</xref>]</td>
<td><bold>2023</bold></td>
<td><bold>Feature selection, Median filter smoothing, auto piecewise RUL function</bold></td>
<td><bold>7.78</bold></td>
<td><bold>102</bold></td>
<td><bold>17.64</bold></td>
<td><bold>1440</bold></td>
<td><bold>8.03</bold></td>
<td><bold>104</bold></td>
<td><bold>17.63</bold></td>
<td><bold>2390</bold></td>
</tr>
<tr>
<td>19</td>
<td>ConvGat [<xref ref-type="bibr" rid="ref-56">56</xref>]</td>
<td>2024</td>
<td>&#x2013;</td>
<td>11.34</td>
<td>197</td>
<td>14.12</td>
<td>771</td>
<td>10.97</td>
<td>235</td>
<td>15.51</td>
<td>1231</td>
</tr>
<tr>
<td>20</td>
<td>3D Attention enhanced CNN-BiLSTM [<xref ref-type="bibr" rid="ref-57">57</xref>]</td>
<td>2024</td>
<td>&#x2013;</td>
<td>13.11</td>
<td>231</td>
<td>13.92</td>
<td>759</td>
<td>12.15</td>
<td>195</td>
<td>20.23</td>
<td>1718</td>
</tr>
<tr>
<td>21</td>
<td>MSA-FCN [<xref ref-type="bibr" rid="ref-58">58</xref>]</td>
<td>2024</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>17.17</td>
<td>1395</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>19.40</td>
<td>2184</td>
</tr>
<tr>
<td><bold>22</bold></td>
<td><bold>DFAGCN</bold> [<xref ref-type="bibr" rid="ref-59">59</xref>]</td>
<td><bold>2024</bold></td>
<td><bold>&#x2013;</bold></td>
<td><bold>11.21</bold></td>
<td><bold>175</bold></td>
<td><bold>13.05</bold></td>
<td><bold>683</bold></td>
<td><bold>11.23</bold></td>
<td><bold>188</bold></td>
<td><bold>14.01</bold></td>
<td><bold>855</bold></td>
</tr>
<tr>
<td colspan="12">Proposed</td>
</tr>
<tr>
<td>23</td>
<td>SVR (W30 embeddings)</td>
<td>2025</td>
<td>&#x2013;</td>
<td>15.17</td>
<td>1655</td>
<td>19.79</td>
<td>2641</td>
<td>13.18</td>
<td>2061</td>
<td>16.37</td>
<td>6032</td>
</tr>
<tr>
<td>24</td>
<td>NN (W30 embeddings)</td>
<td>2025</td>
<td>&#x2013;</td>
<td>15.04</td>
<td>1912</td>
<td>20.99</td>
<td>4480</td>
<td>12.66</td>
<td>6834</td>
<td>16.36</td>
<td>28,089</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Regarding the score, the use of embeddings worsens its value. This is a twofold problem. First, the formula is computed as the sum of the scores for the last reading of each engine, which means that a bad prediction can greatly affect the final score. As seen in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>, the prediction suffers from many oscillations, which results in really high scores on certain engines. Second, we applied a moving average to the output of the models to control the oscillations. This helped us to reduce the RMSE. However, the score formula penalizes the overestimation of the RUL and, being RUL a monotonically decreasing function, the moving average produces a slight overestimation.</p>
<p>When analyzing the impact of the observation window size, the models trained using a sequence of length 30 provide better accuracy in most scenarios, which is in line with the study carried out in [<xref ref-type="bibr" rid="ref-39">39</xref>]. This proves that a longer observation window is not always beneficial and highlights the importance of carefully selecting the window size, even when using TSFM.</p>
<p>As a result of this first experiment, we can confidently say that the embedding strategy can help ML models to extract meaningful information in complex data scenarios. However, it is not appropriate for every kind of model, SVR being the model that takes greater advantage of the embedding generation, whereas the performance of the tree-based alternatives is negatively affected. Finally, the size of the sequence and the scoring metric can impact the usefulness of this approach.</p>
</sec>
<sec id="s4_5_2">
<label>4.5.2</label>
<title>Experiment 2: Embedding-Based ML Models vs. DL Models</title>
<p>To carry out the performance comparison of models trained with ML techniques concerning more sophisticated proposals based on DL, we rely on 22 recent models found in the literature. All these predictors are presented in chronological order in <xref ref-type="table" rid="table-3">Table 3</xref>-adapted from [<xref ref-type="bibr" rid="ref-43">43</xref>], and extended with additional references and our best proposed models, i.e., SRV and NN trained with embeddings and an observation window of 30 events. The table includes the type of model, preprocessing steps applied before training, and the RMSE and score obtained for each dataset. To maintain clarity, we have omitted the piecewise RUL function and the basic Z-score normalization, as these preprocessing steps are common to all works listed. In addition, to make the interpretation of the results easier, we include 4, which contains the difference in RMSE between our SVR and NN models as a percentage.</p>
<p>Models in <xref ref-type="table" rid="table-3">Tables 3</xref> and <xref ref-type="table" rid="table-4">4</xref> can be grouped in 4 categories according to the kind of technique used for their training: machine learning, simple deep learning, hybrid deep learning, and hybrid attention learning. Our proposal outperforms all the ML models (see rows 2, 3, and 8) except for the Random Forest presented in [<xref ref-type="bibr" rid="ref-44">44</xref>], which achieved a better performance in the FD001 and FD003 datasets by using a specific preprocessing.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>Error improvement rate of SVR and NN models (W30 embeddings with full dataset) compared to models found in the literature. Positive numbers indicate where our models achieve lower error. Best model in each category is bold</title>
</caption>
<table>
<colgroup>
<col/>
<col align="center"/>
<col/>
<col align="center"/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead align="center" valign="top">
<tr>
<th></th>
<th align="center">Model</th>
<th>Year</th>
<th align="center">Preprocessing steps</th>
<th colspan="2">FD001</th>
<th colspan="2">FD002</th>
<th colspan="2">FD003</th>
<th colspan="2">FD004</th>
</tr>
<tr>
<th></th>
<th></th>
<th></th>
<th></th>
<th>SVR</th>
<th>NN</th>
<th>SVR</th>
<th>NN</th>
<th>SVR</th>
<th>NN</th>
<th>SVR</th>
<th>NN</th>
</tr>
</thead>
<tbody align="center" valign="top">
<tr>
<td>1</td>
<td>CNN [<xref ref-type="bibr" rid="ref-45">45</xref>]</td>
<td>2016</td>
<td>&#x2013;</td>
<td><styled-content style-type="color" style="color: #339966;">17.73%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">18.44%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">34.66%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">30.70%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">33.47%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">36.09%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">43.84%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">43.88%</styled-content></td>
</tr>
<tr>
<td>2</td>
<td>SVR [<xref ref-type="bibr" rid="ref-42">42</xref>]</td>
<td>2017</td>
<td>&#x2013;</td>
<td><styled-content style-type="color" style="color: #339966;">27.62%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">28.24%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">52.88%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">50.02%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">37.39%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">39.86%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">63.90%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">63.93%</styled-content></td>
</tr>
<tr>
<td>3</td>
<td>MLP [<xref ref-type="bibr" rid="ref-42">42</xref>]</td>
<td>2017</td>
<td>&#x2013;</td>
<td><styled-content style-type="color" style="color: #339966;">59.61%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">59.96%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">75.27%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">73.77%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">64.75%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">66.14%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">78.84%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">78.85%</styled-content></td>
</tr>
<tr>
<td>4</td>
<td>LSTM [<xref ref-type="bibr" rid="ref-42">42</xref>]</td>
<td>2017</td>
<td>&#x2013;</td>
<td><styled-content style-type="color" style="color: #339966;">6.01%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">6.82%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">19.19%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">14.29%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">18.54%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">21.76%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">41.89%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">41.92%</styled-content></td>
</tr>
<tr>
<td>5</td>
<td>BiLSTM [<xref ref-type="bibr" rid="ref-46">46</xref>]</td>
<td>2018</td>
<td>&#x2013;</td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;11.14%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;10.18%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">14.62%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">9.45%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">4.08%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">7.86%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">34.15%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">34.19%</styled-content></td>
</tr>
<tr>
<td>6</td>
<td>DAG [<xref ref-type="bibr" rid="ref-47">47</xref>]</td>
<td>2019</td>
<td>Feature selection</td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;26.84%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;25.75%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">2.70%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;3.20%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;5.78%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;1.61%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">27.02%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">27.06%</styled-content></td>
</tr>
<tr>
<td>7</td>
<td>CNN &#x002B; LSTM [<xref ref-type="bibr" rid="ref-48">48</xref>]</td>
<td>2019</td>
<td>Feature selection. Health indicator</td>
<td><styled-content style-type="color" style="color: #339966;">6.13%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">6.93%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">3.18%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;2.69%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">23.01%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">26.05%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">29.59%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">29.63%</styled-content></td>
</tr>
<tr>
<td><bold>8</bold></td>
<td><bold>Random forest</bold> [<xref ref-type="bibr" rid="ref-44">44</xref>]</td>
<td><bold>2020</bold></td>
<td><bold>Data smoothing using polynomial fitting, feature selection, feature extraction, non overlapping rolling window</bold></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;26.31%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;25.23%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">10.74%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">5.32%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;17.78%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;13.14%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">35.12%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">35.16%</styled-content></td>
</tr>
<tr>
<td>9</td>
<td>Multi-head CNN &#x002B; LSTM [<xref ref-type="bibr" rid="ref-49">49</xref>]</td>
<td>2020</td>
<td>Feature selection</td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;24.45%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;23.38%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">0.70%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;5.32%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;2.57%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;1.48%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">28.48%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">28.53%</styled-content></td>
</tr>
<tr>
<td>10</td>
<td>CNN &#x002B; LSTM &#x002B; BiLSTM [<xref ref-type="bibr" rid="ref-50">50</xref>]</td>
<td>2020</td>
<td>Feature selection</td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;35.81%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;34.65%</styled-content></td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>11</td>
<td>AGCNN [<xref ref-type="bibr" rid="ref-51">51</xref>]</td>
<td>2020</td>
<td>Feature selection&#x2212;</td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;22.14%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;21.10%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;1.85%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;8.03%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">1.57%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">5.45%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">23.86%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">23.91%</styled-content></td>
</tr>
<tr>
<td>12</td>
<td>LSTM &#x002B; FCLCNN [<xref ref-type="bibr" rid="ref-52">52</xref>]</td>
<td>2021</td>
<td>Feature selection</td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;35.81%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;34.65%</styled-content></td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;31.93%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;26.73%</styled-content></td>
<td>&#x2013;</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>13</td>
<td>Hybrid model [<xref ref-type="bibr" rid="ref-53">53</xref>]</td>
<td>2021</td>
<td>Feature selection</td>
<td><styled-content style-type="color" style="color: #339966;">3.25%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">4.08%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">11.10%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">5.71%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">21.97%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">25.04%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">26.66%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">26.70%</styled-content></td>
</tr>
<tr>
<td><bold>14</bold></td>
<td><bold>BLS &#x002B; TCN</bold> [<xref ref-type="bibr" rid="ref-54">54</xref>]</td>
<td><bold>2022</bold></td>
<td><bold>Feature selection</bold></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;25.58%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;24.50%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;17.31%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;24.42%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;15.31%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;10.76%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">9.66%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">9.71%</styled-content></td>
</tr>
<tr>
<td>15</td>
<td>Bi&#x2212;LSTM attention [<xref ref-type="bibr" rid="ref-55">55</xref>]</td>
<td>2022</td>
<td>Feature selection</td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;10.09%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;9.14%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;24.15%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;31.68%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">8.22%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">11.84%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">3.48%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">3.54%</styled-content></td>
</tr>
<tr>
<td>16</td>
<td>Multi&#x2212;dimensional attention &#x002B; LSTM [<xref ref-type="bibr" rid="ref-39">39</xref>]</td>
<td>2022</td>
<td>Operational settings cluster based normalization</td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;32.72%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;31.58%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;48.57%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;57.58%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;14.91%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;10.37%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;13.84%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;13.77%</styled-content></td>
</tr>
<tr>
<td>17</td>
<td>LSTM [<xref ref-type="bibr" rid="ref-43">43</xref>]</td>
<td>2022</td>
<td>Feature selection. Median filter</td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;12.37%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;11.41%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">15.32%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">10.18%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">2.66%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">6.50%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">29.92%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">29.97%</styled-content></td>
</tr>
<tr>
<td><bold>18</bold></td>
<td><bold>LSTM with automatic piecewise RUL function</bold> [<xref ref-type="bibr" rid="ref-43">43</xref>]</td>
<td><bold>2022</bold></td>
<td><bold>Feature selection. Median filter smoothing. auto piecewise RUL function</bold></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;94.99%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;93.32%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;12.19%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;18.99%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;64.13%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;57.66%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">7.15%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">7.20%</styled-content></td>
</tr>
<tr>
<td>19</td>
<td>ConvGat [<xref ref-type="bibr" rid="ref-56">56</xref>]</td>
<td>2023</td>
<td>&#x2013;</td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;33.77%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;32.63%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;40.16%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;48.65%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;20.15%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;15.41%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;5.54%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;5.48%</styled-content></td>
</tr>
<tr>
<td>20</td>
<td>3D Attention enhanced CNN&#x2212;BiLSTM [<xref ref-type="bibr" rid="ref-57">57</xref>]</td>
<td>2024</td>
<td>&#x2013;</td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;15.71%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;14.72%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;42.17%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;50.79%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;8.48%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;4.20%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">19.08%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">19.13%</styled-content></td>
</tr>
<tr>
<td>21</td>
<td>MSA&#x2212;FCN [<xref ref-type="bibr" rid="ref-58">58</xref>]</td>
<td>2024</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;15.26%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;22.25%</styled-content></td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td><styled-content style-type="color" style="color: #339966;">15.62%</styled-content></td>
<td><styled-content style-type="color" style="color: #339966;">15.67%</styled-content></td>
</tr>
<tr>
<td><bold>22</bold></td>
<td><bold>DFAGCN</bold> [<xref ref-type="bibr" rid="ref-59">59</xref>]</td>
<td><bold>2024</bold></td>
<td><bold>Time&#x2212;series data to graph transformation</bold></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;35.33%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;34.17%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;51.65%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;60.84%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;17.36%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;12.73%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;16.85%</styled-content></td>
<td><styled-content style-type="color" style="color: #FF0000;">&#x2212;16.77%</styled-content></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Regarding simple DL models (see rows 1, 4, 17, 18), our approach beats almost every model, especially in FD002 and FD004 datasets, except the LSTM used in [<xref ref-type="bibr" rid="ref-43">43</xref>] (see row 18). This is because it uses an automatic piecewise RUL function to choose the upper limit of the RUL (MaxRULValue), which reduces the maximum RUL value from 130 (the standard value for this problem) to around 80. This change artificially reduces the RMSE regardless of the model architecture employed. However, this error reduction occurs only in absolute terms. If we compute <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mi>R</mml:mi><mml:mi>M</mml:mi><mml:mi>S</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>M</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:mi>L</mml:mi><mml:mi>V</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>u</mml:mi><mml:mi>e</mml:mi></mml:math></inline-formula>, for both models presented in the article where one uses the standard 130 threshold for the piecewise RUL function and the other one uses the automatic calculation (see rows 17 and 18, respectively), we can check that the relative error keeps practically the same (e.g., 0.1 vs. 0.0972 for FD001). That means that the improvement is made thanks to the preprocessing step, which may not apply to datasets other than CMAPSS.</p>
<p>The hybrid DL models (see rows 6, 7, 10, 11, 13, 14, 19) outperform our approach on FD001, FD002, and FD003 and achieve a comparable performance to our proposal on FD004, except for ConvGAT (row 19), which also surpasses our model on FD004. All hybrid attention-based models (see rows 9, 15, 16, 20, 21, 22) outperform our proposal on FD001. Additionally, Multi-head CNN &#x002B; LSTM (row 9) performs better on FD003; BiLSTM Attention (row 15) on FD002 and FD004; 3D Attention-enhanced CNN-BiLSTM (row 20) on FD002, FD003, and FD004; and MSA-FCN (row 21) on FD002. Notably, both Multidimensional Attention and DFAGCN (rows 16 and 22) achieve lower errors across all four subsets. These two models outperform our approach on every subset and have two things in common. They combine attention mechanisms with other DL techniques and use specific preprocessing. On the one hand, the multi-dimensional attention LSTM combines the attention mechanism with a special normalization based on clusters of the operational settings of the engine. On the other hand, the DFAGCNN combines attention with graph representations, convolution, and recurrence in a complex architecture where the graph attention is used to dynamically select features, the convolution to encode the input, and the recurrence to extract the temporal patterns. Both models showcase an outstanding performance with RMSE values between 10% and 57% lower than our models in the case of the multi-dimensional attention LSTM and between 12% and 60% for the DFAGCNN (see <xref ref-type="table" rid="table-4">Table 4</xref>). However, this comes at the cost of having high complexity models, which imply significantly longer training times and larger datasets to achieve that performance level, as we show in the <xref ref-type="sec" rid="s4_5_4">Section 4.5.4</xref>.</p>
<p>By analyzing the model predictions, it can be observed (in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>) that the predicted values heavily oscillate around the actual value, which may be caused by the noise introduced during the zero-shot embedding creation. This indicates that when the algorithm can learn from the original data, embeddings can degrade its predictive performance. Conversely, if the algorithm cannot handle datasets with high dimensionality and variability to extract meaningful patterns from the original data, the use of embeddings has a positive impact despite the oscillations of the model predictions.</p>
<p>In summary, this second experiment demonstrates that the simplest ML models trained on the embeddings generated by the TSFM can achieve the same level of performance as the most modern and complex hybrid DL models in some scenarios, especially on datasets with higher complexity, such as FD002 and FD004 subsets.</p>
<p>Moreover, it is worth noting that our hybrid models using embeddings achieve comparable results to those obtained by state-of-the-art models that rely on dataset-specific preprocessing strategies, despite not requiring any tailored preprocessing beyond basic normalization and sequencing (see for instance rows 7, 8, 9, 15, 17).</p>
</sec>
<sec id="s4_5_3">
<label>4.5.3</label>
<title>Experiment 3: Few-Shot Learning</title>
<p>As mentioned earlier, the scarcity of failure data is a common challenge in predictive maintenance problems. To assess the ability to learn from fewer samples, we compared the perfomance of the models trained on embeddings vs. the ones trained on original time series values, using a 10% of the original training set. <xref ref-type="table" rid="table-5">Table 5</xref> shows that, once again, tree-based models struggle to learn effectively from embeddings, whereas SVR and NN perform better when the sample size is small if they are trained using embeddings. Notably, the RMSE of the SVR model worsens less than 4% when comparing the models trained using the embeddings of the full training set (see SVR 30W embeddings on <xref ref-type="table" rid="table-2">Table 2</xref>) and continues to outperform simple DL models such as CNNs and LSTMs (see rows 1 and 4 in <xref ref-type="table" rid="table-3">Table 3</xref>). On the other hand, the NN model experiences a more substantial performance drop of 15% in FD001, 6.71% in FD003, and 5.86% in FD004, but shows a 15% of improvement in the FD002 dataset.</p>
<table-wrap id="table-5">
<label>Table 5</label>
<caption>
<title>Performance comparison across models and datasets using a 10% of the training data</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead align="center" valign="top">
<tr>
<th>Model</th>
<th colspan="2">FD001</th>
<th colspan="2">FD002</th>
<th colspan="2">FD003</th>
<th colspan="2">FD004</th>
</tr>
<tr>
<th></th>
<th>RMSE</th>
<th>Score</th>
<th>RMSE</th>
<th>Score</th>
<th>RMSE</th>
<th>Score</th>
<th>RMSE</th>
<th>Score</th>
</tr>
</thead>
<tbody align="center" valign="top">
<tr>
<td>LGBM</td>
<td>22.07</td>
<td>730</td>
<td>26.12</td>
<td>2566</td>
<td>16.50</td>
<td>3782</td>
<td>18.25</td>
<td>2994</td>
</tr>
<tr>
<td>LGBM (embeddings)</td>
<td>18.22</td>
<td>10,954</td>
<td>27.65</td>
<td>8417</td>
<td>16.26</td>
<td>5535</td>
<td>23.77</td>
<td>13,224</td>
</tr>
<tr>
<td>Random forest</td>
<td>19.35</td>
<td>645</td>
<td>24.84</td>
<td>1959</td>
<td>14.82</td>
<td>4492</td>
<td>17.47</td>
<td>4796</td>
</tr>
<tr>
<td>Random forest (embeddings)</td>
<td>16.30</td>
<td>18,409</td>
<td>28.85</td>
<td>18,032</td>
<td>15.15</td>
<td>8183</td>
<td>24.93</td>
<td>29,906</td>
</tr>
<tr>
<td>SVR</td>
<td>14.86</td>
<td>492</td>
<td>30.57</td>
<td>8055</td>
<td>23.36</td>
<td>9528</td>
<td>24.58</td>
<td>25,565</td>
</tr>
<tr>
<td>SVR (embeddings)</td>
<td>15.76</td>
<td>2382</td>
<td>19.78</td>
<td>3488</td>
<td>13.84</td>
<td>5709</td>
<td>16.99</td>
<td>9130</td>
</tr>
<tr>
<td>NN</td>
<td>17.14</td>
<td>677</td>
<td>24.72</td>
<td>4348</td>
<td>18.83</td>
<td>70,610</td>
<td>19.80</td>
<td>45,617</td>
</tr>
<tr>
<td>NN (embeddings)</td>
<td>17.18</td>
<td>2897</td>
<td>17.73</td>
<td>7037</td>
<td>13.51</td>
<td>3797</td>
<td>17.32</td>
<td>7947</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>After identifying SVR as the most effective ML technique in few-shot scenarios, we further investigate the impact of training set size on model performance using embeddings. Therefore, we carried out the training of models with the 5%, 10%, 15%, and 20% of the full dataset. The results, presented in <xref ref-type="table" rid="table-6">Table 6</xref>, show that, with only 5% of the training data, the RMSE of the SVR model trained with embeddings increases by 11%, 1%, 9%, and 7% on FD001, FD002, FD003, and FD004, respectively.</p>
<table-wrap id="table-6">
<label>Table 6</label>
<caption>
<title>Comparison of SVM model performance (with and without embeddings) across different training data sizes (5%, 10%, 15%, 20%) for the four datasets (FD001&#x2013;FD004). The best result for each dataset size is highlighted in bold font.</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead align="center" valign="top">
<tr>
<th>% of data</th>
<th>Embeddings</th>
<th colspan="2">FD001</th>
<th colspan="2">FD002</th>
<th colspan="2">FD003</th>
<th colspan="2">FD004</th>
</tr>
<tr>
<th></th>
<th></th>
<th>RMSE</th>
<th>Score</th>
<th>RMSE</th>
<th>Score</th>
<th>RMSE</th>
<th>Score</th>
<th>RMSE</th>
<th>Score</th>
</tr>
</thead>
<tbody align="center" valign="top">
<tr>
<td></td>
<td>Yes</td>
<td><bold>16.92</bold></td>
<td>8,857</td>
<td><bold>20.00</bold></td>
<td><bold>3,400</bold></td>
<td><bold>14.45</bold></td>
<td><bold>4,291</bold></td>
<td><bold>17.54</bold></td>
<td><bold>9,134</bold></td>
</tr>
<tr>
<td>5</td>
<td>No</td>
<td>27.12</td>
<td><bold>1,471</bold></td>
<td>29.77</td>
<td>16,113</td>
<td>20.64</td>
<td>21,616</td>
<td>25.45</td>
<td>100,617</td>
</tr>
<tr>
<td></td>
<td>Yes</td>
<td>15.76</td>
<td>2,382</td>
<td><bold>19.78</bold></td>
<td><bold>3,488</bold></td>
<td><bold>13.84</bold></td>
<td><bold>5,709</bold></td>
<td><bold>16.99</bold></td>
<td><bold>9,130</bold></td>
</tr>
<tr>
<td>10</td>
<td>No</td>
<td><bold>14.83</bold></td>
<td><bold>492</bold></td>
<td>30.57</td>
<td>8,055</td>
<td>23.36</td>
<td>9,528</td>
<td>24.58</td>
<td>25,565</td>
</tr>
<tr>
<td>15</td>
<td>Yes</td>
<td>15.59</td>
<td>1,159</td>
<td><bold>19.55</bold></td>
<td><bold>3,295</bold></td>
<td><bold>13.49</bold></td>
<td><bold>2,534</bold></td>
<td><bold>16.66</bold></td>
<td><bold>7,918</bold></td>
</tr>
<tr>
<td></td>
<td>No</td>
<td><bold>12.83</bold></td>
<td><bold>564</bold></td>
<td>26.52</td>
<td>5,726</td>
<td>15.83</td>
<td>3,159</td>
<td>23.10</td>
<td>37,719</td>
</tr>
<tr>
<td></td>
<td>Yes</td>
<td>15.28</td>
<td>1,128</td>
<td><bold>19.52</bold></td>
<td><bold>3,224</bold></td>
<td>13.40</td>
<td>2,476</td>
<td><bold>16.54</bold></td>
<td><bold>7,367</bold></td>
</tr>
<tr>
<td>20</td>
<td>No</td>
<td><bold>12.42</bold></td>
<td><bold>336</bold></td>
<td>25.00</td>
<td>5,356</td>
<td><bold>13.11</bold></td>
<td><bold>1,428</bold></td>
<td>22.63</td>
<td>44,191</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>It is worth noting that the model attains near-maximum performance using only 10% to 15% of the training data. Beyond this point, further increases in training size yield only marginal improvements, likely due to initialisation variability rather than meaningful gains in learning.</p>
<p>Finally, it must be pointed out that the model trained without embeddings on a 20% of the training dataset obtains a better score than the one trained with embeddings on dataset FD001 and FD003. However, when compared to the model trained on the full dataset (see <xref ref-type="table" rid="table-2">Table 2</xref>), its RMSE increases by 13%, 8%, 24%, and 4% for FD001, FD002, FD003, and FD004, respectively.</p>
<p>In short, this third experiment shows that the Moment-generated embeddings effectively improve the few-shot learning capabilities of the models, particularly with smaller datasets, e.g., 5% experiment. As the volume of training data increases, the performance gap between models using embeddings and those without gradually narrows.</p>
</sec>
<sec id="s4_5_4">
<label>4.5.4</label>
<title>Experiment 4: Use of Resources</title>
<p>Next, we explain the study of time and power consumption performed. To measure the training time, each model was trained using the best configuration of each algorithm, excluding the preprocessing and the full grid search for hyperparameter tuning to restrict the measurement exclusively to model training. This process was carried out on the full FD001 dataset and the 10% of this set.</p>
<p><xref ref-type="table" rid="table-7">Table 7</xref> shows the training times and speedup for the 4 ML models built and 2 DL models taken from <xref ref-type="table" rid="table-3">Table 3</xref>: (1) the multidimensional attention &#x002B; LSTM model (MDA-LSTM) from [<xref ref-type="bibr" rid="ref-39">39</xref>], which obtains the best results and whose code is shared on GitHub and, (2) a simple LSTM model with a similar architecture to the one used in [<xref ref-type="bibr" rid="ref-42">42</xref>], which achieves a level of performance close to our SVR and NN models trained with a reduced dataset.</p>
<table-wrap id="table-7">
<label>Table 7</label>
<caption>
<title>Training times (s) of the models, without considering preprocessing and tunning tasks, on the full and 10% F001 dataset. Speedup is calculated by taking LSTM time as a reference base.</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead align="center" valign="top">
<tr>
<th>Model</th>
<th colspan="2">Full dataset</th>
<th colspan="2">Few shot</th>
</tr>
<tr>
<th></th>
<th>Time (s)</th>
<th>Speedup (%)</th>
<th>Time (s)</th>
<th>Speedup (%)</th>
</tr>
</thead>
<tbody align="center" valign="top">
<tr>
<td>LSTM [<xref ref-type="bibr" rid="ref-42">42</xref>]</td>
<td>1,372</td>
<td>0%</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>MDA&#x2212;LSTM [<xref ref-type="bibr" rid="ref-39">39</xref>]</td>
<td>3,029</td>
<td>&#x2212;54.7%</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>Random forest</td>
<td>1,920</td>
<td>&#x2212;28.5%</td>
<td>116.56</td>
<td>1,077%</td>
</tr>
<tr>
<td>LGBM</td>
<td>2.82</td>
<td>48,552%</td>
<td>1.34</td>
<td>102,288%</td>
</tr>
<tr>
<td>NN</td>
<td>268.92</td>
<td>410%</td>
<td>51.39</td>
<td>2,569%</td>
</tr>
<tr>
<td>SVR</td>
<td>92.67</td>
<td>1,380%</td>
<td>0.88</td>
<td>155,809.09%</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>We used the training time of the LSTM model trained on the full dataset as a baseline to compute the percentage of increment or decrement in speedup. As can be observed, our proposal&#x2014;SVR with embeddings&#x2014;is strongly recommended not only for its accuracy (as seen in previous sections) but also for its low training times and therefore low power consumption.</p>
<p>Although the training times may seem low&#x2014;requiring 50 min for the largest models&#x2014;these figures only reflect the training of a single model configuration, noting the substantial differences that exist when using one or the other algorithm. In a real-world scenario, the training of a model typically involves cross-validation and hyperparameter tuning, which requires fitting many model configurations to find the best-performing one. As an example, the MDA-LSTM model has 10 configurable parameters. If only 2 possible values were considered for each parameter (the bare minimum to be considered configurable) and a 5-fold cross-validation was performed, this would result in training and evaluating 5120 models, which would take approximately 177 days using our setup, according to the measured times. In contrast, the same process using our SVR model in the few-shot scenario would only take around 1.25 h. Although more optimal tuning algorithms exist to prune unpromising parameter combinations, and more powerful hardware could accelerate the process, the difference in the training times remains remarkable. This difference not only affects the training time, but also the power consumption and, therefore, the energy costs and emissions.</p>
<p>We must also note that the time required for embedding creation is not included in the training times shown in <xref ref-type="table" rid="table-7">Table 7</xref>. We consider this step part of the preprocessing, as it only needs to be performed once before the hyperparameter search. Moreover, generating embeddings for the entire training dataset takes 540 s, which means less than half the training time of the LSTM model. Therefore, even if we were to include this step as part of the training process, the SVR and NN models would still be the fastest.</p>
<p>Another important aspect in PdM problems is being able to react fast to the anomalies. That is why we measured the inference time of each model. To do it, we selected 1,000 observation windows and fed them to the models one at a time, computing the mean inference time and the standard deviation for each model. <xref ref-type="table" rid="table-8">Table 8</xref> presents both metrics in milliseconds (ms) for all models trained using the full training set and the reduced training set. As can be seen, all models, including DL models, have adequate times varying from a few ms to below one ms, which is fast enough for this dataset, where new data is recorded once every engine operating cycle.</p>
<table-wrap id="table-8">
<label>Table 8</label>
<caption>
<title>Inference time (ms) of ML models compared to two DL models found in the literature</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead align="center" valign="top">
<tr>
<th rowspan="2">Model</th>
<th colspan="2">Full dataset</th>
<th colspan="2">Few shot</th>
</tr>
<tr>
<th>Mean time (ms)</th>
<th>Std</th>
<th>Mean time (ms)</th>
<th>Std</th>
</tr>
</thead>
<tbody align="center" valign="top">
<tr>
<td>LSTM [<xref ref-type="bibr" rid="ref-42">42</xref>]</td>
<td>0.507</td>
<td>0.515</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>MDA-LSTM [<xref ref-type="bibr" rid="ref-39">39</xref>]</td>
<td>11.699</td>
<td>0.592</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>Random forest</td>
<td>2.519</td>
<td>0.523</td>
<td>2.433</td>
<td>0.501</td>
</tr>
<tr>
<td>LGBM</td>
<td>0.084</td>
<td>0.281</td>
<td>0.070</td>
<td>0.255</td>
</tr>
<tr>
<td>NN</td>
<td>0.236</td>
<td>2.271</td>
<td>0.167</td>
<td>0.335</td>
</tr>
<tr>
<td>SVR</td>
<td>3.781</td>
<td>0.509</td>
<td>0.317</td>
<td>0.467</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>All the experiments described in this paper were carried out using a PC equipped with an Intel Core i7-13700 K CPU, 32 GB of RAM, and an NVIDIA RTX A5000 GPU. All ML models were trained on the CPU, which has a maximum power consumption of 125 watts, whereas the DL ones were trained on the GPU, which has a maximum power consumption of 230 watts, 84% higher than the CPU. Thus, in addition to being much slower, DL models require more power-consuming hardware.</p>
<p>Regarding the estimation of the carbon impact, assuming a carbon efficiency of 0.432 kgCO<sub>2</sub>eq/kWh of our computer (value taken from the OECD&#x2019;s 2014 yearly average), the full grid search training of the MDA-LSTM would emit a total of 422.08 kgCO<sub>2</sub>eq over a total of 4248 h of computation on the RTX A5000 GPU (TDP of 230W). In contrast, the training of the SVR model would emit 0.075 kgCO<sub>2</sub>eq over a total of 1.25 h of computation on the Intel Core i7-13700 K CPU (TDP of 125W). Estimations were conducted using the Machine Learning Emissions calculator<xref ref-type="fn" rid="fn-1"><sup>1</sup></xref><fn id="fn-1"><label>1</label><p><ext-link ext-link-type="uri" xlink:href="https://mlco2.github.io/impact#compute">https://mlco2.github.io/impact#compute</ext-link> (accessed on 25 June 2025).</p></fn> presented in [<xref ref-type="bibr" rid="ref-60">60</xref>].</p>
<p>To recapitulate, this fourth experiment has demonstrated that using an ML model combined with the embedding generation strategy can significantly accelerate the training process. This advantage becomes even more evident when considering that tuning complex models typically requires extensive cross-validation and hyperparameter optimization. Simultaneously, the energy consumption and CO<sub>2</sub> emissions associated with model training are lowered due to reduced computational demands and shorter training times.</p>
</sec>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Discussion</title>
<p>The aim of this study has been to evaluate the use of TSFM for the RUL prediction on the CMAPSS dataset. We compare the performance of four ML models trained with embeddings generated by the Moment against both the same models trained with the original data and DL models chosen from recent literature. Next, we will answer the questions posed in <xref ref-type="sec" rid="s4_5">Section 4.5</xref> based on the results obtained in our benchmark.</p>
<p>The first question asked about the performance improvement achieved by ML techniques using embeddings. The experimentation shows that regarding RSME, this improvement is only achieved with models such as SVR on the most complex datasets, FD002 and FD004. However, it is not a beneficial strategy and may even degrade the performance of tree-based models, Random Forest and Gradient Boosting Machine, that are inherently capable of capturing non-linear relationships directly from the data. Regarding the score, models trained using the embeddings almost always obtain higher (worse) values, mainly due to the sensitivity of the formula to individual poor predictions.</p>
<p>Regarding the behavior of our proposal with respect to other models found in the literature, <xref ref-type="table" rid="table-4">Table 4</xref> shows that the ML models trained with embeddings offer competitive performance compared to simpler DL models and some hybrid models, especially in more complex data scenarios. However, hybrid attention-based DL models surpass the proposed models across all subsets, especially if a previous specific preprocessing is carried on (see row 16 and 22), albeit at the cost of longer training times and the need for larger datasets.</p>
<p>Another question asked whether models trained using the few-shot learning paradigm would achieve sufficient accuracy. This is where our proposal achieves the best results. Using embeddings improves the predictive performance of SVR and NN when training on a reduced training set, in our case using a 10% of the original training data. Notably, SVR achieves practically the same RMSE (less than a 4% of difference compared to using the full dataset) and outperforms simple DL models such as CNN and LSTM. Additionally, as demonstrated by the comparison using different dataset sizes, this effect becomes more noticeable as the size decreases.</p>
<p>Beyond performance benefits, the use of TSFM can be particularly valuable for organizations aiming to rapidly build and deploy ML models, as it eliminates the need for extensive manual feature engineering or dataset-specific preprocessing. By providing meaningful embeddings, TSFM simplifies the development pipeline, reduces dependency on domain expertise, and enables more scalable and generalizable solutions&#x2014;aligning with the objectives of AutoML frameworks. This not only accelerates time-to-deployment but also facilitates experimentation across diverse applications with minimal adjustment [<xref ref-type="bibr" rid="ref-28">28</xref>], albeit at the cost of not always achieving the same level of predictive accuracy as highly specialized models.</p>
<p>Concerned with sustainability, we measure time and power consumption to train and use these models. ML models with TSFM embeddings significantly reduce training time compared to DL models while requiring less powerful hardware, and therefore, the pollutant emissions derived from the training are much lower. This is due to the lower complexity of the models and their ability to achieve competitive performance with fewer data samples.</p>
<p>In short, the combination of the Moment TSFM with classical models such as SVR creates a synergistic effect: Moment acts as a universal feature extractor, transforming multidimensional time series into latent representations that effectively preserve underlying degradation patterns. This enables simple models to focus on modelling the relationship between these embeddings and the RUL, eliminating the need for complex architectures or large volumes of labelled data. As a result, computational cost is significantly reduced without compromising predictive accuracy in low-labelled data scenarios. This approach circumvents the need to train DL models from scratch (e.g., LSTMs or transformers), which are often data- and resource-intensive. Instead, the embeddings generated by Moment leverage pre-trained knowledge in a zero-shot fashion and facilitate rapid adaptation to new contexts in few-shot learning setups, offering a practical and efficient solution for industrial scenarios with scarce labeled failure data.</p>
<p>Finally, a practitioner might reasonably consider that integrating the TSFM and the ML model into a unified training process could improve predictive accuracy. However, even though this could potentially yield better results, the limited amount of data in few-shot scenarios may not be enough to improve the performance of the TSFM. Moreover, given the complexity of TSFMs&#x2014;with millions of parameters&#x2014;the training process would require significantly more time and computational resources, making it more costly than most state-of-the-art models. This, indeed, would undermine the core motivation of our approach: to build lightweight, fast, and cost-effective predictive models by leveraging the representational power of TSFM without the burden of retraining them.</p>
<p><bold><italic>Limitations of the Study</italic></bold></p>
<p>The study presents certain limitations that should be noted. First, it focuses on the CMAPSS dataset, a synthetic benchmark for RUL prediction. While this synthetic dataset is widely used for comparing the performance of different algorithms in a controlled manner, this does not fully reflect the characteristics of a real environment where external factors influence the data, for example, generating random noise that can interfere in the model&#x2019;s decision. Therefore, the results of this study may not be fully replicable in real scenarios, and experimentation with real-world datasets that present different common problems, such as strong noise, stationary features, or high proportions of missing data, should be performed.</p>
<p>One way to address this issue, while maintaining the FM-based approach, would be to fine-tune a large model using datasets that accurately capture the relevant characteristics of the problem (domain-aware adaptation), which, if not available, could be generated by means of data augmentation techniques. However, as this solution leads to more computational costs, as an initial step, we propose to experiment with other TSFMs for embedding generation when they are available.</p>
<p>It is also worth noting that the models were built using basic preprocessing techniques to maintain a general approach useful for any context, and to test the ability of FMs to absorb this task. However, the lack of this optimisation may reduce the accuracy of the proposed models.</p>
</sec>
<sec id="s6">
<label>6</label>
<title>Conclusions</title>
<p>Estimating the RUL remains an open challenge in predictive maintenance. Although several studies and surveys have been published in recent years addressing this issue from different approaches, the results are not definitive. It has been proven that the best predictors are achieved with hybrid DL models based on a combination of multidimensional attention layers and LSTMs. However, these models require long training times, large volumes of data, and expert knowledge for fine-tuning.</p>
<p>Both the versatility and effectiveness that FM have demonstrated in predictive and representational learning tasks [<xref ref-type="bibr" rid="ref-28">28</xref>] and the recent emergence of TSFM have led us to explore their applicability to RUL prediction. Our goal was to evaluate whether embeddings generated by TSFM are meaningful enough to enable the construction of competitive and simpler predictors with a reduced amount of training data and reduced preprocessing, thus lowering computational costs and processing time.</p>
<p>Our benchmark shows that training simple ML models, such as SVR or NN, with embeddings generated by Moment FM offers a viable alternative to complex DL models, particularly in few-shot scenarios where labeled data is scarce and computational resources are limited.</p>
<p>As future work, we plan to extend this experimentation to other artificial and real-world datasets and to explore the use of other FMs specifically designed for time series under a different architecture, such as TOTEM [<xref ref-type="bibr" rid="ref-35">35</xref>].</p>
</sec>
</body>
<back>
<ack>
<p>None.</p>
</ack>
<sec>
<title>Funding Statement</title>
<p>Funded by the Spanish Government and FEDER funds (AEI/FEDER, UE) under grant PID2021-124502OB-C42 (PRESECREL) and the predoctoral program &#x201C;Concepci&#x00F3;n Arenal del Programa de Personal Investigador en formaci&#x00F3;n Predoctoral&#x201D; funded by Universidad de Cantabria and Cantabria&#x2019;s Government (BOC 18-10-2021).</p>
</sec>
<sec>
<title>Author Contributions</title>
<p>Conceptualization, Ricardo Dint&#x00E9;n and Marta Zorrilla; methodology, Marta Zorrilla; software, Ricardo Dint&#x00E9;n; validation, Ricardo Dint&#x00E9;n and Marta Zorrilla; investigation, Ricardo Dint&#x00E9;n and Marta Zorrilla; resources, Ricardo Dint&#x00E9;n and Marta Zorrilla; data curation, Ricardo Dint&#x00E9;n; writing&#x2014;original draft preparation, Ricardo Dint&#x00E9;n; writing&#x2014;review and editing, Marta Zorrilla; supervision, Marta Zorrilla; project administration, Marta Zorrilla; funding acquisition, Ricardo Dint&#x00E9;n and Marta Zorrilla. All authors reviewed the results and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability">
<title>Availability of Data and Materials</title>
<p>The data that support the findings of this study are openly available in GitHub at [<ext-link ext-link-type="uri" xlink:href="https://github.com/DintenR/TSFM_for_Few-shot_RUL_prediction">https://github.com/DintenR/TSFM_for_Few-shot_RUL_prediction</ext-link> (accessed on 2025 June 25)].</p>
</sec>
<sec>
<title>Ethics Approval</title>
<p>Not applicable.</p>
</sec>
<sec sec-type="COI-statement">
<title>Conflicts of Interest</title>
<p>The authors declare no conflicts of interest to report regarding the present study.</p>
</sec>
<glossary content-type="abbreviations" id="glossary-1">
<title>Abbreviations</title>
<def-list>
<def-item>
<term>AI</term>
<def>
<p>Artificial Intelligence</p>
</def>
</def-item>
<def-item>
<term>AR</term>
<def>
<p>Auto-Regression</p>
</def>
</def-item>
<def-item>
<term>BERT</term>
<def>
<p>Bidirectional Encoder Representations from Transformers</p>
</def>
</def-item>
<def-item>
<term>CNN</term>
<def>
<p>Convolutional Neural Network</p>
</def>
</def-item>
<def-item>
<term>DL</term>
<def>
<p>Deep Learning</p>
</def>
</def-item>
<def-item>
<term>ELM</term>
<def>
<p>Extreme Learning Machine</p>
</def>
</def-item>
<def-item>
<term>IoT</term>
<def>
<p>Internet of Things</p>
</def>
</def-item>
<def-item>
<term>FSL</term>
<def>
<p>Few-shot Learning</p>
</def>
</def-item>
<def-item>
<term>GPT</term>
<def>
<p>Generative Pre-trained Transformer</p>
</def>
</def-item>
<def-item>
<term>GPU</term>
<def>
<p>Graphics Processing Unit</p>
</def>
</def-item>
<def-item>
<term>LGBM</term>
<def>
<p>Light Gradient Boosting Machine</p>
</def>
</def-item>
<def-item>
<term>LLM</term>
<def>
<p>Large Language Model</p>
</def>
</def-item>
<def-item>
<term>ML</term>
<def>
<p>Machine Learning</p>
</def>
</def-item>
<def-item>
<term>NPU</term>
<def>
<p>Neural Processing Unit</p>
</def>
</def-item>
<def-item>
<term>PdM</term>
<def>
<p>Predictive Maintenance</p>
</def>
</def-item>
<def-item>
<term>RF</term>
<def>
<p>Ramdom Forest</p>
</def>
</def-item>
<def-item>
<term>RCA</term>
<def>
<p>Root Cause Analysis</p>
</def>
</def-item>
<def-item>
<term>RNN</term>
<def>
<p>Recurrent Neural Network</p>
</def>
</def-item>
<def-item>
<term>RUL</term>
<def>
<p>Remaining Useful Life</p>
</def>
</def-item>
<def-item>
<term>SVR</term>
<def>
<p>Support Vector Regression</p>
</def>
</def-item>
<def-item>
<term>TPU</term>
<def>
<p>Tensor Processing Unit</p>
</def>
</def-item>
<def-item>
<term>TSFM</term>
<def>
<p>Time Series Foundation Models</p>
</def>
</def-item>
<def-item>
<term>VQVAE</term>
<def>
<p>Vector Quantized Variational Autoencoders</p>
</def>
</def-item>
</def-list>
</glossary>
<app-group id="appg-1">
<app id="app-1">
<title>Appendix A</title>
<fig id="fig-5">
<label>Figure A1</label>
<caption>
<title>Variables approaching failure with increasing trend</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_65461-fig-5.tif"/>
</fig>
<fig id="fig-6">
<label>Figure A2</label>
<caption>
<title>Variables approaching failure with decreasing trend</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_65461-fig-6.tif"/>
</fig>
<fig id="fig-7">
<label>Figure A3</label>
<caption>
<title>Variables approaching failure with random trend</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_65461-fig-7.tif"/>
</fig>
<fig id="fig-8">
<label>Figure A4</label>
<caption>
<title>Stationary variables approaching failure</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_65461-fig-8.tif"/>
</fig>
</app>
<app id="app-2">
<label>Appendix B</label>
<table-wrap id="table-9">
<label>Table A1</label>
<caption>
<title>Parameter grid for Random Forest hyperparameter tuning</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
</colgroup>
<thead align="center" valign="top">
<tr>
<th>Parameter</th>
<th>Values</th>
</tr>
</thead>
<tbody align="center" valign="top">
<tr>
<td><monospace>n_estimators</monospace></td>
<td>{100, 200, 500, 1000}</td>
</tr>
<tr>
<td><monospace>max_depth</monospace></td>
<td>{None, 10, 20, 30, 50}</td>
</tr>
<tr>
<td><monospace>max_features</monospace></td>
<td>{<monospace>auto</monospace>, <monospace>sqrt</monospace>, <monospace>log2</monospace>}</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-10">
<label>Table A2</label>
<caption>
<title>Parameter grid for SVR hyperparameter tuning</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
</colgroup>
<thead align="center" valign="top">
<tr>
<th>Parameter</th>
<th>Values</th>
</tr>
</thead>
<tbody align="center" valign="top">
<tr>
<td><monospace>C</monospace></td>
<td>{0.0001, 0.001, 0.01, 0.1, 1, 10, 100, 1000, 10000}</td>
</tr>
<tr>
<td><monospace>Epsilon</monospace></td>
<td>{0.01, 0.1, 0.2, 0.3}</td>
</tr>
<tr>
<td><monospace>Kernel</monospace></td>
<td>{<monospace>linear</monospace>, <monospace>rbf</monospace>, <monospace>poly</monospace>}</td>
</tr>
<tr>
<td><monospace>Gamma</monospace></td>
<td>{<monospace>scale</monospace>, <monospace>auto</monospace>, 0.01, 0.1, 1}</td>
</tr>
<tr>
<td><monospace>Degree</monospace></td>
<td>{2, 3, 4} (used only if <monospace>kernel &#x003D; poly</monospace>)</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-11">
<label>Table A3</label>
<caption>
<title>Parameter grid for nn hyperparameter tuning</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
</colgroup>
<thead align="center" valign="top">
<tr>
<th>Parameter</th>
<th>Values</th>
</tr>
</thead>
<tbody align="center" valign="top">
<tr>
<td><monospace>hidden_layer_size</monospace></td>
<td>{32, 64, 128, 256, 512}</td>
</tr>
<tr>
<td><monospace>activation</monospace></td>
<td>{<monospace>relu</monospace>, <monospace>tanh</monospace>, <monospace>logistic</monospace>}</td>
</tr>
<tr>
<td><monospace>learning_rate</monospace></td>
<td>{0.0001, 0.001, 0.01, 0.1}</td>
</tr>
<tr>
<td><monospace>max_iter</monospace></td>
<td>{200, 500, 1000}</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-12">
<label>Table A4</label>
<caption>
<title>Parameter grid for LightGBM hyperparameter tuning</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
</colgroup>
<thead align="center" valign="top">
<tr>
<th>Parameter</th>
<th>Values</th>
</tr>
</thead>
<tbody align="center" valign="top">
<tr>
<td><monospace>num_leaves</monospace></td>
<td>{31, 63, 127}</td>
</tr>
<tr>
<td><monospace>max_depth</monospace></td>
<td>{16, 32, 64, 128}</td>
</tr>
<tr>
<td><monospace>learning_rate</monospace></td>
<td>{0.01}</td>
</tr>
<tr>
<td><monospace>n_estimators</monospace></td>
<td>{100, 500, 1000}</td>
</tr>
<tr>
<td><monospace>boosting_type</monospace></td>
<td>{gbdt,dart}</td>
</tr>
<tr>
<td><monospace>subsample</monospace></td>
<td>{0.6, 0.7, 0.8, 1.0}</td>
</tr>
<tr>
<td><monospace>colsample_bytree</monospace></td>
<td>{0.6, 0.8, 1.0}</td>
</tr>
<tr>
<td><monospace>reg_alpha</monospace></td>
<td>{0.0, 0.1, 1.0}</td>
</tr>
<tr>
<td><monospace>reg_lambda</monospace></td>
<td>{0.0, 0.1, 1.0}</td>
</tr>
</tbody>
</table>
</table-wrap>
</app>
</app-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Keleko</surname> <given-names>AT</given-names></string-name>, <string-name><surname>Kamsu-Foguem</surname> <given-names>B</given-names></string-name>, <string-name><surname>Ngouna</surname> <given-names>RH</given-names></string-name>, <string-name><surname>Tongne</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Artificial intelligence and real-time predictive maintenance in industry 4.0: a bibliometric analysis</article-title>. <source>AI Ethics</source>. <year>2022</year>;<volume>4</volume>(<issue>2</issue>):<fpage>553</fpage>&#x2013;<lpage>77</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s43681-021-00132-6</pub-id>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Serradilla</surname> <given-names>O</given-names></string-name>, <string-name><surname>Zugasti</surname> <given-names>E</given-names></string-name>, <string-name><surname>Rodriguez</surname> <given-names>J</given-names></string-name>, <string-name><surname>Zurutuza</surname> <given-names>U</given-names></string-name></person-group>. <article-title>Deep learning models for predictive maintenance: a survey, comparison, challenges and prospects</article-title>. <source>Appl Intell</source>. <year>2022</year>;<volume>52</volume>(<issue>10</issue>):<fpage>10934</fpage>&#x2013;<lpage>64</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s10489-021-03004-y</pub-id>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wu</surname> <given-names>F</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Tan</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>X</given-names></string-name></person-group>. <article-title>Remaining useful life prediction based on deep learning: a survey</article-title>. <source>Sensors</source>. <year>2024</year>;<volume>24</volume>(<issue>11</issue>):<fpage>3454</fpage>. doi:<pub-id pub-id-type="doi">10.3390/s24113454</pub-id>; <pub-id pub-id-type="pmid">38894245</pub-id></mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Cui</surname> <given-names>L</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>H</given-names></string-name></person-group>. <article-title>Remaining useful life prediction of rolling element bearings based on hybrid drive of data and model</article-title>. <source>IEEE Sens J</source>. <year>2022</year>;<volume>22</volume>(<issue>17</issue>):<fpage>16985</fpage>&#x2013;<lpage>93</lpage>. doi:<pub-id pub-id-type="doi">10.1109/jsen.2022.3188646</pub-id>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Shyalika</surname> <given-names>C</given-names></string-name>, <string-name><surname>Wickramarachchi</surname> <given-names>R</given-names></string-name>, <string-name><surname>Sheth</surname> <given-names>AP</given-names></string-name></person-group>. <article-title>A comprehensive survey on rare event prediction</article-title>. <source>ACM Comput Surv</source>. <year>2024</year>;<volume>57</volume>(<issue>3</issue>):<fpage>70</fpage>. doi:<pub-id pub-id-type="doi">10.1145/3699955</pub-id>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gao</surname> <given-names>RX</given-names></string-name>, <string-name><surname>Krger</surname> <given-names>J</given-names></string-name>, <string-name><surname>Merklein</surname> <given-names>M</given-names></string-name>, <string-name><surname>Mhring</surname> <given-names>HC</given-names></string-name>, <string-name><surname>Vncza</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Artificial intelligence in manufacturing: state of the art, perspectives, and future directions</article-title>. <source>CIRP Ann</source>. <year>2024</year>;<volume>73</volume>(<issue>2</issue>):<fpage>723</fpage>&#x2013;<lpage>49</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.cirp.2024.04.101</pub-id>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>C</given-names></string-name>, <string-name><surname>Li</surname> <given-names>J</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Bao</surname> <given-names>J</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>D</given-names></string-name></person-group>. <article-title>LLM-TSFD: an industrial time series human-in-the-loop fault diagnosis method based on a large language model</article-title>. <source>Expert Syst Appl</source>. <year>2025</year>;<volume>264</volume>(<issue>4</issue>):<fpage>125861</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.eswa.2024.125861</pub-id>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Cui</surname> <given-names>L</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Jiang</surname> <given-names>H</given-names></string-name></person-group>. <article-title>Remaining useful life prediction of rolling element bearings based on simulated performance degradation dictionary</article-title>. <source>Mech Mach Theory</source>. <year>2020</year>;<volume>153</volume>(<issue>6</issue>):<fpage>103967</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.mechmachtheory.2020.103967</pub-id>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Takayama</surname> <given-names>R</given-names></string-name>, <string-name><surname>Natsumeda</surname> <given-names>M</given-names></string-name>, <string-name><surname>Yairi</surname> <given-names>T</given-names></string-name></person-group>. <article-title>A semi-supervised RUL prediction with likelihood-based pseudo labeling for suspension histories</article-title>. In: <conf-name>2023 IEEE International Conference on Prognostics and Health Management (ICPHM)</conf-name>; <year>2023 Jun 5&#x2013;7</year>; <publisher-loc>Montreal, QC, Canada</publisher-loc>. p. <fpage>296</fpage>&#x2013;<lpage>303</lpage>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lin</surname> <given-names>T</given-names></string-name>, <string-name><surname>Song</surname> <given-names>L</given-names></string-name>, <string-name><surname>Cui</surname> <given-names>L</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>H</given-names></string-name></person-group>. <article-title>Advancing RUL prediction in mechanical systems: a hybrid deep learning approach utilizing non-full lifecycle data</article-title>. <source>Adv Eng Inform</source>. <year>2024</year>;<volume>61</volume>(<issue>6</issue>):<fpage>102524</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.aei.2024.102524</pub-id>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname> <given-names>S</given-names></string-name>, <string-name><surname>Peng</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Bin</surname> <given-names>G</given-names></string-name>, <string-name><surname>Shen</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Guo</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Li</surname> <given-names>B</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>Research on bearing fault diagnosis method based on CJBM with semi-supervised and imbalanced data</article-title>. <source>Nonlin Dyn</source>. <year>2024</year>;<volume>112</volume>(<issue>22</issue>):<fpage>19759</fpage>&#x2013;<lpage>81</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s11071-024-10073-4</pub-id>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>lv</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>N</given-names></string-name>, <string-name><surname>Wen</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Shen</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Remaining useful life prediction based on multisource domain transfer and unsupervised alignment</article-title>. <source>Eksploatacja I Niezawodnosc Maint Reliab</source>. <year>2025</year>;<volume>27</volume>(<issue>2</issue>):<fpage>194116</fpage>. doi:<pub-id pub-id-type="doi">10.17531/ein/194116</pub-id>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ding</surname> <given-names>ZQ</given-names></string-name>, <string-name><surname>Qin</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>YF</given-names></string-name>, <string-name><surname>Lin</surname> <given-names>YH</given-names></string-name></person-group>. <article-title>An uncertainty quantification and calibration framework for RUL prediction and accuracy improvement</article-title>. <source>IEEE Trans Instrum Meas</source>. <year>2024</year>;<volume>73</volume>(<issue>4</issue>):<fpage>2535613</fpage>. doi:<pub-id pub-id-type="doi">10.1109/tim.2024.3485392</pub-id>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>C</given-names></string-name>, <string-name><surname>Gong</surname> <given-names>D</given-names></string-name>, <string-name><surname>Xue</surname> <given-names>G</given-names></string-name></person-group>. <article-title>An uncertainty-incorporated active data diffusion learning framework for few-shot equipment RUL prediction</article-title>. <source>Reliab Eng Syst Saf</source> <year>2025</year>;<volume>254</volume>:<fpage>110632</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.ress.2024.110632</pub-id>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Zhou</surname> <given-names>T</given-names></string-name>, <string-name><surname>Niu</surname> <given-names>P</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>L</given-names></string-name>, <string-name><surname>Jin</surname> <given-names>R</given-names></string-name></person-group>. <article-title>One fits all: power general time series analysis by pretrained LM</article-title>. <comment>arXiv:2302.11939. 2023</comment>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ren</surname> <given-names>L</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Dong</surname> <given-names>J</given-names></string-name>, <string-name><surname>Jia</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Li</surname> <given-names>S</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>Y</given-names></string-name>, <etal>et. al</etal></person-group>. <article-title>Industrial foundation model</article-title>. <source>IEEE Trans Cybern</source> <year>2025</year>;<volume>55</volume>(<issue>5</issue>):<fpage>2286</fpage>&#x2013;<lpage>301</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TCYB.2025.3527632</pub-id>; <pub-id pub-id-type="pmid">40067728</pub-id></mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Caspart</surname> <given-names>R</given-names></string-name>, <string-name><surname>Ziegler</surname> <given-names>S</given-names></string-name>, <string-name><surname>Weyrauch</surname> <given-names>A</given-names></string-name>, <string-name><surname>Obermaier</surname> <given-names>H</given-names></string-name>, <string-name><surname>Raffeiner</surname> <given-names>S</given-names></string-name>, <string-name><surname>Schuhmacher</surname> <given-names>LP</given-names></string-name>, <etal>et al</etal></person-group>. <chapter-title>Precise energy consumption measurements of heterogeneous artificial intelligence workloads</chapter-title>. In: <person-group person-group-type="editor"><string-name><surname>Anzt</surname> <given-names>H</given-names></string-name>, <string-name><surname>Bienz</surname> <given-names>A</given-names></string-name>, <string-name><surname>Luszczek</surname> <given-names>P</given-names></string-name>, <string-name><surname>Baboulin</surname> <given-names>M</given-names></string-name></person-group>, editors. <source>High performance computing. ISC high performance 2022 international workshops</source>. <publisher-loc>Cham, Switzerland</publisher-loc>: <publisher-name>Springer International Publishing</publisher-name>; 2022. p. <fpage>108</fpage>&#x2013;<lpage>21</lpage>. doi:<pub-id pub-id-type="doi">10.1007/978-3-031-23220-6_8</pub-id>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname> <given-names>Z</given-names></string-name>, <string-name><surname>He</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Li</surname> <given-names>J</given-names></string-name></person-group>. <article-title>A survey of deep learning-driven architecture for predictive maintenance</article-title>. <source>Eng Appl Artif Intell</source>. <year>2024</year>;<volume>133</volume>:<fpage>108285</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.engappai.2024.108285</pub-id>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>F</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>W</given-names></string-name>, <string-name><surname>Peng</surname> <given-names>S</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>J</given-names></string-name></person-group>. <article-title>A survey of convolutional neural networks: analysis, applications, and prospects</article-title>. <source>IEEE Trans Neural Netw Learning Systems</source>. <year>2020</year>;<volume>33</volume>(<issue>12</issue>):<fpage>6999</fpage>&#x2013;<lpage>7019</lpage>. doi:<pub-id pub-id-type="doi">10.1109/tnnls.2021.3084827</pub-id>; <pub-id pub-id-type="pmid">34111009</pub-id></mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ucar</surname> <given-names>A</given-names></string-name>, <string-name><surname>Karakose</surname> <given-names>M</given-names></string-name>, <string-name><surname>Kirim&#x00E7;a</surname> <given-names>N</given-names></string-name></person-group>. <article-title>Artificial intelligence for predictive maintenance applications: key components, trustworthiness, and future trends</article-title>. <source>Appl Sci</source>. <year>2024</year>;<volume>14</volume>(<issue>2</issue>):<fpage>898</fpage>. doi:<pub-id pub-id-type="doi">10.3390/app14020898</pub-id>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname> <given-names>X</given-names></string-name>, <string-name><surname>Yu</surname> <given-names>D</given-names></string-name>, <string-name><surname>Sren Byg</surname> <given-names>V</given-names></string-name>, <string-name><surname>Daniel Ioan</surname> <given-names>S</given-names></string-name></person-group>. <article-title>The development of machine learning-based remaining useful life prediction for lithium-ion batteries</article-title>. <source>J Energy</source>. <year>2023</year>;<volume>82</volume>:<fpage>103</fpage>&#x2013;<lpage>21</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.jechem.2023.03.026</pub-id>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tasci</surname> <given-names>B</given-names></string-name>, <string-name><surname>Omar</surname> <given-names>A</given-names></string-name>, <string-name><surname>Ayvaz</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Remaining useful lifetime prediction for predictive maintenance in manufacturing</article-title>. <source>Comput Ind Eng</source>. <year>2023</year>;<volume>184</volume>:<fpage>109566</fpage>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Dint&#x00E9;n</surname> <given-names>R</given-names></string-name>, <string-name><surname>Zorrilla</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Building and deployment of smart applications for anomaly detection and failure prediction in industrial use cases</article-title>. <source>Information</source>. <year>2024</year>;<volume>15</volume>(<issue>9</issue>):<fpage>557</fpage>. doi:<pub-id pub-id-type="doi">10.3390/info15090557</pub-id>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kim</surname> <given-names>S</given-names></string-name>, <string-name><surname>Seo</surname> <given-names>YH</given-names></string-name>, <string-name><surname>Park</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Transformer-based novel framework for remaining useful life prediction of lubricant in operational rolling bearings</article-title>. <source>Reliab Eng Syst Safety</source>. <year>2024</year>;<volume>251</volume>(<issue>2</issue>):<fpage>110377</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.ress.2024.110377</pub-id>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yu</surname> <given-names>R</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>M</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>B</given-names></string-name></person-group>. <article-title>A triple-phase boost transformer for industrial equipment fault prediction</article-title>. <source>Neurocomputing</source>. <year>2025</year>;<volume>619</volume>(<issue>2</issue>):<fpage>129137</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.neucom.2024.129137</pub-id>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Devlin</surname> <given-names>J</given-names></string-name>, <string-name><surname>Chang</surname> <given-names>M</given-names></string-name>, <string-name><surname>Lee</surname> <given-names>K</given-names></string-name>, <string-name><surname>Toutanova</surname> <given-names>K</given-names></string-name></person-group>. <article-title>BERT: pre-training of deep bidirectional transformers for language understanding</article-title>. <comment>arXiv:1810.04805. 2018</comment>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Brown</surname> <given-names>TB</given-names></string-name>, <string-name><surname>Mann</surname> <given-names>B</given-names></string-name>, <string-name><surname>Ryder</surname> <given-names>N</given-names></string-name>, <string-name><surname>Subbiah</surname> <given-names>M</given-names></string-name>, <string-name><surname>Kaplan</surname> <given-names>J</given-names></string-name>, <string-name><surname>Dhariwal</surname> <given-names>P</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Language models are few-shot learners</article-title>. <comment>arXiv:2005.14165. 2020</comment>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Liang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Wen</surname> <given-names>H</given-names></string-name>, <string-name><surname>Nie</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Jiang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Jin</surname> <given-names>M</given-names></string-name>, <string-name><surname>Song</surname> <given-names>D</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Foundation models for time series analysis: a tutorial and survey</article-title>. In: <conf-name>Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. KDD &#x2019;24</conf-name>; <year>2024 Aug 25&#x2013;29</year>; <publisher-loc>Barcelona, Spain</publisher-loc>. <fpage>65556565</fpage> p. doi:<pub-id pub-id-type="doi">10.1145/3637528.3671451</pub-id>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Jin</surname> <given-names>M</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>S</given-names></string-name>, <string-name><surname>Ma</surname> <given-names>L</given-names></string-name>, <string-name><surname>Chu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>JY</given-names></string-name>, <string-name><surname>Shi</surname> <given-names>X</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Time-LLM: time series forecasting by reprogramming large language models</article-title>. In: <conf-name>The Twelfth International Conference on Learning Representations</conf-name>; <year>2024 May 7&#x2013;11</year>; <publisher-loc>Vienna, Austria</publisher-loc>. p. <fpage>1</fpage>&#x2013;<lpage>24</lpage>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Liu</surname> <given-names>C</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Miao</surname> <given-names>H</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>S</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>L</given-names></string-name>, <string-name><surname>Long</surname> <given-names>C</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>TimeCMA: towards LLM-empowered time series forecasting via cross-modality alignment</article-title>. <comment>arXiv:2406.01638. 2024</comment>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Xu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Bian</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zhong</surname> <given-names>J</given-names></string-name>, <string-name><surname>Wen</surname> <given-names>X</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>Q</given-names></string-name></person-group>. <article-title>Beyond trend and periodicity: guiding time series forecasting with textual cues</article-title>. <comment>arXiv:2405.13522. 2024</comment>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xue</surname> <given-names>H</given-names></string-name>, <string-name><surname>Salim</surname> <given-names>FD</given-names></string-name></person-group>. <article-title>PromptCast: a new prompt-based learning paradigm for time series forecasting</article-title>. <source>IEEE Trans Knowl Data Eng</source>. <year>2024</year>;<volume>36</volume>(<issue>11</issue>):<fpage>6851</fpage>&#x2013;<lpage>64</lpage>. doi:<pub-id pub-id-type="doi">10.1109/tkde.2023.3342137</pub-id>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Yu</surname> <given-names>X</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Ling</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Dong</surname> <given-names>S</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Lu</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Temporal data meets LLM &#x2013; explainable financial time series forecasting</article-title>. <comment>arXiv:2306.11025. 2023</comment>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Goswami</surname> <given-names>M</given-names></string-name>, <string-name><surname>Szafer</surname> <given-names>K</given-names></string-name>, <string-name><surname>Choudhry</surname> <given-names>A</given-names></string-name>, <string-name><surname>Cai</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Li</surname> <given-names>S</given-names></string-name>, <string-name><surname>Dubrawski</surname> <given-names>A</given-names></string-name></person-group>. <article-title>MOMENT: a family of open time-series foundation models</article-title>. <comment>arXiv:2402.03885. 2024</comment>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Talukder</surname> <given-names>SJ</given-names></string-name>, <string-name><surname>Yue</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Gkioxari</surname> <given-names>G</given-names></string-name></person-group>. <article-title>TOTEM: TOkenized time series EMbeddings for general time series analysis. Transactions on machine learning research</article-title>; <year>2024 [Internet]</year>. <comment>[cited 2025 Jun 25]</comment>. Available from: <ext-link ext-link-type="uri" xlink:href="https://openreview.net/forum?id=QlTLkH6xRC">https://openreview.net/forum?id=QlTLkH6xRC</ext-link>.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Bian</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Ju</surname> <given-names>X</given-names></string-name>, <string-name><surname>Li</surname> <given-names>J</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Cheng</surname> <given-names>D</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>Q</given-names></string-name></person-group>. <article-title>Multi-patch prediction: adapting language models for time series representation learning</article-title>. In: <conf-name>Proceedings of the 41st International Conference on Machine Learning. ICML&#x2019;24</conf-name>; <year>2024 Jul 21-27</year>; <publisher-loc>Vienna, Austria</publisher-loc>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Chang</surname> <given-names>C</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>WY</given-names></string-name>, <string-name><surname>Peng</surname> <given-names>WC</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>TF</given-names></string-name></person-group>. <article-title>LLM4TS: aligning pre-trained LLMs as data-efficient time-series forecasters</article-title>. <comment>arXiv:2308.08469. 2024</comment>.</mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Vaswani</surname> <given-names>A</given-names></string-name>, <string-name><surname>Shazeer</surname> <given-names>N</given-names></string-name>, <string-name><surname>Parmar</surname> <given-names>N</given-names></string-name>, <string-name><surname>Uszkoreit</surname> <given-names>J</given-names></string-name>, <string-name><surname>Jones</surname> <given-names>L</given-names></string-name>, <string-name><surname>Gomez</surname> <given-names>AN</given-names></string-name>, <etal>et al.</etal></person-group> <chapter-title>Attention is all you need</chapter-title>. In: <person-group person-group-type="editor"><string-name><surname>Guyon</surname> <given-names>I</given-names></string-name>, <string-name><surname>Luxburg</surname> <given-names>UV</given-names></string-name>, <string-name><surname>Bengio</surname> <given-names>S</given-names></string-name>, <string-name><surname>Wallach</surname> <given-names>H</given-names></string-name>, <string-name><surname>Fergus</surname> <given-names>R</given-names></string-name>, <string-name><surname>Vishwanathan</surname> <given-names>S</given-names></string-name>, <etal>et al.</etal></person-group>, editors. <source>Advances in neural information processing systems</source>. Vol. <volume>30</volume>. <publisher-loc>Red Hook, NY, USA</publisher-loc>: <publisher-name>Curran Associates, Inc.</publisher-name>; <year>2017</year>.</mixed-citation></ref>
<ref id="ref-39"><label>[39]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Lai</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>M</given-names></string-name>, <string-name><surname>Pan</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>D</given-names></string-name></person-group>. <article-title>Multi-dimensional self attention based approach for remaining useful life estimation</article-title>. <comment>arXiv:2212.05772. 2022</comment>.</mixed-citation></ref>
<ref id="ref-40"><label>[40]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Elgeldawi</surname> <given-names>E</given-names></string-name>, <string-name><surname>Sayed</surname> <given-names>A</given-names></string-name>, <string-name><surname>Galal</surname> <given-names>AR</given-names></string-name>, <string-name><surname>Zaki</surname> <given-names>AM</given-names></string-name></person-group>. <article-title>Hyperparameter tuning for machine learning algorithms used for arabic sentiment analysis</article-title>. <source>Informatics</source>. <year>2021</year>;<volume>8</volume>(<issue>4</issue>):<fpage>79</fpage>. doi:<pub-id pub-id-type="doi">10.3390/informatics8040079</pub-id>.</mixed-citation></ref>
<ref id="ref-41"><label>[41]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hanifi</surname> <given-names>S</given-names></string-name>, <string-name><surname>Cammarono</surname> <given-names>A</given-names></string-name>, <string-name><surname>Zare-Behtash</surname> <given-names>H</given-names></string-name></person-group>. <article-title>Advanced hyperparameter optimization of deep learning models for wind power prediction</article-title>. <source>Renew Energy</source>. <year>2024</year>;<volume>221</volume>(<issue>15</issue>):<fpage>119700</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.renene.2023.119700</pub-id>.</mixed-citation></ref>
<ref id="ref-42"><label>[42]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Zheng</surname> <given-names>S</given-names></string-name>, <string-name><surname>Ristovski</surname> <given-names>K</given-names></string-name>, <string-name><surname>Farahat</surname> <given-names>A</given-names></string-name>, <string-name><surname>Gupta</surname> <given-names>C</given-names></string-name></person-group>. <article-title>Long Short-Term Memory Network for Remaining Useful Life estimation</article-title>. In: <conf-name>2017 IEEE International Conference on Prognostics and Health Management (ICPHM)</conf-name>; <year>2017 Jun 19&#x2013;21</year>; <publisher-loc>Dallas, TX, USA</publisher-loc>. p. <fpage>88</fpage>&#x2013;<lpage>95</lpage>.</mixed-citation></ref>
<ref id="ref-43"><label>[43]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Asif</surname> <given-names>O</given-names></string-name>, <string-name><surname>Haider</surname> <given-names>SA</given-names></string-name>, <string-name><surname>Naqvi</surname> <given-names>SR</given-names></string-name>, <string-name><surname>Zaki</surname> <given-names>JFW</given-names></string-name>, <string-name><surname>Kwak</surname> <given-names>KS</given-names></string-name>, <string-name><surname>Islam</surname> <given-names>SMR</given-names></string-name></person-group>. <article-title>A deep learning model for remaining useful life prediction of aircraft turbofan engine on C-MAPSS dataset</article-title>. <source>IEEE Access</source>. <year>2022</year>;<volume>10</volume>(<issue>1</issue>):<fpage>95425</fpage>&#x2013;<lpage>40</lpage>. doi:<pub-id pub-id-type="doi">10.1109/access.2022.3203406</pub-id>.</mixed-citation></ref>
<ref id="ref-44"><label>[44]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Chen</surname> <given-names>X</given-names></string-name>, <string-name><surname>Jin</surname> <given-names>G</given-names></string-name>, <string-name><surname>Qiu</surname> <given-names>S</given-names></string-name>, <string-name><surname>Lu</surname> <given-names>M</given-names></string-name>, <string-name><surname>Yu</surname> <given-names>D</given-names></string-name></person-group>. <chapter-title>Direct remaining useful life estimation based on random forest regression</chapter-title>. In: <source>2020 global reliability and prognostics and health management (PHM-Shanghai)</source>; <year>2020 Oct 16&#x2013;18</year>; <publisher-loc>Shanghai, China</publisher-loc>. p. <fpage>1</fpage>&#x2013;<lpage>7</lpage>. doi:<pub-id pub-id-type="doi">10.1109/phm-shanghai49105.2020.9281004</pub-id>.</mixed-citation></ref>
<ref id="ref-45"><label>[45]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Sateesh Babu</surname> <given-names>G</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>P</given-names></string-name>, <string-name><surname>Li</surname> <given-names>XL</given-names></string-name></person-group>. <chapter-title>Deep convolutional neural network based regression approach for estimation of remaining useful life</chapter-title>. In: <person-group person-group-type="editor"><string-name><surname>Navathe</surname> <given-names>SB</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>W</given-names></string-name>, <string-name><surname>Shekhar</surname> <given-names>S</given-names></string-name>, <string-name><surname>Du</surname> <given-names>X</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>XS</given-names></string-name>, <string-name><surname>Xiong</surname> <given-names>H</given-names></string-name></person-group>, editors. <source>Database systems for advanced applications</source>. <publisher-loc>Cham, Switzerland</publisher-loc>: <publisher-name>Springer International Publishing</publisher-name>. 2016. p. <fpage>214</fpage>&#x2013;<lpage>28</lpage>. doi:<pub-id pub-id-type="doi">10.1007/978-3-319-32025-0_14</pub-id>.</mixed-citation></ref>
<ref id="ref-46"><label>[46]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Wen</surname> <given-names>G</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>S</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Remaining useful life estimation in prognostics using deep bidirectional LSTM neural network</article-title>. In: <conf-name>2018 Prognostics Syst Health Management Conference (PHM-Chongqing)</conf-name>; <year>2018 Oct 26&#x2013;28</year>; <publisher-loc>Chongqing, China</publisher-loc>. p. <fpage>1037</fpage>&#x2013;<lpage>42</lpage>.</mixed-citation></ref>
<ref id="ref-47"><label>[47]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname> <given-names>J</given-names></string-name>, <string-name><surname>Li</surname> <given-names>X</given-names></string-name>, <string-name><surname>He</surname> <given-names>D</given-names></string-name></person-group>. <article-title>A directed acyclic graph network combined with CNN and LSTM for remaining useful life prediction</article-title>. <source>IEEE Access</source>. <year>2019</year>;<volume>7</volume>:<fpage>75464</fpage>&#x2013;<lpage>75</lpage>. doi:<pub-id pub-id-type="doi">10.1109/access.2019.2919566</pub-id>.</mixed-citation></ref>
<ref id="ref-48"><label>[48]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kong</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Cui</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Xia</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Lv</surname> <given-names>H</given-names></string-name></person-group>. <article-title>Convolution and long short-term memory hybrid deep neural networks for remaining useful life prognostics</article-title>. <source>Appl Sci</source>. <year>2019</year>;<volume>9</volume>(<issue>19</issue>):<fpage>4156</fpage>. doi:<pub-id pub-id-type="doi">10.3390/app9194156</pub-id>.</mixed-citation></ref>
<ref id="ref-49"><label>[49]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Mo</surname> <given-names>H</given-names></string-name>, <string-name><surname>Lucca</surname> <given-names>F</given-names></string-name>, <string-name><surname>Malacarne</surname> <given-names>J</given-names></string-name>, <string-name><surname>Iacca</surname> <given-names>G</given-names></string-name></person-group>. <article-title>Multi-head CNN-LSTM with prediction error analysis for remaining useful life prediction</article-title>. In: <conf-name>2020 27th Conference of Open Innovations Association (FRUCT)</conf-name>; <year>2020 Sep 7&#x2013;9</year>; <publisher-loc>Trento, Italy</publisher-loc>. p. <fpage>164</fpage>&#x2013;<lpage>71</lpage>.</mixed-citation></ref>
<ref id="ref-50"><label>[50]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hong</surname> <given-names>CW</given-names></string-name>, <string-name><surname>Lee</surname> <given-names>C</given-names></string-name>, <string-name><surname>Lee</surname> <given-names>K</given-names></string-name>, <string-name><surname>Ko</surname> <given-names>MS</given-names></string-name>, <string-name><surname>Kim</surname> <given-names>DE</given-names></string-name>, <string-name><surname>Hur</surname> <given-names>K</given-names></string-name></person-group>. <article-title>Remaining useful life prognosis for turbofan engine using explainable deep neural networks with dimensionality reduction</article-title>. <source>Sensors</source>. <year>2020</year>;<volume>20</volume>(<issue>22</issue>):<fpage>6626</fpage>. doi:<pub-id pub-id-type="doi">10.3390/s20226626</pub-id>; <pub-id pub-id-type="pmid">33228051</pub-id></mixed-citation></ref>
<ref id="ref-51"><label>[51]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Liu</surname> <given-names>H</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Jia</surname> <given-names>W</given-names></string-name>, <string-name><surname>Lin</surname> <given-names>X</given-names></string-name></person-group>. <article-title>Remaining useful life prediction using a novel feature-attention-based end-to-end approach</article-title>. <source>IEEE Trans Ind Inf</source>. <year>2021</year>;<volume>17</volume>(<issue>2</issue>):<fpage>1197</fpage>&#x2013;<lpage>207</lpage>. doi:<pub-id pub-id-type="doi">10.1109/tii.2020.2983760</pub-id>.</mixed-citation></ref>
<ref id="ref-52"><label>[52]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Peng</surname> <given-names>C</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Tang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Li</surname> <given-names>L</given-names></string-name>, <string-name><surname>Gui</surname> <given-names>W</given-names></string-name></person-group>. <article-title>A remaining useful life prognosis of turbofan engine using temporal and spatial feature fusion</article-title>. <source>Sensors</source>. <year>2021</year>;<volume>21</volume>(<issue>2</issue>):<fpage>418</fpage>. doi:<pub-id pub-id-type="doi">10.3390/s21020418</pub-id>; <pub-id pub-id-type="pmid">33435633</pub-id></mixed-citation></ref>
<ref id="ref-53"><label>[53]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Amin</surname> <given-names>U</given-names></string-name>, <string-name><surname>Kumar</surname> <given-names>K</given-names></string-name></person-group>. <article-title>Remaining useful life prediction of aircraft engines using hybrid model based on artificial intelligence techniques</article-title>. In: <conf-name>2021 IEEE International Conference on Prognostics and Health Management (ICPHM)</conf-name>; <year>2021 Jun 7&#x2013;9</year>; <publisher-loc>Detroit, MI, USA</publisher-loc>. p. <fpage>1</fpage>&#x2013;<lpage>10</lpage>.</mixed-citation></ref>
<ref id="ref-54"><label>[54]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Yu</surname> <given-names>K</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>D</given-names></string-name>, <string-name><surname>Li</surname> <given-names>H</given-names></string-name></person-group>. <article-title>A prediction model for remaining useful life of turbofan engines by fusing broad learning system and temporal convolutional network</article-title>. In: <conf-name>2021 8th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)</conf-name>; <year>2021 Dec 10&#x2013;12</year>; <publisher-loc>Beijing, China</publisher-loc>. p. <fpage>137</fpage>&#x2013;<lpage>42</lpage>.</mixed-citation></ref>
<ref id="ref-55"><label>[55]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Liu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Guo</surname> <given-names>W</given-names></string-name>, <string-name><surname>Bian</surname> <given-names>H</given-names></string-name>, <string-name><surname>He</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>Z</given-names></string-name></person-group>. <article-title>Prediction of remaining useful life of turbofan engine based on optimized model</article-title>. In: <conf-name>2021 IEEE 20th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)</conf-name>; <year>2021 Aug 18&#x2013;20</year>; <publisher-loc>Shenyang, China</publisher-loc>. p. <fpage>1473</fpage>&#x2013;<lpage>7</lpage>.</mixed-citation></ref>
<ref id="ref-56"><label>[56]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chen</surname> <given-names>X</given-names></string-name>, <string-name><surname>Zeng</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Convolution-graph attention network with sensor embeddings for remaining useful life prediction of turbofan engines</article-title>. <source>IEEE Sens J</source>. <year>2023</year>;<volume>23</volume>(<issue>14</issue>):<fpage>15786</fpage>&#x2013;<lpage>94</lpage>. doi:<pub-id pub-id-type="doi">10.1109/jsen.2023.3279365</pub-id>.</mixed-citation></ref>
<ref id="ref-57"><label>[57]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Keshun</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Guangqi</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Yingkui</surname> <given-names>G</given-names></string-name></person-group>. <article-title>A 3-D attention-enhanced hybrid neural network for turbofan engine remaining life prediction using CNN and BiLSTM Models</article-title>. <source>IEEE Sens J</source>. <year>2024</year>;<volume>24</volume>(<issue>14</issue>):<fpage>21893</fpage>&#x2013;<lpage>905</lpage>. doi:<pub-id pub-id-type="doi">10.1109/jsen.2023.3296670</pub-id>.</mixed-citation></ref>
<ref id="ref-58"><label>[58]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Liu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Zheng</surname> <given-names>X</given-names></string-name>, <string-name><surname>Xue</surname> <given-names>A</given-names></string-name>, <string-name><surname>Ge</surname> <given-names>M</given-names></string-name>, <string-name><surname>Jiang</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Multi-head self-attention-based fully convolutional network for RUL prediction of turbofan engines</article-title>. <source>Algorithms</source>. <year>2024</year>;<volume>17</volume>(<issue>8</issue>):<fpage>321</fpage>. doi:<pub-id pub-id-type="doi">10.3390/a17080321</pub-id>.</mixed-citation></ref>
<ref id="ref-59"><label>[59]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hua</surname> <given-names>J</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>D</given-names></string-name>, <string-name><surname>He</surname> <given-names>J</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Fang</surname> <given-names>X</given-names></string-name></person-group>. <article-title>Dynamic feature-aware graph convolutional network with multisensor for remaining useful life prediction of turbofan engines</article-title>. <source>IEEE Sens J</source>. <year>2024</year>;<volume>24</volume>(<issue>18</issue>):<fpage>29414</fpage>&#x2013;<lpage>28</lpage>. doi:<pub-id pub-id-type="doi">10.1109/jsen.2024.3435071</pub-id>.</mixed-citation></ref>
<ref id="ref-60"><label>[60]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Lacoste</surname> <given-names>A</given-names></string-name>, <string-name><surname>Luccioni</surname> <given-names>A</given-names></string-name>, <string-name><surname>Schmidt</surname> <given-names>V</given-names></string-name>, <string-name><surname>Dandres</surname> <given-names>T</given-names></string-name></person-group>. <article-title>Quantifying the carbon emissions of machine learning</article-title>. <comment>arXiv:1910.09700. 2019</comment>.</mixed-citation></ref>
</ref-list>
</back>
</article>