alphaFeedback

WorksComputer Science

From Retrieval to Recognition:Knowledge-Enhanced Post-training of Time Series Foundation Models for Classification

AI contributions
Not recorded for this paper
View details
Ancillary data
2 code links
View

Abstract

Time series foundation models (TSFMs) have achieved notable progress in classification tasks through large-scale pretraining. However, their post-training practice mainly focuses on implicit parameter fine-tuning, where task-relevant information is entangled with abundant irrelevant knowledge in vast parameter spaces. This may hinder TSFMs from precisely activating useful knowledge for downstream classification. To this end, we propose Retrieval-to-Recognition (R2R), a plug-and-play post-training paradigm that adapts pretrained TSFMs to time series classification. Rather than pretraining a new foundation model, R2R improves how existing TSFMs are post-trained: it introduces a decoupled query encoder to extract discriminative patterns and retrieve instance-level numerical knowledge from a constructed knowledge base. The retrieved explicit knowledge is then fused with the TSFM's implicit parametric embeddings, enabling joint knowledge transfer at both the parameter and feature levels. In this way, R2R allows TSFMs to recall task-relevant patterns learned during pretraining, improving the efficiency of knowledge utilization in downstream classification transfer. Experiments on 158 time series datasets show that R2R consistently improves the classification performance of state-of-the-art TSFMs. Ablation and knowledge-enhanced studies further validate the effectiveness of the proposed framework.

Introduction

Time series data are widespread in critical domains such as traffic monitoring [1], medical diagnosis [2], and action recognition [3, 4]. As a core task in time series analysis, time series classification (TSC) aims to extract discriminative patterns in sequences with complex temporal dynamics to distinguish categories [5]. During the past decades, TSC methods have evolved from distance-based approaches [6, 7], to feature-engineering strategies such as the Rocket family [8, 9, 10], and to supervised deep learning models [11, 12, 13]. More recently, inspired by the success of pretraining, TSFMs have emerged as a promising research direction [14, 15, 16]. This shift advances TSC toward general-purpose modeling, utilizing large-scale pretraining to support diverse classification tasks.

Existing TSFMs for classification typically employ a pretraining paradigm that exploits extensive, multi-domain datasets [17, 18]. This process can be regarded as a critical knowledge learning stage (Figure 1a), where the model captures rich discriminative patterns from the pretraining dataset [19, 20]. Through this stage, explicit class patterns in raw time series are compressed into implicit, parameterized knowledge encoded within model weights [21, 22]. Hence, pretrained TSFMs serve as knowledge carriers, providing superior parameter initialization compared to training from scratch.

Illustration of knowledge paradigms in TSFMs for classification

Figure 1. Illustration of knowledge paradigms in TSFMs for classification. (a) Knowledge learning: TSFMs learn discriminative class patterns from multi-domain pretraining data, storing knowledge implicitly in model parameters. (b) Knowledge transfer: Existing methods adapt this knowledge to target tasks via parameter fine-tuning, without explicitly reusing pretraining data knowledge. (c) Knowledge enhancement: R2R enhances parameter transfer with feature-level retrieval, explicitly leveraging numerical patterns from a pretraining knowledge base to boost recognition. Stage (a) is pretraining; (b) and (c) are post-training, and this work targets the (b)→\rightarrow(c) transition.

Building on pre-trained TSFMs, existing approaches [18, 19, 20] typically employ parameter fine-tuning for knowledge transfer to downstream TSC tasks (Figure 1b). This adaptation is the post-training stage of foundation models [23, 24], for which supervised fine-tuning remains the dominant instantiation in TSC. However, parameter-only fine-tuning discards pretraining data, limiting access to informative numerical patterns in the source corpus. Task-relevant knowledge remains entangled with irrelevant information in large parameter spaces, hindering precise activation of useful knowledge for transfer. Moreover, prior studies [21, 25] show that simply scaling model parameters does not consistently improve TSC performance. These observations motivate a key question: beyond parameter-based transfer, can explicit data-level knowledge from the pretraining dataset be leveraged to enable more effective transfer?

A straightforward way to incorporate data-level knowledge is to reuse pretraining data during fine-tuning. However, large-scale pretraining datasets make direct reuse inefficient for transfer. In TSC, performance mainly depends on capturing class-relevant patterns in input data, such as discriminative subsequences [26, 27, 28]. These patterns are often sparsely distributed and mixed with substantial noise and class-irrelevant variations [29, 30]. Inspired by retrieval-augmented methods in pretrained language models [31, 32], we argue that constructing query embeddings for input time series and retrieving feature-similar class patterns from pretraining datasets, yielding explicit instance-level knowledge. This retrieval process filters irrelevant samples while focusing on class-relevant patterns, providing more direct data-level knowledge than parameter-only fine-tuning.

Therefore, we propose Retrieval-to-Recognition (R2R), a plug-and-play post-training framework that advances pretrained TSFMs from retrieval to recognition (Figure 1c). R2R goes beyond parameter-based transfer by introducing a dedicated query encoder to efficiently retrieve class-relevant patterns from large-scale pretraining datasets. The query encoder captures local and global features with positional information to identify feature-level class patterns for each input time series, enabling explicit acquisition of data-level knowledge. The retrieved patterns are then integrated with the pretrained TSFM’s parameter-derived embeddings, allowing the TSFM to effectively recall task-relevant patterns from the pretraining corpus for accurate transfer. This retrieval-driven paradigm mitigates the limitations of parameter-only approaches by enabling feature-level transfer, offering a new post-training paradigm for TSC.

Our main contributions are summarized as follows:

  • We introduce R2R, a plug-and-play post-training framework for TSC that enhances pretrained TSFMs by utilizing external numerical knowledge derived from a constructed pretraining knowledge base, facilitating instance-level knowledge integration beyond parameter-only transfer, without modifying the original pretraining process of TSFMs.

  • We design a decoupled query encoder with a gradient-free backbone to efficiently extract and retrieve discriminative numerical patterns, enabling multi-domain inputs to access class-relevant patterns for each query instance and to bridge retrieval with downstream TSC.

  • Experiments on 158 datasets demonstrate that R2R consistently improves classification performance of existing pretrained TSFMs in both supervised fine-tuning and zero-shot feature extraction, with further analyses confirming the effectiveness of each module.

Related work

Foundation models for time series classification

Deep learning has made significant progress in TSC due to its strong representation learning capability [33, 34, 35, 36, 37]. Early studies [38, 33, 11] demonstrated that end-to-end convolutional models serve as strong supervised baselines for TSC. Subsequent work [39, 40, 14] explored transfer learning, showing that pretraining improves classification performance across datasets. With the rise of large-scale pretraining, TSFMs have become a major research focus [15]. Studies [17, 18, 21] further indicate that models pretrained on large time series corpora learn more general and classification-oriented representations. Building on this paradigm, recent approaches [41, 19, 22, 20, 42] further improve pretraining strategies and model architectures, achieving strong generalization across diverse TSC tasks. However, existing TSFMs primarily rely on implicit parameter-based transfer, that is, on supervised fine-tuning as the sole post-training mechanism [24], overlooking the potential gains from explicit numerical instances inherent in the pretraining dataset.

Time series retrieval augmented models

Retrieval-augmented methods [43, 31, 32] have shown strong performance in NLP by enhancing large language models with task-relevant information retrieved from external knowledge bases. Inspired by this paradigm, recent work [44, 45] introduces retrieval mechanisms into time series modeling. For forecasting tasks, prior studies [46, 47, 48, 44] retrieve relevant historical sequences and temporal patterns to guide future value prediction, while other methods [49, 50] build structured time series knowledge bases for cross-domain retrieval and improved zero-shot forecasting. Despite these advances, retrieval-augmented methods for classification remain underexplored. This gap is non-trivial, as forecasting and classification require fundamentally different retrieval targets: forecasting extrapolates future trends from long historical observations [48], whereas classification focuses on identifying discriminative patterns within fixed-length observation windows [11]. To address this limitation, we design a dedicated query encoder to retrieve instance-level discriminative patterns from a class-relevant numerical feature space. The retrieved knowledge is integrated into the fine-tuning process of pretrained TSFMs, enabling a retrieval-to-recognition framework for TSC.

Problem definition

This work focuses on univariate TSC using TSFMs [15, 33]. Let x∈RLx \in\mathbb{R}^{L} denote a univariate time series sample of length LL. The goal is to predict its corresponding class label y∈{1,2,…,C}y \in\{1, 2, \ldots, C\}, where CC represents the number of classes in the target downstream dataset Dt\mathcal{D}_t. Given a pretrained TSFM denoted by F(⋅)\mathcal{F}(\cdot), conventional paradigms facilitate knowledge transfer solely through parameter fine-tuning. In contrast, we introduce an explicit knowledge base Dk={xi}i=1N\mathcal{D}_k = \{x_i\}_{i=1}^{N} constructed from large-scale, multi-domain pretraining corpora [18]. For a given query xx, a retrieval mechanism is designed to identify numerically similar and class-discriminative patterns from Dk\mathcal{D}_k, yielding a knowledge-enhanced representation zaugz_{\mathrm{aug}}. The final classification is performed by combining the implicit parametric knowledge stored in F(⋅)F(\cdot) with the retrieved explicit numerical knowledge zaug\mathbf{z}_{\mathrm{aug}}, enabling effective knowledge transfer on the target dataset DtD_t.

Methodology

Overview

As shown in Figure 2, R2R consists of three modules: knowledge extraction (§ 4.2), knowledge retrieval (§ 4.3), and knowledge enhancement (§ 4.4). The knowledge extraction module (§ 4.2) applies multi-scale downsampling to the input data and uses a gradient-free backbone to extract class-relevant features through local, global, and positional information. These features are projected into compact embeddings for both query embedding zq\mathbf{z}_q and knowledge base construction. The knowledge retrieval module (§ 4.3) uses knowledge base embeddings as keys and zq\mathbf{z}_q to retrieve Top-KK similar instances. Optimal transport [51] is applied to compute distances and produce a weighted aggregation, yielding the augmented embedding zaug\mathbf{z}_{\mathrm{aug}}. The knowledge enhancement module (§ 4.4) fuses the TSFM class token zc\mathbf{z}_c, zq\mathbf{z}_q, and zaug\mathbf{z}_{\mathrm{aug}} via a fusion layer. Finally, the model is trained with a classification loss, enabling parameter transfer while incorporating retrieved numerical knowledge for downstream TSC.

Overall architecture of the R2R framework

Figure 2. The overall architecture of the R2R framework. The knowledge extraction and retrieval modules constitute the query encoder. R2R uses the output of the query encoder as feature-level knowledge and fuses it with parameter-level class-token embeddings from pre-trained TSFMs for knowledge enhancement.

Knowledge extraction

The knowledge extraction module maps both time series samples from the pretraining knowledge base DkD_k and target query inputs x∈RL\mathbf{x} \in\mathbb{R}^{L} from DtD_t into compact, class-discriminative embeddings for efficient retrieval. For this purpose, we adopt a gradient-free backbone as the core feature extractor, operating with frozen parameters to extract features from the input time series without training. Prior work [8, 9, 10] shows that convolutional models with randomly or fixed initialized parameters provide strong feature representations for TSC. Similarly, pretrained TSFMs [19, 20, 25] can produce discriminative embeddings without fine-tuning. However, these approaches primarily focus on local features from single-scale inputs, often neglecting global dependencies and positional structure. To mitigate this issue, we design the knowledge extraction module to capture discriminative numerical information from three aspects: local patterns, global patterns, and positional patterns.

Local patterns. We employ a gradient-free backbone to extract local features directly from the raw single-scale input x^∈RL\hat{x} \in\mathbb{R}^{L}, where x^\hat{x} may originate from either the pretraining knowledge base DkD_k or the target domain DtD_t. The backbone is model-agnostic with frozen parameters. The resulting local embedding is defined as

fraw=ϕ(x^),(1)f_{\mathrm{raw}} = \phi(\hat{x}), \tag*{(1)}

where ϕ(⋅)\phi(\cdot) denotes the gradient-free feature, which takes an input of arbitrary length and returns a fixed-dimensional vector by pooling over the temporal axis.

Although frawf_{\mathrm{raw}} captures local temporal patterns, it may be less sensitive to variations in signal intensity and local energy distribution [52]. To address this, we introduce an instantaneous envelope feature that emphasizes amplitude-related characteristics. Specifically, given x^\hat{x}, we compute

fenv=max⁡t[AvgPool1D⁡(∣x^∣,l)]t∈R,(2)f_{\mathrm{env}} = \max_{t}\left[\operatorname{AvgPool1D}(|\hat{x}|, l)\right]_{t} \in\mathbb{R}, \tag*{(2)}

where ll denotes the sliding window (or fixed-length subsequence) size, and [⋅]t[\cdot]_{t} denotes the tt-th pooled entry. This feature highlights local energy concentration and peak amplitude variations [53], capturing signal intensity dynamics from a feature engineering perspective.

Global patterns. To capture global temporal patterns beyond local embeddings, we construct multi-scale inputs via temporal downsampling. Existing methods [8, 19], including the local pattern module, mainly operate on the original sequence, limiting their ability to model long-range discriminative patterns. Prior studies [54, 55] indicate that downsampling generates sparse sequences that retain key temporal structures while enlarging the receptive field, facilitating global pattern learning over longer horizons. Given an input x^∈RL\hat{x} \in\mathbb{R}^{L}, we generate scale-specific embeddings as

fds,s=ϕ(Downsample⁡(x^,s)),s∈{2,…,⌊L2⌋},(3)f_{\mathrm{ds},s} = \phi\left(\operatorname{Downsample}(\hat{x},s)\right), \quad s \in\left\{2,\ldots,\left\lfloor\frac{L}{2}\right\rfloor\right\}, \tag*{(3)}

where Downsample⁡(⋅,s)\operatorname{Downsample}(\cdot,s) denotes a stride-based temporal subsampling operator that selects sparse time steps at interval ss, i.e. it keeps every ss-th sample without applying an anti-aliasing low-pass filter, so it is not a band-limited resampling operation, and ϕ(⋅)\phi(\cdot) is the backbone defined in Eq. (1). This design enables the model to capture broader temporal context by leveraging sparse observations over longer horizons.

However, larger downsampling scales may overlook critical transition points that capture fine-grained temporal dynamics. To mitigate this issue, we compute first-order differences Δxt=xt+1−xt\Delta x_t = x_{t+1} - x_t and define a turning point indicator I((Δxt⋅Δxt+1)<0)\mathbb{I}((\Delta x_t \cdot\Delta x_{t+1}) < 0) to detect sign changes, and further introduce a turning-point density-based scalar gating mechanism:

ftp=1L−2∑t=1L−2It,fgated=fds,s⋅tanh⁡(ftp),(4)f_{\mathrm{tp}} = \frac{1}{L-2}\sum_{t=1}^{L-2}\mathbb{I}_{t}, \quad f_{\mathrm{gated}} = f_{\mathrm{ds},s} \cdot\tanh(f_{\mathrm{tp}}), \tag*{(4)}

which provides a lightweight feature extraction design that enhances global patterns.

Positional patterns. In TSC, similar discriminative patterns may correspond to different classes depending on their time point positions [56]. Hence, we construct a positional feature based on the relative peak location by combining local patterns and turning-point information as follows:

fpos=fenv⊕ftp⊕arg⁡max⁡t∣x^t∣L,(5)f_{\mathrm{pos}} = f_{\mathrm{env}} \oplus f_{\mathrm{tp}} \oplus\frac{\arg\max_{t}|\hat{x}_{t}|}{L}, \tag*{(5)}

where ⊕\oplus denotes concatenation and the last term denotes the normalized time index of the maximum-amplitude point. This feature captures the temporal placement of salient patterns and aids in distinguishing classes that differ primarily by pattern location.

Finally, we concatenate the local, global, and positional patterns and map them into a unified embedding space via a lightweight projection layer:

z=ψ(fraw⊕fds,s⊕fgated⊕fpos),(6)z = \psi\left(f_{\mathrm{raw}} \oplus f_{\mathrm{ds},s} \oplus f_{\mathrm{gated}} \oplus f_{\mathrm{pos}}\right), \tag*{(6)}

where ψ(⋅)\psi(\cdot) denotes a learnable projection function. This formulation integrates class-related features into a discriminative embedding for retrieval. Notably, the computation of frawf_{\mathrm{raw}}, fds,sf_{\mathrm{ds},s}, fgatedf_{\mathrm{gated}}, fposf_{\mathrm{pos}} do not require gradient-based optimization and can be efficiently obtained in a training-free manner.

Knowledge retrieval

Through Eq. (6) in the knowledge extraction module, the embeddings of the knowledge base Dk\mathcal{D}_k are collected into the set ZS={zS,i∈Rd}i=1N\mathcal{Z}_S = \{z_{S,i} \in\mathbb{R}^{d}\}_{i=1}^{N}, while a query input x∈RL\mathbf{x} \in\mathbb{R}^{L} from Dt\mathcal{D}_t is mapped to a query embedding zq∈Rdz_q \in\mathbb{R}^{d}. The retrieval module aims to efficiently identify the Top-KK nearest neighbors of zqz_q from ZS\mathcal{Z}_S, and construct a feature-level augmented representation zaugz_{\mathrm{aug}}.

To perform efficient nearest neighbor search, we first normalize the embeddings obtained from the knowledge extraction module:

z~S,i=zS,i∥zS,i∥2,z~q=zq∥zq∥2.(7)\tilde{z}_{S,i} = \frac{z_{S,i}}{\lVert z_{S,i} \rVert_2}, \qquad\tilde{z}_q = \frac{z_q}{\lVert z_q \rVert_2}. \tag*{(7)}

The normalized embeddings are indexed via inverted file system with product quantization (IVFPQ) [57], which partitions the embedding space into nlistn_{\mathrm{list}} Voronoi cells and encodes residuals with product quantization, forming an index structure:

I=IVFPQ⁡(ZS;nlist,m,b),(8)\mathcal{I} = \operatorname{IVFPQ}(\mathcal{Z}_S; n_{\mathrm{list}}, m, b), \tag*{(8)}

where mm denotes the number of subspaces and bb the number of bits per subspace. In practice, this index is implemented using a GPU-accelerated inverted file system based on Faiss [58], enabling a scalable and efficient creation. Given a query embedding, the Top-KK nearest neighbors are retrieved from the index I\mathcal{I} based on cosine similarity:

N(zq)=TopK⁡zS,i∈I⟨z~q,z~S,i⟩.(9)\mathcal{N}(z_q) = \operatorname{TopK}_{z_{S,i} \in\mathcal{I}} \langle\tilde{z}_q, \tilde{z}_{S,i} \rangle. \tag*{(9)}

During querying, only a small subset of Voronoi cells (nprobe≪nlistn_{\mathrm{probe}} \ll n_{\mathrm{list}}) is visited, leading to sublinear complexity with respect to the database size. Specifically, the search cost scales as O(nprobe⋅Nnlist⋅m)\mathcal{O}\left(n_{\mathrm{probe}} \cdot\frac{N}{n_{\mathrm{list}}} \cdot m\right), where NN is the database size and mm is the number of product quantization subspaces [57]. This formulation allows efficient Top-KK retrieval even for large-scale databases. With parallel GPU execution [58], the retrieval latency remains at the millisecond level when N≤106N \leq10^6.

To account for varying relevance among retrieved samples, we introduce an optimal transport (OT) weighting scheme [59]. The transport cost and normalized weights are defined as

ck=1−⟨z~q,z~S,k⟩,wk=exp⁡(−ck/ε)∑j=1Kexp⁡(−cj/ε)+ϵ,(10)c_k = 1 - \langle\tilde{z}_q, \tilde{z}_{S,k} \rangle, \qquad w_k = \frac{\exp(-c_k/\varepsilon)}{\sum_{j=1}^{K}\exp(-c_j/\varepsilon) + \epsilon}, \tag*{(10)}

where ε>0\varepsilon> 0 controls smoothness and ϵ\epsilon ensures numerical stability. This formulation uses OT distances to evaluate similarity in the underlying feature distribution space [51], yielding more reliable weights for feature aggregation. The final augmented representation is computed as

zaug=∑k=1KwkzS,k⊕(zq−∑k=1KwkzS,k),(11)z_{\mathrm{aug}} = \sum_{k=1}^{K} w_k z_{S,k} \oplus\left(z_q - \sum_{k=1}^{K} w_k z_{S,k}\right), \tag*{(11)}

which preserves both retrieved knowledge and query-specific information in a unified form.

Knowledge enhancement

This module integrates the implicit parametric embedding (class token) from pretrained TSFMs with the explicit numerical knowledge produced by the query encoder, which consists of the knowledge extraction and retrieval modules. The fused embedding is then used for supervised classification in the target domain, enabling joint transfer of parametric and retrieved numerical knowledge.

Knowledge fusion. Let zc∈Rdz_c \in\mathbb{R}^{d} denote the class token from pretrained TSFMs. Given the query embedding zqz_q and the retrieved representation zaugz_{\mathrm{aug}} produced by the query encoder, we perform gated residual fusion:

gq=σ(Wqzc),gr=σ(Wrzc),(12)g_q = \sigma(\mathbf{W}_q z_c), \qquad g_r = \sigma(\mathbf{W}_r z_c), \tag*{(12)}
zfused=LayerNorm⁡(zc+gq⊙zq+gr⊙zaug),(13)z_{\mathrm{fused}} = \operatorname{LayerNorm}\left(z_c + g_q \odot z_q + g_r \odot z_{\mathrm{aug}}\right), \tag*{(13)}

where σ(⋅)\sigma(\cdot) is the sigmoid function, Wq,Wr\mathbf{W}_q, \mathbf{W}_r are learnable matrices, and ⊙\odot denotes element-wise multiplication. This formulation adaptively integrates parametric and retrieval-based information while maintaining class-related feature fusion. The inclusion of zqz_q further injects task-specific supervision into the projection learning in Eq. (6), improving the alignment between query-conditioned representations and discriminative patterns in the knowledge base.

Supervised fine-tuning. The fused representation zfusedz_{\mathrm{fused}} is directly fed into the lightweight classifier H(⋅)H(\cdot), and the model is optimized using the cross-entropy objective:

pi=H(zfused,i),LCE=−1∣Dt∣∑(H(zfused),yi)∈Dtlog⁡pi,yi,(14)p_i = H(z_{\mathrm{fused},i}), \qquad\mathcal{L}_{\mathrm{CE}} = -\frac{1}{\lvert D_t \rvert}\sum_{(H(z_{\mathrm{fused}}),y_i)\in D_t}\log p_{i,y_i}, \tag*{(14)}

where pi,yip_{i,y_i} denotes the predicted probability for the ground-truth class yiy_i. During fine-tuning, gradients are propagated through the pre-trained TSFM and the projection layers in the knowledge extraction module. This enables coordinated optimization of parametric representations and retrieval-based knowledge alignment for improved classification performance.

Experiments

We evaluate R2R on univariate time series classification across 128 UCR datasets [60] under a fully supervised fine-tuning setting. For the retrieval process in R2R, we construct a knowledge base from the pretraining datasets of NuTime [18], Mantis [19], and UniShape [20], which collectively comprise 1.89M (million) samples drawn from the training sets of multi-domain datasets [60, 61, 62, 63]. From this pool, we derive a class-balanced subset of 100K (thousand) samples to form the final knowledge base for efficient retrieval. Following [20], we also evaluate generalization on 30 additional univariate time series datasets [64] in a zero-shot feature extraction setting. Further details on datasets, baselines, and implementation settings are provided in Appendix § 8.

Main results

This section evaluate R2R by integrating three advanced TSFMs [18, 19, 20], denoted as R2RNuTime_{\mathrm{NuTime}}, R2RMantis_{\mathrm{Mantis}}, and R2RUniShape_{\mathrm{UniShape}}, and compare them with 18 baselines, including non-deep learning (Non-DL) methods (Rocket [8], Mini-Rocket [9], RDST [55], MultiRocket-Hydra (MR-H) [65], HIVE-COTE 2.0 (HC-2) [66]), supervised neural learning (S-DL) models (Inception Time [11], TS2Vec [67], PatchTST [68], TimesNet [69], SoftShape [70], MambaSL [13]), and TSFM-based methods (GPT4TS [71], MOMENT [17], UniTS [21], NuTime [18], TS-RAG [49], Mantis [19], UniShape [20]). We report average rank based on test classification accuracy and the number of datasets with the best accuracy (Win) on 128 UCR datasets to reduce bias from abnormally high or low accuracy results on individual datasets. All baselines and R2R variants are run under the same evaluation protocol: the official UCR train/test splits, the officially released hyperparameters of each method, and the same hardware budget, so the reported ranks are not confounded by extra tuning granted to R2R (see Appendix § 8). In addition, we assess statistical significance using the Wilcoxon signed-rank test (p-value) and critical difference (CD) diagrams [72]. A p-value below 0.05 indicates significant pairwise differences, while CD diagrams provide a global comparison in which lower CD values denote better performance and methods not connected by a solid line differ significantly.

Table 1 reports the results of comparing the test classification accuracy among 21 methods (including three R2R variants) on 128 UCR datasets; detailed results are provided in Appendix § 9. R2RR2R consistently improves all three integrated TSFMs, with R2RUniShapeR2R_{\mathrm{UniShape}} achieving the best overall performance, significantly outperforming all baselines as confirmed by the Wilcoxon pp-values (all <0.05< 0.05) and CD diagram in Figure 3a. Similar improvements are observed for R2RNuTimeR2R_{\mathrm{NuTime}} and R2RMantisR2R_{\mathrm{Mantis}}, indicating that retrieval-based knowledge enhancement provides consistent gains beyond parameter-only transfer. Among baselines, Non-DL methods (e.g., Rocket family [65], HIVE-COTE 2.0 [66]) remain strong competitors. TSFMs generally outperform S-DL methods due to large-scale pretraining, with Mantis and UniShape achieving the strongest baseline results, yet they rely solely on implicit parameter transfer. TS-RAG [49], the only retrieval-augmented baseline, ranks 9.31 with 11 wins and thus performs worse than the classification-oriented TSFMs (i.e., Mantis and UniShape) and all three R2R variants, although it retrieves from the same knowledge base as R2R. This gap therefore reflects the classification-specific retrieval and fusion design rather than the retrieved corpus, and shows that R2R improves the post-training stage without introducing a new backbone or pretraining objective. In summary, the results demonstrate that retrieval-based knowledge effectively enhances parametric representations for TSC, enabling more positive transfer and improving TSFMs under a retrieval-to-recognition paradigm.

Critical difference diagrams on 128 UCR datasets and 30 additional datasets

Figure 3. Critical difference diagram on 158 datasets.

Comparison results on zero-shot feature extraction

To further evaluate the effectiveness of retrieval-based numerical knowledge, we follow the setups of [19, 20] and assess R2R under a zero-shot feature extraction setting. Specifically, both the default training and test sets are passed through parameter-frozen TSFMs to obtain embeddings, which are then used to train and evaluate a Random Forest classifier, with no model parameter fine-tuning. We conduct experiments on 30 additional datasets and compare against 11 baselines, including a Random Forest (RF) [73] classifier on raw time series inputs and 10 TSFMs (GPT4TS [71], MOMENT [17], Chronos [74], Moirai [75], UniTS [21], NuTime [18], Mantis [19], UniShape [20], TS-RAG [49], and TSPulse [25]). R2R is built upon pre-trained UniShape in this setting. Note that the same Random Forest serves both as the shared probing classifier over TSFM embeddings and, as the RF baseline, as a classifier fitted on the raw series, so Table 2 reports one RF column (see Appendix § 8).

As shown in Table 2 and Figure 3b, R2R achieves the best performance and consistently yields statistically significant improvements over all baselines. The detailed results of Table 2 are presented in Appendix § 10. We observe that classification-oriented TSFMs (NuTime [18], Mantis [19], UniShape [20]) generally outperform forecasting-oriented models (Chronos [74], Moirai [75]), indicating the importance of task alignment. While TS-RAG [49] improves Chronos via retrieval originally proposed for forecasting tasks, it remains inferior to R2R due to its lack of a classification-specific design. As the TS-RAG method is built on the same knowledge base as R2R in this setting (Appendix § 10), the gap in average rank (3.97 vs. 1.73) is attributable to the classification-specific retrieval target and fusion rather than to the retrieved corpus. On the whole, without any task-specific parameter fine-tuning, R2R uses retrieval-based feature-level knowledge for downstream time series classification, achieving substantially better performance than TSFMs that rely solely on parameter-based transfer.

MetricRFGPT4TSMOMENTChronosMoiraiUniTSNuTimeMantisUniShapeTS-RAGTSPulseR2R
Avg. Rank5.809.006.536.339.0011.875.635.805.203.975.371.73
Win2112100115121
P-value8.52E-061.28E-051.43E-061.30E-059.31E-082.05E-082.11E-052.64E-058.20E-071.33E-049.31E-08-

Table 2. Test accuracy results on 30 additional datasets under the zero-shot feature extraction setting.

Ablation studies

This section presents ablation studies to analyze each component of R2R under two settings: (i) w/o Feature transfer, where the query encoder is removed and only the pretrained TSFM is fine-tuned; and (ii) w/o Parameter transfer, where the pretrained TSFM is removed and classification relies solely on the query encoder, with further ablations on knowledge retrieval and gradient-free backbone selection. As shown in Table 3, removing feature transfer significantly degrades performance, indicating the importance of retrieval-based numerical knowledge. Under w/o Parameter transfer, using MiniRocket [9] as the backbone, the knowledge retrieval module (with Retrieval) improves TSC results (e.g., Avg. Rank: 4.14 vs. 5.09), while removing the retrieval module (w/o zaugz_{\mathrm{aug}}) and multi-scale global and positional patterns in the knowledge extraction module (w/o ReMGP) further reduces performance, showing its role in enhancing embedding discriminability. We also compare gradient-free backbones for the query encoder, where MultiRocket [10] performs best but shows limited gains over parameter-frozen UniShape [20], while outperforming Rocket [8].

Overall, all w/o Parameter transfer variants perform substantially worse than full R2RUniShape_{\mathrm{UniShape}} and even underperform w/o Feature transfer, suggesting that pretrained TSFM parameter transfer via supervised fine-tuning is the main knowledge source, while retrieval-based feature transfer provides further improvements. These variants also indicate whether the improvement is inherited from the strong Rocket-family extractors used by the query encoder: Rocket and MiniRocket rank only 7.62 and 7.75 in Table 1, well behind parameter-only UniShape (4.47) and R2RUniShape_{\mathrm{UniShape}} (3.01), and here a parameter-frozen UniShape query encoder (4.52) is comparable to MultiRocket (4.06), so R2R is not tied to the Rocket family. Since every w/o Parameter transfer variant stays far behind full R2RUniShape_{\mathrm{UniShape}} (1.48 with 86 wins), the gain originates from jointly fine-tuning retrieved numerical knowledge with pretrained TSFM parameters rather than from a stronger feature extractor.

MethodAvg. RankWinP-value
Non-DL
Rocket7.62181.01E-13
MiniRocket7.75131.82E-13
RDST7.38201.12E-11
MR-H6.27222.04E-10
HC-25.16313.62E-07
S-DL
InceptionTime9.41131.56E-15
TS2Vec12.6581.25E-18
PatchTST18.1961.20E-20
TimesNet17.1159.47E-21
SoftShape9.20142.03E-14
MambaSL13.13147.37E-18
TSFMs
GPT4TS17.0649.47E-21
MOMENT17.5828.47E-21
UniTS16.7425.93E-21
NuTime10.26152.21E-15
TS-RAG9.31111.44E-16
Mantis8.07218.43E-12
UniShape4.47311.68E-04
Ours
R2RNuTime7.90235.64E-12
R2RMantis6.18292.31E-07
R2RUniShape3.0148-

Table 1. Test accuracy results on 128 UCR datasets under the fully supervised setting.

Table 4 studies the impact of the knowledge base in R2R using 18 representative UCR datasets following [20] for efficient analysis under large-scale retrieval. A class-balanced subset of 100K samples from the pretraining dataset achieves the best trade-off between accuracy and efficiency. Here, Time (s) denotes the additional average time for knowledge extraction and retrieval with the R2R query encoder across the 18 datasets. Increasing the knowledge base from 50K to 100K introduces only minor overhead (about 4 seconds per dataset), while scaling to 1.89M samples raises the time by about 4.5×. Yet, the time cost remains manageable (within 7 minutes per dataset). Moreover, Table 4 indicates that both class diversity and distribution balance are critical for effective numerical knowledge transfer. Detailed results of Table 3 and Table 4 are provided in Appendix § 11.

Table 3: Test accuracy results of ablation study on 128 UCR time series datasets.

MethodBackboneAvg. RankWinP-value
R2RUniShape_{\mathrm{UniShape}}-1.4886-
w/o Feature transfer-2.45481.68E-04
w/o Parameter transfer, with RetrievalMiniRocket4.14133.60E-18
w/o Parameter transfer, w/o RetrievalMiniRocket5.09111.58E-18
w/o Parameter transfer, w/o ReMGPMiniRocket5.5984.56E-19
w/o Parameter transfer, w/o RetrievalRocket5.9189.56E-19
w/o Parameter transfer, w/o RetrievalMultiRocket4.06184.69E-17
w/o Parameter transfer, w/o RetrievalUniShape4.52135.58E-19

Table 3.

Table 4: Test accuracy results on 18 UCR datasets under varying knowledge base sizes and sampling strategies.

SizeSamplingAvg. RankWinTime (s)
50KBalanced4.11388.01
100KBalanced2.33892.11
200KBalanced3.289119.79
500KBalanced3.116207.49
1MBalanced3.176361.77
1.89MBalanced4.175414.80
100KRandom3.17592.11
100KUnbalanced6.50292.11

Table 4.

Knowledge-enhanced analysis

To analyze how R2R utilizes retrieved embeddings for knowledge enhancement, we visualize target sample representations using the t-SNE [76] method. Figure 4a shows embeddings from the pretrained UniShape based on parameter fine-tuning, Figure 4b shows embeddings from the retrieval module in R2R, and Figure 4c shows the fused embeddings combining parameter- and feature-level knowledge for final TSC. In Figure 4a, classes 1 and 2 are partially mixed, whereas Figure 4b and Figure 4c exhibit clearer separation. These results indicate that R2R retrieves class-discriminative features from the pretraining knowledge base, improving inter-class separability. Additional visualizations in Appendix § 12 further confirm consistent gains across different datasets and multi-class settings.

Parameter-level embeddingsRetrieved feature-level embeddingsKnowledge-enhanced embeddings

Figure 4. t-SNE visualization on the SonyAIBORobotSurface1 dataset.

To verify the effectiveness of R2R for retrieval-based numerical knowledge enhancement, Table 5 compares 7 representative time series data augmentation methods [77, 78]. As shown, these methods often degrade performance relative to the Raw setting (fine-tuning without augmentation), indicating negative transfer on many datasets. In contrast, R2R retrieves class-relevant embeddings from a knowledge base to help pretrained TSFMs recall pretraining knowledge for augmentation, thereby improving positive transfer in TSC. This advantage likely stems from reduced randomness compared to conventional stochastic augmentations, which may disrupt intrinsic class structures in time series.

MetricRawJitterTime warpMagnitude warpWindow sliceTime flipPermutationScalingR2R
Avg. Rank2.395.115.064.894.335.065.504.832.00

Table 5. Test results on 18 UCR datasets compared with different data augmentation methods.

Finally, we select four datasets from the 30 additional datasets, covering different numbers of classes, to evaluate R2R under continual classification fine-tuning. Table 6 compares standard parameter-only fine-tuning with R2R transfer. R2R consistently outperforms parametric fine-tuning alone on AccA1\mathrm{Acc}_{A1} and AccA2\mathrm{Acc}_{A2}, and exhibits less forgetting after continual fine-tuning, indicating that retrieved embeddings help mitigate pre-trained knowledge forgetting and improve transfer generalization across downstream tasks. Additional results for continual fine-tuning, together with data augmentation descriptions and detailed results in Table 5, are presented in Appendix § 12. Appendix § 13 reports hyperparameter analysis, and Appendix § 14 reports a preliminary multivariate evaluation in which R2RUniShape\mathrm{R2R}_{\mathrm{UniShape}} is extended to ten UEA datasets [61] through a trainable linear channel adapter. Appendix § 15 and I provide limitations and broader impacts.

Dataset ADataset BOnly parameter transferR2R transfer
AccA1AccA2ForgettingAccA1AccA2Forgetting
AsphaltRegularityUni_eqFloodModeling1_disc0.96540.48870.47670.97340.79090.1825
GesturePebbleZ1_eqColposcopy0.94770.52330.42440.95350.71510.2384
AllGestureWiimoteX_eqAllGestureWiimoteY_eq0.76710.24290.52420.77860.27710.5015
GestureMidAirD1_eqGestureMidAirD2_eq0.75380.12310.63070.76920.15380.6154

Table 6. Impact of continual fine-tuning for TSC. AccA1\mathrm{Acc}_{A1}: Initial accuracy on dataset AA; AccA2\mathrm{Acc}_{A2}: Accuracy on dataset AA after continual training on dataset BB; Forgetting: AccA1\mathrm{Acc}_{A1} - AccA2\mathrm{Acc}_{A2}.

Conclusion

This paper presents R2R, a retrieval-to-recognition post-training framework that enhances pretrained TSFMs for time series classification. R2R employs a plug-and-play query encoder to retrieve class-relevant numerical knowledge and integrates it with parametric representations for downstream classification. Experiments demonstrate that R2R consistently improves pretrained TSFMs via joint parameter- and feature-level knowledge transfer, attaining the best average rank with 48 wins among 21 baselines on the 128 UCR datasets under supervised fine-tuning and 21 wins among 12 baselines on the 30 additional datasets under zero-shot feature extraction, with all gains being statistically significant (p<0.05p < 0.05). However, R2R acts only at the post-training stage and contributes no new pretraining objective or backbone architecture, and it currently relies on a knowledge base built from univariate time series. A preliminary multivariate extension through a trainable linear channel adapter is reported in Appendix § 14, where R2RUniShape\mathrm{R2R}_{\mathrm{UniShape}} attains the best average rank on ten UEA datasets, although the retrieved knowledge itself is still univariate. Future work will explore more general retrieval module designs and build natively multivariate knowledge bases, so that inter-variable dependencies are captured by retrieval rather than by an input adapter.

Acknowledgments

We thank the anonymous reviewers for their helpful feedbacks. We thank Professor Eamonn Keogh and all the people who have contributed to the UCR archive and other time series classification datasets. This work was partially supported by the Singapore NRF AI4S project (NRF-AI4SCH-2025-0001), the Ministry of Education, Singapore, under its Academic Research Fund (AcRF) Tier 1 grant (RG16/25), the SMU-SUTD Internal Research Grant Call (SMU-SUTD 2023_02_01), the SUTD Kickstarter Initiative (SKI 2021_06_12), and AIMfg, A*STAR, Singapore, under its MTI WS Fund. This work was also partially supported by the National Natural Science Foundation of China (Grant Nos. 62272173, 62273109), the Natural Science Foundation of Guangdong Province (Grant Nos. 2024A1515010089, 2022A1515010179), the Science and Technology Planning Project of Guangdong Province (Grant No. 2023A0505050106), and the National Key R&D Program of China (Grant No. 2023YFA1011601).

Experiment setting

Datasets and knowledge base

This study employs the univariate UCR Time Series Archive [60] as the primary benchmark for classification, encompassing 128 datasets from a wide range of real-world domains. Detailed dataset statistics are reported in Table 7. All 128 UCR time series datasets are utilized for fully supervised classification fine-tuning evaluation.

IDDataset nameTrain sizeTest sizeNo. classesLengthIDDataset nameTrain sizeTest sizeNo. classesLength
1ACSF110010010146065ItalyPowerDemand671029224
2Adiac3903913717666LargeKitchenAppliances3753753720
3AllGestureWiimoteX30070010Vary67Lightning260612637
4AllGestureWiimoteY30070010Vary68Lightning770737319
5AllGestureWiimoteZ30070010Vary69Mallat55234581024
6ArrowHead36175325170Meat60603448
7Beef3030547071MedicalImages3817601099
8BeetleFly2020251272MelbournePedestrian119424391024
9BirdChicken2020251273MiddlePhalanxOutlineAgeGroup400154380
10BME30150312874MiddlePhalanxOutlineCorrect600291280
11Car6060457775MiddlePhalanxTW399154680
12CBF30900312876MixedShapesRegularTrain500242551024
13Chinatown2034322477MixedShapesSmallTrain100242551024
14ChlorineConcentration4673840316678MoteStrain201252284
15CinCECGTorso4013804163979NonInvasiveFetalECGThorax11800196542750
16Coffee2828228680NonInvasiveFetalECGThorax21800196542750
17Computers250250272081OliveOil30304570
18CricketX3903901230082OSULeaf2002426427
19CricketY3903901230083PhalangesOutlinesCorrect1800858280
20CricketZ3903901230084Phoneme2141896391024
21Crop720016800244685PickupGestureWiimoteZ505010Vary
22DiatomSizeReduction16306434586PigAirwayPressure104208522000
23DistalPhalanxOutlineAgeGroup40013938087PigArtPressure104208522000
24DistalPhalanxOutlineCorrect60027628088PigCVP104208522000
25DistalPhalanxTW40013968089PLAID53753711Vary
26DodgerLoopDay7880728890Plane1051057144
27DodgerLoopGame20138228891PowerCons1801802144
28DodgerLoopWeekend20138228892ProximalPhalanxOutlineAgeGroup400205380
29Earthquakes322139251293ProximalPhalanxOutlineCorrect600291280
30ECG20010010029694ProximalPhalanxTW400205680
31ECG50005004500514095RefrigerationDevices3753753720
32ECGFiveDays23861213696Rock205042844
33ElectricDevices8926771179697ScreenType3753753720
34EOGHorizontalSignal36236212125098SemgHandGenderCh230060021500
35EOGVerticalSignal36236212125099SemgHandMovementCh245045061500
36EthanolLevel50450041751100SemgHandSubjetCh245045051500
37FaceAll560169014131101ShakeGestureWiimoteZ505010500
38FaceFour24884350102ShapeletSim201802500
39FacesUCR200205014131103ShapesAll60060060512
40FiftyWords45045550270104SmallKitchenAppliances3753753720
41Fish1751757463105SmoothSubspace150150315
42FordA360113202500106SonyAIBORobotSurface120601270
43FordB36368102500107SonyAIBORobotSurface227953265
44FreezerRegularTrain15028502301108StarLightCurves100823631024
45FreezerSmallTrain2828502301109Strawberry6133702235
46Fungi1818618201110SwedishLeaf50062515128
47GestureMidAirD120813026Vary111Symbols259956398
48GestureMidAirD220813026Vary112SyntheticControl300300660
49GestureMidAirD320813026Vary113ToeSegmentation1402282277
50GesturePebbleZ11321726Vary114ToeSegmentation2361302343
51GesturePebbleZ21461586Vary115Trace1001004275
52GunPoint501502150116TwoLeadECG231139282
53GunPointAgeSpan1353162150117TwoPatterns100040004128
54GunPointMaleVersusFemale1353162150118UMD361443150
55GunPointOldVersusYoung1363152150119UWaveGestureLibraryAll89635828945
56Ham1091052431120UWaveGestureLibraryX89635828315
57HandOutlines100037022709121UWaveGestureLibraryY89635828315
58Haptics15530851092122UWaveGestureLibraryZ89635828315
59Herring64642512123Wafer100061642152
60HouseTwenty401192200124Wine57542234
61InlineSkate10055071882125WordSynonyms26763825270
62InsectEPGRegularTrain622493601126Worms181775900
63InsectEPGSmallTrain172493601127WormsTwoClass181772900
64InsectWingbeatSound220198011256128Yoga30030002426

Table 7. Summary of the 128 univariate datasets from the UCR archive used in the fully supervised classification setting. “Train size” and “Test size” indicate the number of instances in the corresponding splits. “No. class” represents the number of classes, and “Length” denotes the time series length. The label “Vary” in the length column signifies datasets with variable-length sequences due to missing values.

For the retrieval module in R2R, the knowledge base is constructed from the pretraining dataset adopted in prior studies [18, 19, 20]. This pretraining dataset integrates the default training sets from the UCR Time Series Archive [60], the UEA Time Series Archive [61], and eight other domain-specific time series datasets [62, 63], resulting in approximately 1.89 million univariate samples. Given the pronounced class imbalance in this aggregated dataset, directly incorporating all samples would incur substantial computational overhead and may degrade retrieval quality. To alleviate this issue, we construct a class-balanced knowledge-base sampling strategy that ensures a minimum of 50 and a maximum of 1,000 samples per class. This procedure yields a balanced subset of approximately 100,000 (100K) samples, preserving class diversity while preventing over-representation of dominant classes and reducing retrieval cost.

Following [20], we further assess zero-shot feature extraction on 30 additional univariate time series datasets [64]. This evaluation protocol examines the capability of R2R to enhance time series classification performance without gradient-based optimization. Detailed statistics of these 30 additional time series datasets are summarized in Table 8.

IDDataset nameTrain sizeTest sizeLengthNo. classesCategory
1AconityMINIPrinterLarge_eq240311843002Sensor
2AconityMINIPrinterSmall_eq5892923002Sensor
3AllGestureWiimoteX_eq30070050010Motion
4AllGestureWiimoteY_eq30070050010Motion
5AllGestureWiimoteZ_eq30070050010Motion
6AsphaltObstaclesUni_eq3903917364Sensor
7AsphaltPavementTypeUni_eq1055105623713Sensor
8AsphaltRegularityUni_eq75175142012Sensor
9Colposcopy991011806Image
10Covid3Month_disc140140843Other
11DodgerLoopDay_nmv67772887Sensor
12DodgerLoopGame_nmv171272882Sensor
13DodgerLoopWeekend_nmv181262882Sensor
14ElectricDeviceDetection62437682562Image
15FloodModeling1_disc4714712662Simulated
16FloodModeling2_disc4664662662Simulated
17FloodModeling3_disc4294292662Simulated
18GestureMidAirD1_eq20813036026Motion
19GestureMidAirD2_eq20813036026Motion
20GestureMidAirD3_eq20813036026Motion
21GesturePebbleZ1_eq1321724556Motion
22GesturePebbleZ2_eq1461584556Motion
23KeplerLightCurves92039947677Sensor
24MelbournePedestrian_nmv113823192410Sensor
25PhoneHeartbeatSound42418230535Other
26PickupGestureWiimoteZ_eq505036110Motion
27PLAID_eq537537134511Device
28ShakeGestureWiimoteZ_eq505038510Motion
29SharePriceIncrease965966602Other
30Tools31013429265Other

Table 8. Summary of the 30 additional univariate time series datasets used for zero-shot feature extraction evaluation. Dataset name suffixes indicate preprocessing protocols: _eq denotes unequallength sequences normalized via mean-padding with Gaussian noise; _nmv refers to datasets originally containing missing values, where only complete instances are retained; and _disc indicates datasets derived from the TSER archive. “Train size” and “Test size” correspond to the number of samples in each split. “No. class” specifies the number of classes, “Length” denotes the sequence length, and “Category” indicates the application domain.

Baselines

Supervised classification on 128 UCR datasets. We consider 18 baselines spanning non-deep learning methods, end-to-end supervised deep models, and pre-trained time series foundation models.

  • Rocket2: Dempster et al. [8] propose Rocket, which applies a large collection of random convolutional kernels with random initialization parameters to extract features, followed by a ridge classifier for efficient time series classification.

  • MiniRocket3: Dempster et al. [9] introduce MiniRocket, a deterministic variant of Rocket with fixed initialization parameters that significantly improves computational efficiency while maintaining similar or higher classification performance.

  • RDST4: Guillaume et al. [55] present RDST, which extends shapelet-based methods by incorporating multi-scale dilation into randomly sampled subsequences for time series classification.

  • MultiROCKET-Hydra (MR-H)5: Dempster et al. [65] propose Hydra, a hybrid approach that combines convolutional kernel transforms with dictionary-based representations using competing kernels.

  • Hive-COTE 2.0 (HC-2)6: Middlehurst et al. [66] develop Hive-COTE 2.0, an ensemble framework integrating classifiers from multiple representations, including shapelets, intervals, and dictionary-based features.

  • InceptionTime7: Ismail Fawaz et al. [11] propose InceptionTime, an ensemble of deep CNNs with Inception-style modules to capture multi-scale temporal dependencies for classification.

  • TS2Vec8: Yue et al. [67] introduce TS2Vec, which learns robust timestamp-level representations through hierarchical contrastive learning over augmented context views.

  • PatchTST{sup}8: Nie et al. {citep}[68]` propose PatchTST, which segments time series into patches as Transformer tokens and adopts channel-independent modeling for representation learning.

  • TimesNet{sup}9: Wu et al. {citep}[69]` introduce TimesNet, which transforms 1D time series into 2D space based on periodic patterns for general time series modeling.

  • SoftShape{sup}10: Liu et al. {citep}[70]` propose SoftShape, which replaces hard shapelet filtering with learnable soft shapelets for flexible subsequence selection and classification.

  • MambaSL{sup}11: Jung et al. {citep}[13]` introduce MambaSL, which adapts selective state space models with lightweight single-layer Mamba for time series classification.

  • GPT4TS{sup}12: Zhou et al. {citep}[71]` propose GPT4TS, a framework that leverages pre-trained language models with patch-based tokenization for time series modeling.

  • MOMENT14: Goswami et al. [17] introduce MOMENT, a family of Transformer models pre-trained via masked time series prediction on large-scale time series datasets.

  • UniTS15: Gao et al. [21] propose UniTS, a unified Transformer framework that integrates multiple time series tasks through task tokenization.

  • NuTime16: Lin et al. [18] introduce NuTime, which employs multi-scale numerical embeddings to support effective pre-training on diverse time series data.

  • TS-RAG17: Ning et al. [49] propose TS-RAG, which augments a pre-trained time series foundation model with patterns retrieved from an external knowledge base through an adaptive retrieval mixer. As TS-RAG is originally designed for zero-shot forecasting, we adapt it to supervised classification by attaching a classification head to its retrieval-augmented representations and fine-tuning it under the same protocol as the other TSFM baselines, with the retrieval knowledge base constructed in the same way as in R2R.

  • Mantis18: Feofanov et al. [19] propose Mantis, a ViT-based foundation model pre-trained via contrastive learning for time-series classification.

  • UniShape19: Liu et al. [20] introduce UniShape, a shape-aware foundation model that integrates adaptive subsequence selection and prototype-based pretraining.

In summary, among the 18 baselines, 14 methods (Rocket, MiniRocket, RDST, MR-H, InceptionTime, TS2Vec, PatchTST, TimesNet, SoftShape, GPT4TS, MOMENT, UniTS, NuTime, and Mantis) follow the same setup as UniShape [20], while Hive-COTE 2.0 [66], MambaSL [13], and TS-RAG [49] are additionally introduced for comparison.

Zero-shot feature extraction on 30 additional datasets. We evaluate 11 baselines for zero-shot feature extraction, including a Random Forest [73] classifier on raw inputs and 10 pre-trained TSFSMs.

  • Random Forest20: A classical machine learning classifier without gradient-based optimization [73] that directly operates on raw time series, rather than using representations obtained from pre-trained TSFMs. Two roles of the Random Forest should be distinguished, since a single classifier configuration is used throughout. As the probing classifier, it is fitted on the frozen embeddings produced by each TSFM-based method and applied to the corresponding test embeddings; this is the shared evaluation protocol of the zero-shot setting and is not itself a competing method. As the RF baseline, the same classifier is fitted on the raw series x∈RL\mathbf{x} \in\mathbb{R}^{L}, i.e. the degenerate case in which no pretrained model is involved and the LL time steps of a series are passed directly as LL ordered input features. Table 2 therefore contains a single RF column, and comparing it against the remaining columns isolates whether TSFM embeddings are more discriminative than the raw series under an identical classifier.

  • Chronos21: Ansari et al. [74] propose Chronos for time series forecasting, a probabilistic Transformer that tokenizes time series into discrete vocabularies for large-scale pre-training.

  • Moirai22: Woo et al. [75] introduce Moirai, a masked Transformer pre-trained on large multi-domain time series corpora for time series forecasting.

  • TS-RAG23: Ning et al. [49] propose TS-RAG, a retrieval-augmented framework that integrates external patterns through an adaptive retrieval mixer module for zero-shot time series forecasting.

  • TSPulse24: Vijay et al. [25] introduce TSPulse for time-series analysis, a lightweight pre-trained model using hybrid masked reconstruction across temporal, spectral, and semantic embedding spaces.

The remaining baselines (GPT4TS, MOMENT, UniTS, NuTime, Mantis, and UniShape) follow the same configurations as in the supervised setting. Compared to existing work [20], we additionally include TS-RAG [49] and TSPulse [25] as new baselines for zero-shot feature extraction classification evaluation.

Implementation details

For supervised fine-tuning, we integrate R2R with three representative pre-trained time series foundation models, namely NuTime [18], Mantis [19], and UniShape [20], and evaluate them on all 128 datasets from the UCR archive. For R2R combined with NuTime and Mantis, the maximum number of training epochs is set to 500 following the original recommendations, while UniShape is trained for up to 300 epochs. For multi-scale feature extraction in Eq. (3), we employ three downsampling factors {1,2,4}\{1, 2, 4\} following [54]. The sliding window length ll in Eq. (2) is set to 11. In Eq. (8), the nlistn_{\mathrm{list}} is fixed at 256, mm is set to 16, and bb is set to 8. The number of nearest neighbors KK in Eq. (10) is set to 20. For the gradient-free backbone in R2R’s knowledge extraction module, we conduct model selection on each UCR dataset using a validation set sampled from the original training set. The gradient-free backbone is then selected from MiniRocket [9], MultiRocket [10], and the corresponding R2R-enhanced pre-trained TSFM [18, 19, 20] based on validation performance. For zero-shot feature extraction on the additional 30 datasets, we fix the gradient-free backbone to MultiRocket across all experiments to ensure a zero-shot evaluation setting without parameter or model selection. Following prior work [11, 20], we directly use the default training and test splits from the UCR archive for classification evaluation. Model selection is based on the minimum training loss due to the absence of a default validation set. To mitigate potential overfitting, we adopt an ensemble strategy during fine-tuning following [11, 18], where five independently trained models are aggregated to improve generalization with different learning ratios. This ensembling convention is applied consistently to R2R and most supervised deep learning and TSFM-based baselines, following the setting in [20]; MambaSL [13] is reported as a single model because ensembling degraded its accuracy. The Non-DL baselines are gradient-free and follow their official single-model protocols, one of which, HIVE-COTE 2.0 [66], is itself an ensemble of about thirty algorithms drawn from four representation families. For both R2R and all supervised baselines, the reported performance corresponds to the average test accuracy over five runs. All experiments are conducted on a server with two NVIDIA RTX A6000 GPUs, running Ubuntu 20.04.3 with Python 3.9 and PyTorch 1.12.

Knowledge-base provenance and target-data usage. No test sample and no test label of any target dataset is used at any stage of R2R, including pretraining, knowledge-base construction, gradient-free backbone selection, and fine-tuning: the 1.89M source pool aggregates only the default training splits of the datasets listed in Appendix § 8.§ 1. The class-balanced sampler retains source classes with at least 50 samples and caps each class at 1,000, so whether a target dataset can contribute to the knowledge base at all is determined by its per-class training counts. Across the 128 UCR default training splits, no class reaches the 50-sample threshold in 72 datasets, 14 datasets are partly eligible, and 42 have every class eligible; retrieval is therefore strictly cross-dataset on those 72 datasets, whereas for the remaining 56 the knowledge base may contain training samples of the target task. Three controls indicate that the reported gains do not rest on this overlap. First, the full 1.89M pool, which contains every target training split, ranks below the 100K class-balanced subset in Table 4 (4.17 versus 2.33), so adding target training data does not by itself improve R2R. Second, restricting Table 1 to the 72 strictly cross-dataset targets leaves all three improvements intact and slightly larger: the average rank moves from 10.40 to 8.00 for NuTime, from 7.42 to 5.60 for Mantis, and from 4.97 to 3.07 for UniShape, with win/tie/loss counts of 40/15/17, 44/11/17, and 41/16/15. Third, rebuilding a 100K knowledge base that keeps only source classes with at least 381 training samples removes every target class of the 18 datasets in Table 4, whose largest per-class training count is 378, and reduces source-class coverage from 419 to 139; accuracy then changes by only −0.26 and −0.40 percentage points for R2RNuTime and R2RUniShape, with win/tie/loss counts of 7/4/7, that is, no significant difference. We note that this last control excludes target classes by a size threshold rather than by provenance, because the released 1.89M pool does not carry dataset-of-origin labels, which makes a strict leave-one-dataset-out knowledge base infeasible. We also note that pretraining on the target training split alone is standard practice in self-supervised TSC [62, 67], where, as here, the test split remains untouched.

Details of results on 128 UCR datasets

R2RNuTime, R2RMantis, and R2RUniShape, together with the 18 selected baselines, are evaluated under the fully supervised classification setting on 128 UCR time series datasets. The detailed test classification accuracy results are reported in Table 9.

IDDatasetRocketMiniRocketRDSTMR-HCHC2InceptionTS2VecPatchTSTTimesNetSoftShapeMambaSLGPT4TSMOMENTUniTSNuTimeTS-RAGMantisUniShapeR2RNuTimeR2RMantisR2RUniShape
1ACSF10.86000.91000.93000.86000.91000.94000.88000.73000.39000.88000.86000.61000.50000.77000.67000.75000.90000.80000.82000.86000.9300
2Adiac0.79030.82350.71360.83440.81840.81070.75450.66750.62920.81590.87770.76260.14580.51150.51150.82350.81590.82890.81840.84400.8144
3All0.76290.74290.77140.78000.76710.77290.67290.26430.45290.77860.61140.50290.51570.63290.70860.76000.79140.77430.78930.78290.7786
4ArrowHead0.76470.75710.73710.76000.76180.77290.67120.22530.45290.77860.61140.50290.51570.63290.70860.76000.79140.77430.78930.78290.7786
5ArticularyWordRecognition0.80860.73140.68600.86290.90860.77710.73710.69710.44860.84570.59000.40710.48860.57000.66140.73000.5860.74290.67430.73000.7657
6BME0.80000.86670.83330.86670.86670.83330.80000.97330.64000.85400.74290.80570.56570.75430.83430.89710.86670.88670.95670.92000.8333
7Beef0.50000.86670.83330.86670.86670.83330.73330.66670.66670.92000.60000.50000.53330.73330.83330.83330.83330.86670.86670.66670.8333
8BeetleFly0.90000.85000.95000.84000.90000.90000.85000.70000.65000.90000.75000.85000.95000.70000.75000.95000.90000.85000.70000.90000.9500
9Bird0.90000.90000.90000.90000.90000.90000.90000.90000.90001.00000.80000.50000.85000.80000.90000.80001.00000.95000.90000.90001.0000
10BME1.00000.99330.99331.00001.00001.00000.98000.97330.99330.98670.99330.95330.98830.97730.99330.95000.98001.00001.00001.00001.0000
11Car0.91670.93330.93330.92330.90000.88330.78330.71670.76670.86670.81670.83330.66670.78330.83330.88330.88330.93330.93330.91670.9167
12CBF1.00000.99890.99220.99561.00000.99600.74890.74890.95670.99780.99440.82780.97000.87670.9780.99781.00001.00000.99561.00001.0000
13Chl.0.98260.98550.98550.99470.98250.98550.97680.90720.90840.99820.97670.96520.98550.87670.97800.97970.97820.99850.99590.99850.9982
14Chln.0.81560.76300.75760.81930.76220.86540.65230.65230.82290.89710.72160.82420.55640.85780.76300.85260.76330.85390.76220.74950.8635
15Cin.0.83040.86880.93350.92880.99930.66380.79310.74570.81590.90360.62830.75580.56550.80580.96090.86860.84690.95020.96230.90430.9732
16Coffee1.00001.00001.00001.00001.00001.00000.96431.00001.00001.00000.96431.00000.89291.00001.00001.00001.00001.00001.00001.00001.0000
17Coms.0.77200.73600.73600.76180.76800.78800.66000.50800.56800.65600.77600.57600.64800.54800.79200.73200.74000.76800.79200.73600.7800
18CrX.0.82820.81030.80260.80260.83080.79230.79230.52050.53850.82560.58210.53330.69490.68720.78210.82820.81790.82820.80770.82050.8308
IDDatasetRocketMiniRocketRDSTMR-HHC2IncTimeTS2VecPatchTSTTimesNetSoftShapeMambaSLGPT4TSMOMENTUniTSNuTimeTS-RAGMantisUniShapeR2R+NuTimeR2R+MantisR2R+UniShape
19CriY.0.85640.83850.83080.82510.84100.79740.75640.60260.55380.80510.71540.56150.65640.66920.80260.83850.83080.83330.78210.85900.8487
20CriZ.0.85900.82820.84620.83850.84360.82820.81280.56150.60260.84620.68460.55640.73080.69490.79740.84100.85900.84360.82050.85990.8462
21Crop0.75740.76220.76370.76780.76020.77270.75400.07660.71970.77330.24060.66650.66050.65480.78880.77300.78770.77250.78910.78420.7839
22Dian.0.97710.92810.92480.96410.96410.91500.98690.99020.91500.97710.97390.95420.72220.91180.90850.98370.97390.97060.95750.92810.9739
23Disp.0.74100.73380.78420.76260.75540.74820.71220.73380.67630.77700.76980.74820.66910.71220.72660.71940.70500.76980.73380.77700.7914
24Dist.0.76090.76810.77170.76160.76090.75360.75720.68480.76810.77900.74280.73910.67750.72460.76090.78260.76810.78990.77170.81160.7862
25DisW.0.70500.67630.72660.69780.71220.71220.69780.63310.65470.68350.67630.60430.66190.65470.68350.66190.65470.71940.71940.69780.7050
26Dody.0.61250.68750.67500.57500.65000.60000.55000.42500.25000.65000.57500.45000.30000.51250.51250.52500.57500.62500.53750.68750.7250
27Dode.0.86960.87680.84780.89860.92030.93480.89860.65220.51450.86960.83330.68840.83330.82610.86230.93480.84060.92030.83330.95650.9420
28Dodd.0.97100.98550.97830.97550.97830.97830.96380.93480.76090.97830.98550.97100.94930.97100.97100.97100.97830.98550.97830.98550.9855
29Ears.0.75540.76260.73380.73380.74820.75540.74820.72660.75540.74820.73380.74100.74820.69780.74820.74820.74820.75540.76260.75540.7770
30ECG2.0.90510.91000.90000.91000.86000.91000.87000.84000.83000.91500.88000.85000.87000.88000.80000.89000.90000.92000.88000.93000.9400
31ECG5.0.94780.94490.94290.94600.94780.94530.94040.92090.89930.94360.93690.93090.94240.93760.94400.94530.94220.94980.94180.94560.9462
32ECGs.1.00001.00000.99771.00001.00001.00001.00000.76890.89200.99650.73520.95470.82810.82110.97681.00000.95701.00000.96400.98841.0000
33Eles.0.73120.74960.74080.74240.76050.72560.72550.31670.64570.66760.70240.57740.63880.60900.75060.75740.73730.72480.74750.75740.7926

Table 9. Detailed test classification accuracy results on 128 UCR datasets under the fully supervised classification setting. Due to space constraints, dataset names are abbreviated; full names can be referenced via their IDs in Table 7. “IncTime” denotes InceptionTime. The best results are in bold.

Details of results on 30 additional datasets

R2R, together with a Random Forest (RF) classifier applied directly to raw time series, and ten pre-trained TSFMs without any parameter fine-tuning, are evaluated for zero-shot feature extraction on 30 additional time series datasets. Specifically, embeddings extracted from each pre-trained TSFM are used as inputs to a Random Forest classifier for classification evaluation. The detailed test accuracy results are reported in Table 10. Notably, TS-RAG [49] is originally designed for zero-shot time series forecasting and achieves strong performance when combined with the pre-trained Chronos [74] model. In this work, we adapt TS-RAG for zero-shot feature-extraction classification using Chronos, in which the knowledge base used for retrieval is constructed consistently within R2R.

IDDataset nameRFGPT4TSMomentChronosMoiraiUniTSNuTimeMantisUniShapeTS-RAGTSPulseR2R
1AconityMINIPrinterLarge_eq0.90960.65960.86600.92650.80490.58190.84380.87100.86910.92060.92150.9417
2AconityMINIPrinterSmall_eq0.94860.71580.95890.93150.85620.65750.85620.93150.94860.95550.96920.9863
3AllGestureWiimoteX_eq0.52860.41860.53430.41000.29290.08000.54140.49430.53430.57860.53410.6571
4AllGestureWiimoteY_eq0.55710.41570.58570.38290.30140.09710.51290.50860.57710.62000.57290.7000
5AllGestureWiimoteZ_eq0.46430.38710.52860.43430.26140.10290.45430.47570.55570.57000.48860.6943
6AsphaltObstaclesUni_eq0.73660.74170.76470.81590.47310.23790.79540.79800.82350.85680.82100.8261
7AsphaltPavementTypeUni_eq0.77940.79920.76700.69600.48300.35980.82390.73670.78600.70450.68940.8636
8AsphaltRegularityUni_eq0.92280.94140.91740.89350.65910.48070.95340.95340.96270.89610.90480.9694
9Colposcopy0.40590.40590.37620.42570.32670.31680.41580.42570.39600.35640.38610.4158
10Covid3Month_disc0.63930.60660.54100.68850.68850.47540.60660.67210.57380.70490.63930.6721
11DodgerLoopDay_nmv0.68830.18180.33770.42860.40260.19480.42860.42860.54550.57140.54140.5714
12DodgerLoopGame_nmv0.76380.60630.77170.71650.83460.48030.67720.70440.66140.77950.77170.8740
13DodgerLoopWeekend_nmv0.98410.48410.94440.75400.74600.54760.95240.95620.92060.93650.98410.9762
14ElectricDeviceDetection0.87580.85590.85590.86460.87660.82990.86970.86120.86070.86520.86150.8620
15FloodModeling1_disc0.81190.74750.76730.78710.76240.70300.82180.74750.78710.79700.81680.8812
16FloodModeling2_disc0.93530.93030.92540.93030.92540.92040.93030.92540.92540.92040.92540.9502
17FloodModeling3_disc0.76090.69570.67930.66300.66850.63040.70650.65670.67930.70650.71740.9022
18GestureMidAirD2_eq0.51540.30000.62310.42310.28460.03850.48460.50770.66150.76150.77000.7692
19GestureMidAirD2_eq0.41540.09230.60150.57690.21540.10000.47690.49230.60770.68460.64620.6846
20GestureMidAirD3_eq0.22310.16150.43080.24620.19230.03850.25380.28460.39230.50770.48460.5077
21GesturePebbleZ1_eq0.65700.64530.75000.63370.47670.16280.74420.84470.84880.85470.81980.9012
22GesturePebbleZ2_eq0.66460.51900.77850.69620.58230.13290.78480.86080.77220.79110.81010.9114
23KeplerLightCurves0.71430.29820.93490.88970.82960.26820.72680.79450.82960.82960.77440.8521
24MelbournePedestrian_nmv0.89060.78610.62700.81850.76280.10350.89520.83230.89910.87110.87580.9560
25PhoneHeartbeatSound_nmv0.59890.58240.64290.69780.62090.51650.65380.69230.69780.66480.62640.6538
26PickupGestureWiimoteZ_eq0.68000.52000.52000.68000.34000.06000.68000.78000.80000.74000.67000.8800
27PLAID_eq0.79330.45620.72630.78580.56050.14150.66480.69090.73930.78960.73490.8771
28ShakeGestureWiimoteZ_eq0.78000.72000.84000.80000.56000.12000.88000.89000.86000.90000.78000.8800
29SharePriceIncrease0.68840.69150.67810.68010.67180.63870.68940.68220.68220.68630.68140.6915
30Tools0.45520.43280.64180.70150.61190.27610.62690.65670.58960.65670.61890.7164
Avg. Rank5.809.006.536.339.0011.875.635.805.203.975.371.73
Win2112100115121

Table 10. Detailed test classification accuracy results on 30 additional time series datasets under the zero-shot feature extraction setting. The best results are in bold.

Details of ablation results

The detailed ablation study results for R2R on feature- and parameter-transfer settings across all 128 UCR time series datasets are reported in Table 11. In addition, Table 12 presents an analysis of the constructed knowledge base in R2R, examining the impact of its size and different sampling strategies applied to the original 1.89M pre-training samples. These experiments are conducted on a selected subset of 18 UCR datasets. Following prior work [20], the 18 UCR datasets are selected based on criteria such as dataset size, sequence length, application domain, and number of classes, ensuring diversity while keeping the computational cost of large-scale knowledge base evaluation manageable.

IDDataset nameR2R+ UniShapew/o Feature transferMiniRocket with RetrievalMiniRocket w/o RetrievalMiniRocket w/o ReMGPRocket w/o RetrievalMultiRocket w/o RetrievalUniShape w/o Retrieval
1ACSF10.93000.80000.91000.90000.89000.68000.87000.7500
2Adiac0.84140.82890.76120.75700.74280.68800.83380.8312
3AllGestureWiimoteX0.77430.77430.67140.66570.61860.51290.66000.7357
4AllGestureWiimoteY0.80860.79290.72710.72570.64000.66000.73000.7729
5AllGestureWiimoteZ0.76570.74290.68570.66430.61430.73000.69860.7400
6ArrowHead0.92570.88570.89860.89140.88000.82290.85710.8571
7Beef0.83330.86670.75000.66670.83330.50000.76670.7667
8BeetleFly0.95000.85000.95000.95000.90000.90000.90000.9500
9BirdChicken0.90000.95000.90000.90000.90000.90000.95000.9000
10BME1.00001.00000.97670.98000.97330.99331.00001.0000
11Car0.91670.93330.91970.91670.91670.86670.85000.8833
12CBF1.00001.00000.98990.99890.99670.98890.99331.0000
13Chinatown0.98550.95650.97390.97680.97230.96230.95650.9449
14ChlorineConcentration0.86350.95390.67640.66410.61460.64010.70630.7456
15CinCECGTorso0.97320.95000.87390.86670.77610.84200.96230.8717
16Coffee1.00001.00001.00001.00001.00001.00001.00001.0000
17Computers0.78000.76000.71400.73600.73400.63200.72800.7600
18CricketX0.83080.82820.81260.80260.79490.77690.78460.7974
IDDataset nameR2R-UniShapew/o Feature transferMiniRocket with RetrievalMiniRocket w/o RetrievalMiniRocket w/o ReMGPRocket w/o RetrievalMultiRocket w/o RetrievalUniShape w/o Retrieval
19CricketY0.84870.83330.83080.82050.80770.82050.81540.8179
20CricketZ0.84620.84360.76670.72820.66920.81280.68210.8410
21Crop0.78390.77250.77760.76790.76730.77840.78040.7623
22DiatomSizeReduction0.97390.97060.92810.91830.87910.95420.95750.9183
23DistalPhalanxOutlineAgeGroup0.79140.76980.79140.76260.74100.74100.76980.7482
24DistalPhalanxOutlineCorrect0.78620.78990.79810.78620.77170.76810.80800.7862
25DistalPhalanxTW0.70500.71940.68630.67630.67350.64030.69060.6763
26DodgerLoopDay0.72500.62500.66950.66250.71250.61250.62500.6625
27DodgerLoopGame0.94200.92030.88790.88410.88130.92750.92030.9203
28DodgerLoopWeekend0.98550.98550.97830.97830.97830.95650.97830.9783
29Earthquakes0.77700.75540.74220.70500.70220.71940.75540.7986
30ECG2000.94000.92000.93000.93000.92000.91000.92000.8900
31ECG50000.94620.94980.93530.93220.93170.94640.94530.9402
32ECGFiveDays1.00001.00000.98440.98260.99190.98490.99540.9373
33ElectricDevices0.75670.72480.73390.72360.71450.70820.74850.7712
34EOGHorizontalSignal0.67960.67960.61330.61050.60220.58840.61050.6105
35EOGVerticalSignal0.54420.51930.45580.43370.42540.55800.51380.5276
36EthanolLevel0.81400.85000.60200.50400.44400.54800.62200.5680
37FaceAll0.78520.89940.77210.75560.75040.87280.73850.7373
38FaceFour0.97730.95450.91770.90910.90910.80680.93180.9432
39FacesUCR0.95660.96200.93510.93460.92980.92590.94290.9054
40FiftyWords0.84620.84620.82640.81540.81420.77800.83740.8154
41Fish0.98290.98860.94290.93140.86860.90860.97140.9543
42FordA0.96440.96290.93710.93560.95000.93410.95530.9402
43FordB0.87040.86050.79520.79010.79140.79750.83950.8123
44FreezerRegularTrain0.99930.99720.98770.98950.98160.99750.99820.9940
45FreezerSmallTrain0.98460.98280.94650.93960.92820.89120.95540.9958
46Fungi1.00001.00000.96240.96240.96240.95700.94090.9677
47GestureMidAirD10.80770.80000.72000.70000.70000.73080.73850.7538
48GestureMidAirD20.72310.72310.64000.63080.59230.60770.59230.6615
49GestureMidAirD30.53850.46920.47380.46920.51540.42310.46150.4462
50GesturePebbleZ10.94190.94770.89530.87210.88950.80230.91860.8663
51GesturePebbleZ20.95570.97470.83280.82910.79750.85440.87970.8861
52GunPoint1.00001.00000.99330.98670.99330.99330.99330.9800
53GunPointAgeSpan1.00000.99680.97150.97150.96200.99051.00000.9968
54GunPointMaleVersusFemale1.00001.00001.00001.00001.00000.99681.00000.9968
55GunPointOldVersusYoung1.00001.00001.00001.00001.00000.99371.00001.0000
56Ham0.73330.76190.64860.64760.64760.78100.63810.5810
57HandOutlines0.97030.96490.93160.92700.91890.91350.93240.9486
58Haptics0.57470.56820.54870.54870.57140.55190.55840.5649
59Herring0.76560.79690.64060.57810.64060.62500.62500.6406
60HouseTwenty0.99160.98320.92440.92440.93280.89920.93280.9580
61InlineSkate0.52000.49090.45270.45090.43450.44730.46730.4218
62InsectEPGRegularTrain1.00001.00001.00001.00001.00000.99601.00001.0000
63InsectEPGSmallTrain1.00001.00000.96790.96790.96790.95980.99201.0000
64InsectWingbeatSound0.67370.66820.66250.65350.65660.62730.66010.5889
65ItalyPowerDemand0.96500.96400.95140.94750.96400.96600.96700.9359
66LargeKitchenAppliances0.92000.92530.82530.82130.81610.81870.84000.8907
67Lightning20.83610.85250.77050.73770.78690.83610.73770.8033
68Lightning70.83560.86300.80820.78080.75340.76710.84930.7808
69Mallat0.98980.96590.92840.94840.86010.94070.91340.9267
70Meat0.98330.95900.95330.95000.96670.96670.91670.9667
71MedicalImages0.80660.80390.81000.80530.80530.78550.79740.7829
72MelbournePedestrian0.97510.97020.95800.95710.96330.94160.94160.9649
73MiddlePhalanxOutlineAgeGroup0.60390.57140.35920.22730.52600.42210.37010.3831
74MiddlePhalanxOutlineCorrect0.87630.86600.84820.84540.78010.83850.85570.8660
75MiddlePhalanxTW0.57140.50740.56250.55840.59090.57790.50650.4935
76MixedShapesRegularTrain0.97610.97530.96930.95180.94850.95300.96330.9546
77MixedShapesSmallTrain0.94350.95090.86640.79180.74100.81690.90270.9423
78MoteStrain0.94570.93050.96410.95930.91650.83550.96650.9073
79NonInvasiveFetalECGThorax10.95980.95110.89430.87680.82240.91250.92470.9354
80NonInvasiveFetalECGThorax20.96640.95170.96880.96440.95670.96080.96490.9511
81OliveOil0.96670.86670.96670.93330.96670.80000.96670.9333
82OSULeaf0.99170.98350.92980.92980.91740.88020.91320.9380
83PhalangesOutlinesCorrect0.84850.85900.83800.82400.82280.80890.86600.8392
84Phoneme0.38770.37290.35010.30750.29480.25900.37550.3539
85PickupGestureWiiMoteZ0.88000.86000.87000.88000.86000.76000.76000.7800
86PigAirwayPressure0.46630.35100.50960.51920.46630.34620.47120.3798
87PigArtPressure0.99520.98560.95190.94230.92790.82210.91830.8558
88PigCVP0.86540.75000.85580.82210.79810.77880.78370.7404
89PLAID0.90500.89390.85850.69650.73000.34080.43760.6127
90Plane1.00000.99051.00001.00001.00001.00001.00001.0000
91PowerCons0.99441.00000.99440.98890.99440.96670.99440.9778
92ProximalPhalanxOutlineAgeGroup0.85850.85850.81460.81460.82930.84880.84880.8488
93ProximalPhalanxOutlineCorrect0.92780.93470.87630.84540.90720.89000.91070.8832
94ProximalPhalanxTW0.83900.83410.79510.82440.81950.78050.81460.7707
95RefrigerationDevices0.68000.66670.52730.52000.48000.54130.53600.5387
96Rock0.90000.86000.86000.86000.76000.82000.84000.8400
97ScreenType0.58130.56530.51870.51730.49870.42930.49870.4987
98SemgHandGenderCh20.96500.96000.95330.95000.90170.83830.95000.9250
99SemgHandMovementCh20.86670.84220.76890.74670.62890.61780.78000.8356
100SemgHandSubjectCh20.92670.93330.87780.85110.82670.72890.90670.8556
101ShakeGestureWiiMoteZ0.94000.94000.96000.98000.94000.92000.94000.8800
102ShapelesSin1.00001.00000.98330.98331.00000.99441.00001.0000
103ShapesAll0.92170.90500.90000.88830.90000.87330.90330.9117
104SmallKitchenAppliances0.83470.84270.78670.80800.77070.77330.81870.8293
105SmoothSubspace0.98670.98000.91330.90670.88670.93330.93330.9533
106SonyAIBORobotSurface10.94180.93680.93680.93340.95670.95840.93010.9085
107SonyAIBORobotSurface20.95590.89090.94330.94020.93390.94650.89090.9328
108StarLightCurves0.98340.98150.98230.98110.98230.97660.98200.9809
109Strawberry0.97840.98110.95950.97570.90270.90810.96760.9622
110SwedishLeaf0.96960.97760.94920.94400.92640.96160.97280.9616
111Symbols0.99500.99400.98590.98390.98090.97290.98290.9839
112SyntheticControl1.00001.00000.99330.99330.99000.99670.99330.9833
113ToeSegmentation10.96930.95610.95610.95180.95180.96050.93420.9649
114ToeSegmentation20.94620.95380.91540.91540.87690.86150.90000.9231
115Trace1.00001.00001.00001.00001.00001.00001.00001.0000
116TwoLeadECG1.00001.00000.97980.98330.97280.99910.99910.9851
117TwoPatterns1.00001.00001.00000.99980.99981.00001.00000.9998
118UMD0.99311.00000.94440.93060.92750.88190.86810.9861
119UWaveGestureLibraryAll0.97990.97960.96730.96480.95620.97240.97960.9648
120UWaveGestureLibraryX0.88110.87860.85090.84920.83000.84370.85710.8663
IDDataset nameR2R-UniShapew/o Feature transferMiniRocket with RetrievalMiniRocket w/o RetrievalMiniRocket w/o ReMGPRocket w/o RetrievalMultiRocket w/o RetrievalUniShape w/o Retrieval
121UWaveGestureLibraryY0.82750.82690.79200.78420.77530.77530.79620.8074
122UWaveGestureLibraryZ0.83700.83610.80930.80320.78560.78220.81380.8227
123Wafer1.00000.99971.00001.00000.99851.00001.00000.9994
124Wine0.90740.79630.83330.81480.85190.50000.64810.7407
125WordSynonyms0.74920.74920.72730.71160.71940.72100.75390.7335
126Worms0.81820.79220.76620.74030.75320.74030.77920.7792
127WormsTwoClass0.84420.88310.76620.76620.77920.77920.81820.7922
128Yoga0.91270.91970.89000.88100.88230.85700.89670.9087
Avg. Rank1.482.454.145.095.595.914.064.52
Win86481311881813

Table 11. Detailed test classification accuracy results of the ablation study on 128 UCR time series datasets. The best results are in bold.

IDDataset nameBalanced 50KBalanced 100KBalanced 200KBalanced 500KBalanced 1MBalanced 1.89MRandom 100KUnbalanced 100K
1ArrowHead0.86280.88570.88570.88000.85710.86850.88570.8628
2CBF1.00001.00001.00001.00001.00001.00001.00001.0000
3CricketX0.80770.82820.82050.82050.82050.81540.82030.7997
4DistalPhalanxOutlineAgeGroup0.76980.76980.76260.78420.79140.80580.76980.7483
5DistalPhalanxOutlineCorrect0.78260.78990.77540.81520.78260.78260.78630.7790
6ECG50000.94450.94980.95000.94980.94980.94870.94740.9403
7EOGVerticalSignal0.50820.51930.51650.50540.50540.52200.50820.4916
8EthanolLevel0.85200.85000.86600.82600.83800.85200.83600.8280
9Fish1.00000.98861.00001.00001.00001.00001.00000.9829
10GunPoint0.99701.00001.00000.99341.00000.99341.00000.9934
11InsectWingbeatSound0.66120.66820.66370.67730.65660.65870.66470.6531
12ItalyPowerDemand0.96790.96400.97370.96890.94560.96400.96690.9611
13MelbournePedestrian0.96980.97020.96900.96940.97180.96530.97020.9669
14MiddlePhalanxTW0.55200.59740.51950.56500.57150.52600.55200.5440
15MixedShapesRegularTrain0.97450.97530.97450.97410.97490.97370.97490.9704
16OSULeaf0.96350.98350.96290.97530.97530.97530.97940.9711
17Trace1.00001.00001.00001.00001.00001.00001.00001.0000
18WordSynonyms0.74760.74920.75550.75550.75550.74140.73980.7398
Avg. Rank4.112.333.283.113.174.173.176.50
Win38966552

Table 12. Detailed test classification accuracy results on 18 UCR time series datasets under varying knowledge base sizes and sampling strategies. The best results are in bold.

Details of knowledge-enhanced results

We first present t-SNE visualizations [76] to examine the discriminative quality of embeddings learned by R2R across UCR time series datasets with varying domains and class cardinalities. Figures 5, 6, 7, and 8 illustrate the results on four representative UCR datasets, namely Chinatown, ArrowHead, UWaveGestureLibraryAll, and MelbournePedestrian. These datasets differ in application domains and number of classes, enabling a comprehensive analysis. The results demonstrate that incorporating retrieved embeddings improves class separability compared to embeddings obtained solely via parameter fine-tuning.

Furthermore, we compare R2R with seven commonly used time series data augmentation methods on the same 18 UCR datasets used in Table 12. This experiment evaluates whether retrieval-based numerical embeddings can provide more effective knowledge transfer than conventional data augmentation strategies. Those seven time series data augmentation methods [77, 78] are summarized as follows:

  • Jitter: Adds random Gaussian noise to the original time series.

  • Time warp: Randomly distorts the temporal axis by varying the speed of the sequence.

  • Magnitude warp: Applies smooth, non-linear changes to the amplitude of the series.

  • Window slice: Extracts a subsegment via downsampling and resizes it back to the original length.

  • Time flip: Reverses the temporal order of the sequence.

  • Permutation: Divides the series into segments and randomly shuffles their order.

Three t-SNE plots showing parameter-level, retrieved feature-level, and knowledge-enhanced embeddings for the Chinatown dataset

Figure 5. t-SNE visualization on the Chinatown dataset.

Three t-SNE plots showing parameter-level, retrieved feature-level, and knowledge-enhanced embeddings for the ArrowHead dataset

Figure 6. t-SNE visualization on the ArrowHead dataset.

Three t-SNE plots showing parameter-level, retrieved feature-level, and knowledge-enhanced embeddings for the UWaveGestureLibraryAll dataset

Figure 7. t-SNE visualization on the UWaveGestureLibraryAll dataset.

Three t-SNE plots showing parameter-level, retrieved feature-level, and knowledge-enhanced embeddings for the MelbournePedestrian dataset

Figure 8. t-SNE visualization on the MelbournePedestrian dataset.

  • Scaling: Multiplies the entire series by a random scaling factor.

The detailed classification accuracy results of R2R and the seven augmentation methods on the 18 datasets are reported in Table 13. Additionally, Table 14 compares R2R’s transfer paradigm with conventional fine-tuning-based transfer across datasets with different numbers of classes (2, 6, 10, and 26), under a continual fine-tuning setting.

IDDataset nameRawJitterTime warpMagnitude warpWindow sliceTime flipPermutationScalingR2R
1ArrowHead0.88570.86290.84570.86860.86290.88570.84000.87430.9257
2CBF1.00001.00001.00001.00001.00000.83891.00001.00001.0000
3CricketX0.82820.81540.82050.81280.81790.83080.83080.81790.8308
4DistalPhalanxOutlineAgeGroup0.76980.76980.76980.75540.78420.78420.74820.73380.7914
5DistalPhalanxOutlineCorrect0.78990.79350.78990.79710.76090.76090.79710.79350.7862
6ECG50000.94980.94640.93870.94580.94440.94420.94640.94510.9462
7EOGVerticalSignal0.51930.53870.56080.52760.57180.46130.51100.51100.5442
8EthanolLevel0.85000.75200.71400.72600.81000.75800.79800.75600.8140
9Fish0.98860.94860.97140.96570.97710.97710.96570.97140.9829
10GunPoint1.00001.00001.00000.98670.98670.99330.99330.98671.0000
11InsectWingbeatSound0.66820.65150.63990.66110.62830.66670.65400.65510.6737
12ItalyPowerDemand0.96400.96600.95340.96210.95340.96210.95630.96110.9650
13MelbournePedestrian0.97020.96100.96680.96680.96720.96310.96060.96390.9751
14MiddlePhalanxTW0.59740.56490.57140.52600.56490.57140.53900.57790.5714
15MixedShapesRegularTrain0.97530.96540.96990.97610.97730.96950.97360.97650.9761
16OSULeaf0.98350.95450.96280.96690.98350.97110.95040.96690.9917
17Trace1.00001.00001.00001.00001.00001.00001.00001.00001.0000
18WordSynonyms0.74920.72410.73200.74140.73200.67710.71160.72880.7492
Avg. Rank2.395.115.064.894.335.065.504.832.00
Win8433424210

Table 13. Detailed test classification accuracy on 18 UCR datasets compared with different time series data augmentation methods. The best results are in bold.

Dataset ADataset BOnly Parameter transferR2R transfer
AccA1_{A1}AccA2_{A2}ForgettingAccA1_{A1}AccA2_{A2}Forgetting
AconityMINIPrinterSmall_eqAsphaltRegularityUni_eq0.97950.80480.17470.98290.82530.1576
ColposcopyGesturePebbleZ1_eq0.35640.25740.09900.37620.29700.0792
AllGestureWiimoteY_eqAllGestureWiimoteZ_eq0.79710.28290.51420.80710.32860.4785
GestureMidAirD2_eqGestureMidAirD3_eq0.69230.17690.51540.70000.23080.4692

Table 14. Impact of continual fine-tuning for classification on another four group datasets selected from the additional 30 time series datasets. AccA1_{A1}: Initial accuracy on dataset A; AccA2_{A2}: Accuracy on dataset A after continual training on dataset B; Forgetting: AccA1_{A1} - AccA2_{A2}.

Details of hyperparameter analysis results

Table 15 presents the classification performance of R2R under three distance metrics used for retrieval index construction, evaluated on the same 18 UCR datasets as in Table 12. We consider Inner Product (IP), Euclidean Distance (L2), and Cosine Similarity. These metrics differ in both formulation and geometric properties. Specifically, IP computes similarity as ⟨x,y⟩=∑i=1dxiyi\langle x,y\rangle= \sum_{i=1}^{d} x_i y_i, favoring vectors with large aligned magnitudes; L2 measures dissimilarity as ∥x−y∥22=∑i=1d(xi−yi)2\lVert x-y\rVert_2^2 = \sum_{i=1}^{d}(x_i-y_i)^2, capturing absolute geometric distance; while Cosine similarity evaluates angular similarity as ⟨x,y⟩∥x∥2∥y∥2\frac{\langle x,y\rangle}{\lVert x\rVert_2\lVert y\rVert_2}, effectively normalizing vector magnitudes and focusing on directional alignment. As shown in Table 15, Cosine similarity achieves the best average rank, indicating its superiority in retrieving semantically aligned embeddings. Therefore, R2R adopts Cosine similarity as the default distance metric for nearest neighbor retrieval.

IDDataset nameIPL2Cosine
1ArrowHead0.88000.87430.9257
2CBF1.00001.00001.0000
3CricketX0.82570.82570.8308
4DistalPhalanxOutlineAgeGroup0.75540.73390.7914
5DistalPhalanxOutlineCorrect0.77540.80800.7862
6ECG50000.94000.94200.9462
7EOGVerticalSignal0.53320.54970.5442
8EthanolLevel0.83600.80800.8140
9Fish0.96580.96580.9829
10GunPoint1.00001.00001.0000
11InsectWingbeatSound0.67270.66460.6737
12ItalyPowerDemand0.96200.95910.9650
13MelbournePedestrian0.97630.97300.9751
14MiddlePhalanxTW0.51300.53250.5714
15MixedShapesRegularTrain0.97360.97650.9761
16OSULeaf0.98341.00000.9917
17Trace1.00001.00001.0000
18WordSynonyms0.74610.75700.7492
Avg. Rank2.111.891.39
Win5811

Table 15. Detailed test classification accuracy results on 18 UCR time series datasets using different distance metrics within R2R. The best results are in bold.

Tables 16 and 17 further examine the influence of retrieval hyperparameters, including the index partition size nlistn_{\mathrm{list}} and the number of retrieved neighbors KK. The results demonstrate that nlist=256n_{\mathrm{list}} = 256 and K=20K = 20 yield the best average rank, and are thus selected as default settings. Additionally, comparing K=1K = 1 and K=20K = 20 in Table 17 shows that using only a single nearest neighbor significantly degrades performance, as it effectively removes the optimal transport-based weighted fusion mechanism. In contrast, aggregating multiple retrieved neighbors (K=20K = 20) improves both average rank and win rate, highlighting the effectiveness of multi-neighbor retrieval combined with optimal transport-based weighting.

IDDataset nameK=1K=5K=10K=20K=32K=64
1ArrowHead0.91280.95430.93710.92570.94280.9486
2CBF1.00001.00001.00001.00001.00001.0000
3CricketX0.82870.84610.83850.83080.84100.8461
4DistalPhalanxOutlineAgeGroup0.76260.77700.79140.79140.77700.7842
5DistalPhalanxOutlineCorrect0.76080.77890.76810.78620.77890.7391
6ECG50000.94090.93980.94670.94620.94950.9438
7EOGVerticalSignal0.54700.53590.53870.54420.54700.5497
8EthanolLevel0.80600.82800.82000.81400.82800.8060
9Fish0.97150.97150.96580.98290.97720.9715
10GunPoint1.00000.99341.00001.00001.00001.0000
11InsectWingbeatSound0.66660.66970.67570.67370.67320.6762
12ItalyPowerDemand0.96010.95720.96400.96500.95230.9620
13MelbournePedestrian0.96820.97270.97230.97510.97310.9715
14MiddlePhalanxTW0.52590.57140.55190.57140.54540.5064
15MixedShapesRegularTrain0.97410.97200.97360.97610.97740.9732
16OSULeaf0.97930.99170.97930.99170.98340.9917
17Trace1.00001.00001.00001.00001.00001.0000
18WordSynonyms0.74290.74920.73980.74920.73510.7445
Avg. Rank4.113.003.172.062.672.89
Win3841167

Table 17. Detailed test classification accuracy results on 18 UCR time series datasets using different Top-KK retrieval embeddings within R2R. The best results are in bold.

IDDataset namenlist=128n_{\mathrm{list}}=128nlist=256n_{\mathrm{list}}=256nlist=512n_{\mathrm{list}}=512nlist=1024n_{\mathrm{list}}=1024nlist=2048n_{\mathrm{list}}=2048nlist=4096n_{\mathrm{list}}=4096nlist=8192n_{\mathrm{list}}=8192
1ArrowHead0.92000.92570.93140.93140.93140.95430.9486
2CBF1.00001.00001.00001.00001.00001.00001.0000
3CricketX0.82830.83080.80260.82320.82830.79750.8283
4DistalPhalanxOutlineAgeGroup0.78420.79140.78420.78860.77700.76980.7555
5DistalPhalanxOutlineCorrect0.80070.78620.80790.80430.79710.80070.8079
6ECG50000.94440.94620.94620.95090.94310.94800.9391
7EOGVerticalSignal0.54150.54420.54970.53320.54700.51110.5055
8EthanolLevel0.80400.81400.81600.80200.81200.78800.7920
9Fish0.97720.98290.97720.97720.98290.98860.9943
10GunPoint1.00001.00001.00001.00001.00001.00001.0000
11InsectWingbeatSound0.65760.67370.67120.66410.66820.67320.6727
12ItalyPowerDemand0.97080.96500.95820.96600.96700.96210.9689
13MelbournePedestrian0.97310.97510.97470.97630.97350.97510.9759
14MiddlePhalanxTW0.60780.57140.55590.61430.56890.56240.5819
15MixedShapesRegularTrain0.97610.97610.97610.97650.97650.97610.9761
16OSULeaf0.99170.99170.99170.99170.99170.98760.9876
17Trace1.00001.00001.00001.00001.00001.00001.0000
18WordSynonyms0.74920.74920.74920.74610.74770.75390.7571
Avg. Rank3.392.723.112.943.333.673.11
Win5778546

Table 16. Detailed test classification accuracy results on 18 UCR time series datasets using different nlistn_{\mathrm{list}} for retrieval within R2R. The best results are in bold.

Details of multivariate time series classification results

R2R is designed for univariate TSC, and both the query encoder and the knowledge base operate on univariate series. To examine whether the framework also transfers to multivariate time series, we follow the channel-adapter protocol of Mantis [19] and evaluate on the same ten UEA datasets [61] reported in Appendix Table 12. A trainable linear adapter maps the dd input channels of each dataset to ten mixed channels before the R2RUniShape_{\mathrm{UniShape}} pipeline, so that heterogeneous channel counts and cross-channel mixing are handled by the adapter, while the per-channel query embeddings are averaged before retrieval to keep the retrieval module identical to the univariate case.

Table 18 reports the detailed multivariate time series classification results. The three Mantis columns correspond to the None, PCA, and Linear channel adapters and are copied directly from Appendix

IDDataset nameMantis: NoneMantis: PCAMantis: LinearUniShape-based (ours): UniShape (Linear)UniShape-based (ours): R2RUniShape_{\mathrm{UniShape}} (Linear)
1CharacterTrajectories0.9760.9770.9880.9950.995
2DuckDuckGeese0.5400.5800.6000.6000.627
3EigenWorms0.8140.8630.8550.8980.906
4FaceDetection0.5490.5530.5920.6640.657
5HandMovementDirection0.2970.3380.3380.3510.446
6Handwriting0.2810.3150.5140.4640.503
7MotorImagery0.4670.4800.5000.5700.520
8NATOPS0.8890.9390.9060.9090.926
9SelfRegulationSCP20.5170.5330.5330.4940.546
10SpokenArabicDigits0.9370.9550.9870.9950.995
Avg. Rank4.903.302.802.101.40
Win01146

Table 18. Test classification accuracy on ten UEA multivariate datasets under the linear channel-adapter setting. The Mantis columns are taken from Appendix Table 12 of [19], and all accuracies are reported to three decimals. The best results are in bold.

Table 12 of [19]. The two remaining columns are obtained in this work and differ only in whether retrieval is used: UniShape (Linear) applies the same adapter and backbone without the query encoder, whereas R2RUniShapeR2R_{\mathrm{UniShape}} (Linear) additionally retrieves numerical knowledge; the two share the same adapter, backbone, ensembling, training budget, and model-selection protocol. Both Mantis and the two UniShape-based settings are trained on the default UEA training splits and evaluated on the default test splits, and neither uses the test set during training or for weight selection, so the comparison is fair with respect to data usage.

As in the main text, we report the average rank of the test classification accuracy and the number of datasets on which each method is best (Win). R2RUniShapeR2R_{\mathrm{UniShape}} obtains the best average rank (1.40) and the most wins (6 of 10), improving over the parameter-only UniShape (Linear) variant (2.10 with 4 wins) as well as over all three Mantis channel adapters. These results indicate that the retrieval-to-recognition paradigm remains effective once a channel adapter supplies multivariate inputs. We regard this as a preliminary extension rather than a full multivariate design, since it covers ten datasets and the retrieved knowledge itself is still univariate.

Limitations

R2R is specifically positioned at the post-training stage of TSFMs: it improves how an already pretrained model is adapted to downstream classification, and therefore contributes neither new pretraining objectives and backbone architectures nor evidence about pretraining scale. R2R relies on a knowledge base constructed from large-scale pretraining datasets to retrieve class-relevant embeddings for downstream time series classification. In this work, both the retrieval mechanism and the knowledge base are designed for univariate time series, and thus do not explicitly account for multivariate settings, where modeling inter-variable dependencies and handling high-dimensional channels are important. Appendix G reports a preliminary extension in which a trainable linear channel adapter precedes the R2R pipeline on ten UEA datasets; there, inter-variable dependencies are absorbed by the adapter and the retrieved knowledge remains univariate, so the extension does not yet constitute a native multivariate design. Extending R2R to multivariate scenarios, including efficient channel selection and cross-variable representation learning, is a promising direction for future work. In addition, the effectiveness of retrieval-based enhancement depends on the quality of learned embeddings and the composition of the knowledge base. In particular, imbalanced class distributions in the sampled knowledge base may reduce the benefit of retrieval, indicating that diversity and balance of class patterns are important for robust knowledge transfer. This suggests future efforts on designing more robust retrieval strategies and knowledge base construction methods to further improve generalization in complex real-world settings.

Broader impacts

This work proposes R2R, a retrieval-to-recognition post-training framework that enhances pretrained time series foundation models (TSFMs) by incorporating retrieved numerical knowledge from a constructed pretraining knowledge base. By combining implicit parameter knowledge in TSFMs with explicit retrieved feature-level knowledge, R2R provides a plug-and-play mechanism to improve time-series classification across diverse real-world scenarios. It can be seamlessly integrated with existing TSFMs and applied to applications such as activity recognition, healthcare monitoring, and industrial fault diagnosis. The framework relies solely on time-series representations and publicly available benchmark datasets, without involving any personal or sensitive information, and therefore does not introduce additional ethical risks beyond standard machine learning practice.

References

  1. [1]Li Li, Xiaonan Su, Yi Zhang, Yuetong Lin, and Zhiheng Li. Trend modeling for traffic time series analysis: An integrated study. IEEE Transactions on Intelligent Transportation Systems, 16(6):3430–3439, 2015.DOI
  2. [2]Yihe Wang, Nan Huang, Taida Li, Yujun Yan, and Xiang Zhang. Medformer: A multi-granularity patching transformer for medical time-series classification. In Advances in Neural Information Processing Systems, pages 36314–36341, 2024.arxiv.org/abs/2405.19363
  3. [3]Jianbo Yang, Minh Nhut Nguyen, Phyo Phyo San, Xiaoli Li, Shonali Krishnaswamy, et al. Deep convolutional neural networks on multichannel time series for human activity recognition. In International Joint Conference on Artificial Intelligence, pages 3995–4001, 2015.
  4. [4]Xiyuan Zhang, Diyan Teng, Ranak R Chowdhury, Shuheng Li, Dezhi Hong, Rajesh K Gupta, and Jingbo Shang. Unimts: Unified pre-training for motion time series. In Advances in Neural Information Processing Systems, pages 107469–107493, 2024.arxiv.org/abs/2410.19818
  5. [5]Navid Mohammadi Foumani, Lynn Miller, Chang Wei Tan, Geoffrey I Webb, Germain Forestier, and Mahsa Salehi. Deep learning for time series classification and extrinsic regression: A current survey. ACM Computing Surveys, 56(9):1–45, 2024.arxiv.org/abs/2302.02515
  6. [6]Jason Lines and Anthony Bagnall. Time series classification with ensembles of elastic distance measures. Data Mining and Knowledge Discovery, 29(3):565–592, 2015.DOI
  7. [7]Marco Cuturi and Mathieu Blondel. Soft-dtw: A differentiable loss function for time-series. In International Conference on Machine Learning, pages 894–903, 2017.arxiv.org/abs/1703.01541
  8. [8]Angus Dempster, François Petitjean, and Geoffrey I Webb. Rocket: Exceptionally fast and accurate time series classification using random convolutional kernels. Data Mining and Knowledge Discovery, 34(5):1454–1495, 2020.DOI
  9. [9]Angus Dempster, Daniel F Schmidt, and Geoffrey I Webb. Minirocket: A very fast (almost) deterministic transform for time series classification. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, pages 248–257, 2021.DOI
  10. [10]Chang Wei Tan, Angus Dempster, Christoph Bergmeir, and Geoffrey I Webb. Multirocket: Multiple pooling operators and transformations for fast and effective time series classification. Data Mining and Knowledge Discovery, 36(5):1623–1646, 2022.arxiv.org/abs/2102.00457
  11. [11]Hassan Ismail Fawaz, Benjamin Lucas, Germain Forestier, Charlotte Pelletier, Daniel F Schmidt, Jonathan Weber, Geoffrey I Webb, Lhassane Idoumghar, Pierre-Alain Muller, and François Petitjean. Inceptiontime: Finding alexnet for time series classification. Data Mining and Knowledge Discovery, 34(6):1936–1962, 2020.DOI
  12. [12]Xiwen Chen, Peijie Qiu, Wenhui Zhu, Huayu Li, Hao Wang, Aristeidis Sotiras, Yalin Wang, and Abolfazl Razi. Timemail: Advancing multivariate time series classification via a time-aware multiple instance learning. In International Conference on Machine Learning, pages 7190–7206, 2024.arxiv.org/abs/2405.03140
  13. [13]Yoo-Min Jung and Leekyung Kim. MambaSL: Exploring single-layer mamba for time series classification. In International Conference on Learning Representations, pages 1–31, 2026.
  14. [14]Qianli Ma, Zhen Liu, Zhenjing Zheng, Ziyang Huang, Siying Zhu, Zhongzhong Yu, and James T Kwok. A survey on time-series pre-trained models. IEEE Transactions on Knowledge and Data Engineering, 36(12):7536–7555, 2024.arxiv.org/abs/2305.10716
  15. [15]Yuxuan Liang, Haomin Wen, Yuqi Nie, Yushan Jiang, Ming Jin, Dongjin Song, Shirui Pan, and Qingsong Wen. Foundation models for time series analysis: A tutorial and survey. In Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 6555–6565, 2024.DOI
  16. [16]Shengchao Chen, Guodong Long, Michael Blumenstein, and Jing Jiang. Fedal: Federated dataset learning for general time series foundation models. In International Conference on Learning Representations, pages 1–36, 2026.
  17. [17]Mononito Goswami, Konrad Szafer, Arjun Choudhry, Yifu Cai, Shuo Li, and Artur Dubrawski. Moment: A family of open time-series foundation models. In International Conference on Machine Learning, pages 16115–16152, 2024.
  18. [18]Chenguo Lin, Xumeng Wen, Wei Cao, Congrui Huang, Jiang Bian, Stephen Lin, and Zhirong Wu. Nutime: Numerically multi-scaled embedding for large-scale time-series pretraining. Transactions on Machine Learning Research, pages 2835–8856, 2024.
  19. [19]Vasilii Feofanov, Songkang Wen, Shifeng Xie, Simon Roschmann, Marius Alonso, Hongbo Guo, Romain Ilbert, Malik Tiomoko, Quentin Bouniot, Zeynep Akata, Lujia Pan, Jianfeng Zhang, and Ievgen Redko. Mantis: Lightweight foundation model for time series classification. In Forty-third International Conference on Machine Learning, 2026.
  20. [20]Zhen Liu, Yucheng Wang, Boyuan Li, Junhao Zheng, Emadeldeen Eldele, Min Wu, and Qianli Ma. A unified shape-aware foundation model for time series classification. In Proceedings of the AAAI Conference on Artificial Intelligence, pages 23972–23980, 2026.
  21. [21]Shanghua Gao, Teddy Koker, Owen Queen, Thomas Hartvigsen, Theodoros Tsiligkaridis, and Marinka Zitnik. Units: A unified multi-task time series model. In Advances in Neural Information Processing Systems, pages 140589–140631, 2024.arxiv.org/abs/2403.00131
  22. [22]Shifeng Xie, Vasilii Feofanov, Jianfeng Zhang, Themis Palpanas, and Ievgen Redko. Cauker: Classification time series foundation models can be pretrained on synthetic data. In International Conference on Learning Representations, pages 1–29, 2026.
  23. [23]Tianzhe Chu, Yuexiang Zhai, Jihan Yang, Shengbang Tong, Saining Xie, Dale Schuurmans, Quoc V. Le, Sergey Levine, and Yi Ma. SFT memorizes, RL generalizes: A comparative study of foundation model post-training. In International Conference on Machine Learning, pages 10818–10838, 2025.arxiv.org/abs/2501.17161
  24. [24]Zhen Liu, Boyuan Li, Hao Huang, Yanru Sun, Yucheng Wang, Min Wu, and Qianli Ma. From pre-training to post-training: A survey on time series foundation models. TechRxiv, pages 1–23, 2026.DOI
  25. [25]Vijay Ekambaram, Subodh Kumar, Arindam Jati, Sumanta Mukherjee, Tomoya Sakai, Pankaj Dayama, Wesley M. Gifford, and Jayant Kalagnanam. Tpulse: Tiny pre-trained models with disentangled representations for rapid time-series analysis. In International Conference on Learning Representations, pages 1–44, 2026.
  26. [26]Yunshi Wen, Tengfei Ma, Tsui-Wei Weng, Lam M Nguyen, and Anak A Julius. Abstracted shapes as tokens-a generalizable and interpretable model for time-series classification. In Advances in Neural Information Processing Systems, pages 92246–92272, 2024.
  27. [27]Xuan-May Le, Ling Luo, Uwe Aickelin, and Minh-Tuan Tran. Shapeformer: Shapelet transformer for multivariate time series classification. In Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 1484–1494, 2024.
  28. [28]Akash Pandey, Payal Mohapatra, Wei Chen, Qi Zhu, and Sinan Keten. Timesliver: Symbolic-linear decomposition for explainable time series classification. In International Conference on Learning Representations, pages 1–24, 2026.
  29. [29]Patrick Schäfer. The boss is concerned with time series classification in the presence of noise. Data Mining and Knowledge Discovery, 29(6):1505–1530, 2015.DOI
  30. [30]Bosong Huang, Ming Jin, Yuxuan Jiang, Johan Barthelemy, Debo Cheng, Qingsong Wen, Chenghao Liu, and Shirui Pan. Shapex: Shapelet-driven post hoc explanations for time series classification models. In Advances in Neural Information Processing Systems, pages 1–39, 2025.arxiv.org/abs/2510.20084
  31. [31]Patrick Lewis, Ethan Perez, Aleksandra Piktus, Fabio Petroni, Vladimir Karpukhin, Naman Goyal, Heinrich Küttler, Mike Lewis, Wen-tau Yih, Tim Rocktäschel, et al. Retrieval-augmented generation for knowledge-intensive nlp tasks. In Advances in Neural Information Processing Systems, pages 9459–9474, 2020.arxiv.org/abs/2005.11401
  32. [32]Mingyue Cheng, Yucong Luo, Jie Ouyang, Qi Liu, Huijie Liu, Li Li, Shuo Yu, Bohou Zhang, Jiawei Cao, Jie Ma, et al. A survey on knowledge-oriented retrieval-augmented generation. arXiv preprint arXiv:2503.10677, 2025.arxiv.org/abs/2503.10677
  33. [33]Hassan Ismail Fawaz, Germain Forestier, Jonathan Weber, Lhassane Idoumghar, and Pierre-Alain Muller. Deep learning for time series classification: a review. Data Mining and Knowledge Discovery, 33(4):917–963, 2019.
  34. [34]Mingyue Cheng, Qi Liu, Zhiding Liu, Zhi Li, Yucong Luo, and Enhong Chen. Formertime: Hierarchical multi-scale representations for multivariate time series classification. In Proceedings of the ACM Web Conference, page 1437–1445, 2023.arxiv.org/abs/2302.09818
  35. [35]Joseph Early, Gavin Cheung, Kurt Cutajar, Hanting Xie, Jas Kandola, and Niall Twomey. Inherently interpretable time series classification via multiple instance learning. In International Conference on Learning Representations, pages 1–29, 2024.arxiv.org/abs/2311.10049
  36. [36]Shikang Liu, Ziyu Tang, Xiren Zhou, and Huanhuan Chen. Sygl: Scale-variable graph learning in model space for multivariate time series classification. In Proceedings of the AAAI Conference on Artificial Intelligence, pages 23801–23809, 2026.DOI
  37. [37]Viet-Hung Tran, Ngoc Phu Doan, Zichi Zhang, Tuan Dung Pham, Phi Hung Nguyen, Xuan Hoang NGUYEN, Hans Vandierendonck, Ira Assent, and Son T. Mai. MIX: A multi-view time-frequency interactive explanation framework for time series classification. In Advances in Neural Information Processing Systems, pages 1–46, 2025.
  38. [38]Zhiguang Wang, Weizhong Yan, and Tim Oates. Time series classification from scratch with deep neural networks: A strong baseline. In International Joint Conference on Neural Networks, pages 1578–1585, 2017.arxiv.org/abs/1611.06455
  39. [39]Hassan Ismail Fawaz, Germain Forestier, Jonathan Weber, Lhassane Idoumghar, and Pierre-Alain Muller. Transfer learning for time series classification. In IEEE International Conference on Big Data, pages 1367–1376, 2018.DOI
  40. [40]Kathan Kashiparekh, Jyoti Narwariya, Pankaj Malhotra, Lovekesh Vig, and Gautam Shroff. Contvimenet: A pre-trained deep convolutional neural network for time series classification. In International Joint Conference on Neural Networks, pages 1–8, 2019.arxiv.org/abs/1904.12546
  41. [41]Haoran Zhang, Yong Liu, Yunzhong Qiu, Haixuan Liu, Zhongyi Pei, Jianmin Wang, and Mingsheng Long. Timesbert: A bert-style foundation model for time series understanding. In Proceedings of the 33rd ACM International Conference on Multimedia, pages 10975–10983, 2025.arxiv.org/abs/2502.21245
  42. [42]Vasilii Feofanov, Songkang Wen, Jianfeng Zhang, Lujia Pan, and Ievgen Redko. Mantisv2: Closing the zero-shot gap in time series classification with synthetic data and test-time strategies. arXiv preprint arXiv:2602.17868, 2026.arxiv.org/abs/2602.17868
  43. [43]Kelvin Guu, Kenton Lee, Zora Tung, Panupong Pasupat, and Mingwei Chang. Retrieval augmented language model pre-training. In International Conference on Machine Learning, pages 3929–3938, 2020.
  44. [44]Fanpu Cao, Lu Dai, Jindong Han, and Hui Xiong. Enhancing multivariate time series forecasting with global temporal retrieval. In International Conference on Learning Representations, pages 1–29, 2026.
  45. [45]Shichao Ma, Zhengyang Zhou, Qihe Huang, Binwu Wang, and Yang Wang. Quizsf: A retrieval-augmented framework for zero-shot time series forecasting. In Proceedings of the ACM Web Conference, page 1947–1958, 2026.arxiv.org/abs/2508.06915
  46. [46]Jingwei Liu, Ling Yang, Hongyan Li, and Shenda Hong. Retrieval-augmented diffusion models for time series forecasting. In Advances in Neural Information Processing Systems, pages 2766–2786, 2024.arxiv.org/abs/2410.18712
  47. [47]Yudong Li, Jingyuan Wang, Xie Yu, Peiyu Wang, and Qian Huang. Cross city traffic flow generation via retrieval augmented diffusion model. In Advances in Neural Information Processing Systems, 2025.DOI
  48. [48]Sungwon Han, Seungeon Lee, Meeyoung Cha, Sercan O Arik, and Jinsung Yoon. Retrieval augmented time series forecasting. In International Conference on Machine Learning, pages 21774–21797, 2025.arxiv.org/abs/2505.04163
  49. [49]Kanghui Ning, Zijie Pan, Yu Liu, Yushan Jiang, James Y Zhang, Kashif Rasul, Anderson Schneider, Lintao Ma, Yuriy Nevmyvaka, and Dongjin Song. Ts-rag: Retrieval-augmented generation based time series foundation models are stronger zero-shot forecaster. In Advances in Neural Information Processing Systems, 2025.arxiv.org/abs/2503.07649
  50. [50]Huanyu Zhang, Chang Xu, Yifan Zhang, Zhang Zhang, Liang Wang, and Jiang Bian. Timeraf: Retrieval-augmented foundation model for zero-shot time series forecasting. IEEE Transactions on Knowledge and Data Engineering, 37(9):5654–5665, 2025.arxiv.org/abs/2412.20810
  51. [51]Marco Cuturi. Sinkhorn distances: Lightspeed computation of optimal transport. In C.J. Burges, L. Bottou, M. Welling, Z. Ghahramani, and K. Weinberger, editors, Advances in Neural Information Processing Systems, pages 2292–2300, 2013.
  52. [52]Norden E Huang, Zheng Shen, Steven R Long, Manli C Wu, Hsing H Shih, Quanan Zheng, Nai-Chyuan Yen, Chi Chao Tung, and Henry H Liu. The empirical mode decomposition and the hilbert spectrum for nonlinear and non-stationary time series analysis. Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 454(1971):903–995, 1998.DOI
  53. [53]David Abboud, J Antoni, S Sieg-Zieba, and M Eltabach. Envelope analysis of rotating machine vibrations in variable speed conditions: a comprehensive treatment. Mechanical Systems and Signal Processing, 84:200–226, 2017.DOI
  54. [54]Zhicheng Cui, Wenlin Chen, and Yixin Chen. Multi-scale convolutional neural networks for time series classification. arXiv preprint arXiv:1603.06995, 2016.arxiv.org/abs/1603.06995
  55. [55]Antoine Guillaume, Christel Vrain, and Wael Elloumi. Random dilated shapelet transform: A new approach for time series shapelets. In International Conference on Pattern Recognition and Artificial Intelligence, pages 653–664, 2022.DOI
  56. [56]Rundong Zuo, Guozhong Li, Byron Choi, Sourav S Bhowmick, Daphne Ngar-vin Mah, and Grace LH Wong. Svp-t: A shape-level variable-position transformer for multivariate time series classification. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 37, pages 11497–11505, 2023.DOI
  57. [57]Herve Jegou, Matthijs Douze, and Cordelia Schmid. Product quantization for nearest neighbor search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 33(1):117–128, 2010.DOI
  58. [58]Matthijs Douze, Alexandr Gushvа, Chengqi Deng, Jeff Johnson, Gergely Szilvasy, Pierre-Emmanuel Mazaré, Maria Lomeli, Lucas Hosseini, and Hervé Jégou. The faiss library. IEEE Transactions on Big Data, 12(2):346–361, 2026.
  59. [59]Eduardo Fernandes Montesuma, Fred Maurice Ngole Mboula, and Antoine Souloumiac. Recent advances in optimal transport for machine learning. IEEE Transactions on Pattern Analysis and Machine Intelligence, 47(2):1161–1180, 2025.DOI
  60. [60]Hoang Anh Dau, Anthony Bagnall, Kaveh Kamgar, Chin-Chia Michael Yeh, Yan Zhu, Shaghayegh Gharghabi, Chotirat Ann Ratanamahatana, and Eamonn Keogh. The ucr time series archive. IEEE/CAA Journal of Automatica Sinica, 6(6):1293–1305, 2019.arxiv.org/abs/1810.07758
  61. [61]Anthony Bagnall, Hoang Anh Dau, Jason Lines, Michael Flynn, James Large, Aaron Bostrom, Paul Southam, and Eamonn Keogh. The uea multivariate time series classification archive, 2018. arXiv preprint arXiv:1811.00075, 2018.
  62. [62]Emadeldeen Eldele, Mohamed Ragab, Zhenghua Chen, Min Wu, Chee Keong Kwoh, Xiaoli Li, and Cuntai Guan. Time-series representation learning via temporal and contextual contrasting. In International Joint Conference on Artificial Intelligence, pages 2352–2359, 2021.arxiv.org/abs/2106.14112
  63. [63]Xiang Zhang, Ziyuan Zhao, Theodoros Tsiligkaridis, and Marinka Zitnik. Self-supervised contrastive pre-training for time series via time-frequency consistency. In Advances in Neural Information Processing Systems, volume 35, pages 3988–4003, 2022.arxiv.org/abs/2206.08496
  64. [64]Matthew Middlehurst, Patrick Schäfer, and Anthony Bagnall. Bake off redux: A review and experimental evaluation of recent time series classification algorithms. Data Mining and Knowledge Discovery, 38(4):1958–2031, 2024.
  65. [65]Angus Dempster, Daniel F Schmidt, and Geoffrey I Webb. Hydra: Competing convolutional kernels for fast and accurate time series classification. Data Mining and Knowledge Discovery, 37(5):1779–1805, 2023.arxiv.org/abs/2203.13652
  66. [66]Matthew Middlehurst, James Large, Michael Flynn, Jason Lines, Aaron Bostrom, and Anthony Bagnall. Hive-cote 2.0: A new meta ensemble for time series classification. Machine Learning, 110(11):3211–3243, 2021.DOI
  67. [67]Zhihan Yue, Yujing Wang, Junyong Duan, Tianmeng Yang, Congrui Huang, Yunhai Tong, and Bixiong Xu. Ts2vec: Towards universal representation of time series. In Proceedings of the AAAI conference on artificial intelligence, pages 8980–8987, 2022.arxiv.org/abs/2106.10466
  68. [68]Yuqi Nie, Nam H Nguyen, Phanwadee Sinthong, and Jayant Kalagnanam. A time series is worth 64 words: Long-term forecasting with transformers. In International Conference on Learning Representations, pages 1–24, 2023.arxiv.org/abs/2211.14730
  69. [69]Haixu Wu, Tengge Hu, Yong Liu, Hang Zhou, Jianmin Wang, and Mingsheng Long. Timesnet: Temporal 2d-variation modeling for general time series analysis. In International Conference on Learning Representations, pages 1–23, 2023.arxiv.org/abs/2210.02186
  70. [70]Zhen Liu, Yicheng Luo, Boyuan Li, Emadeldeen Eldele, Min Wu, and Qianli Ma. Learning soft sparse shapes for efficient time-series classification. In International Conference on Machine Learning, pages 39032–39059, 2025.arxiv.org/abs/2505.06892
  71. [71]Tian Zhou, Peisong Niu, Liang Sun, Rong Jin, et al. One fits all: Power general time series analysis by pretrained lm. Advances in neural information processing systems, 36:43322–43355, 2023.arxiv.org/abs/2302.11939
  72. [72]Janez Demšar. Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research, 7(Jan):1–30, 2006.
  73. [73]Leo Breiman. Random forests. Machine Learning, 45(1):5–32, 2001.
  74. [74]Abdul Fatir Ansari, Lorenzo Stella, Ali Caner Turkmen, Xiyuan Zhang, Pedro Mercado, Huibin Shen, Oleksandr Shchur, Syama Sundar Rangapuram, Sebastian Pineda Arango, Shubham Kapoor, Jasper Zschiegner, Danielle C. Maddix, Hao Wang, Michael W. Mahoney, Kari Torkkola, Andrew Gordon Wilson, Michael Bohlke-Schneider, and Bernie Wang. Chronos: Learning the language of time series. Transactions on Machine Learning Research, pages 1–42, 2024.arxiv.org/abs/2403.07815
  75. [75]Gerald Woo, Chenghao Liu, Akshat Kumar, Caiming Xiong, Silvio Savarese, and Doyen Sahoo. Unified training of universal time series forecasting transformers. In International Conference on Machine Learning, pages 53140–53164, 2024.arxiv.org/abs/2402.02592
  76. [76]Laurens Van der Maaten and Geoffrey Hinton. Visualizing data using t-sne. Journal of Machine Learning Research, 9(11):2579–2605, 2008.
  77. [77]Qingsong Wen, Liang Sun, Fan Yang, Xiaomin Song, Jingkun Gao, Xue Wang, and Huan Xu. Time series data augmentation for deep learning: A survey. In International Joint Conference on Artificial Intelligence, pages 4653–4660, 2021.DOI
  78. [78]Guillermo Iglesias, Edgar Talavera, Ángel González-Prieto, Alberto Mozo, and Sandra Gómez-Canaval. Data augmentation techniques in time series domain: a survey and taxonomy. Neural Computing and Applications, 35(14):10123–10145, 2023.

Paper details

vlnc:W_xyhe3a7w
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Computer Science

Not recorded for this paper · View statement →

Looking for related papers…
Contents