A T RANSFORMER - BASED F RAMEWORK FOR M ULTIVARIATE T IME S ERIES R EPRESENTATION L EARNING
Anonymous Authors
Paper under double-blind review
A BSTRACT
In this work we propose for the ﬁrst time a transformer-based framework for unsupervised representation learning of multivariate time series.
Pre-trained models can be potentially used for downstream tasks such as regression and classiﬁcation, forecasting and missing value imputation.
We evaluate our models on several benchmark datasets for multivariate time series regression and classiﬁcation and show that they exceed current state-of-the-art performance, even when the number of training samples is very limited, while at the same time offering computational efﬁciency.
We show that unsupervised pre-training of our transformer models offers a substantial performance beneﬁt over fully supervised learning, even without leveraging additional unlabeled data, i.e., by reusing the same data samples through the unsupervised objective
I NTRODUCTION
Multivariate time series (MTS) are an important type of data that is ubiquitous in a wide variety of domains, including science, medicine, ﬁnance, engineering and industrial applications.
Despite the recent abundance of MTS data in the much touted era of “Big Data”, the availability of labeled data in particular is far more limited: extensive data labeling is often prohibitively expensive or impractical, as it may require much time and effort, special infrastructure or domain expertise.
For this reason, in all aforementioned domains there is great interest in methods which can offer high accuracy by using only a limited amount of labeled data or by leveraging the existing plethora of unlabeled data.
There is a large variety of modeling approaches for univariate and multivariate time series, with deep learning models recently challenging or replacing the state of the art in tasks such as forecasting, regression and classiﬁcation (De Brouwer et al., 2019; Tan et al., 2020a;
Fawaz et al., 2019b).
However, unlike in domains such as Computer Vision or Natural Language Processing (NLP), the dominance of deep learning for time series is far from established: in fact, non-deep learning methods such as TS-CHIEF (Shifaz et al., 2020), HIVE-COTE (Lines et al., 2018), and ROCKET (Dempster et al., 2020) currently hold the record on time series regression and classiﬁcation dataset benchmarks (Tan et al., 2020a; Bagnall et al., 2017), matching or even outperforming sophisticated deep architectures such as InceptionTime (Fawaz et al., 2019a) and ResNet (Fawaz et al., 2019b).
In this work, we investigate, for the ﬁrst time, the use of a transformer encoder for unsupervised representation learning of multivariate time series, as well as for the tasks of time series regression and classiﬁcation.
Transformers are an important, recently developed class of deep learning models, which were ﬁrst proposed for the task of natural language translation (Vaswani et al., 2017) but have since come to monopolize the state-of-the-art performance across virtually all NLP tasks (Raffel et al., 2019).
A key factor for the widespread success of transformers in NLP is their aptitude for learning how to represent natural language through unsupervised pre-training (Brown et al., 2020;
Raffel et al., 2019; Devlin et al., 2018).
Besides NLP, transformers have also set the state of the art in several domains of sequence generation, such as polyphonic music composition (Huang et al., 2018).
Transformer models are based on a multi-headed attention mechanism that offers several key advantages and renders them particularly suitable for time series data (see Appendix section A.4 for details).
Inspired by the impressive results attained through unsupervised pre-training of transformer models in NLP, as our main contribution, in the present work we develop a generally applicable methodology (framework) that can leverage unlabeled data by ﬁrst training a transformer model to extract dense vector representations of multivariate time series through an input denoising (autoregressive) objective.
The pre-trained model can be subsequently applied to several downstream tasks, such as regression, classiﬁcation, imputation, and forecasting.
Here, we apply our framework for the tasks of multivariate time series regression and classiﬁcation on several public datasets and demonstrate that transformer models can convincingly outperform all current state-of-the-art modeling approaches, even when only having access to a very limited amount of training data samples (on the order of hundreds of samples), an unprecedented success for deep learning models.
Importantly, despite common preconceptions about transformers from the domain of NLP, where top performing models have billions of parameters and require days to weeks of pre-training on many parallel GPUs or TPUs, we also demonstrate that our models, using at most hundreds of thousands of parameters, can be trained even on CPUs, while training them on GPUs allows them to be trained as fast as even the fastest and most accurate non-deep learning based approaches.
R ELATED W ORK
Regression and classiﬁcation of time series : Currently, non-deep learning methods such as TSCHIEF (Shifaz et al., 2020), HIVE-COTE (Lines et al., 2018), and ROCKET (Dempster et al., 2020) constitute the state of the art for time series regression and classiﬁcation based on evaluations on public benchmarks (Tan et al., 2020a; Bagnall et al., 2017), followed by CNN-based deep architectures such as InceptionTime (Fawaz et al., 2019a) and ResNet (Fawaz et al., 2019b).
ROCKET, which on average is the best ranking method, is a fast method that involves training a linear classiﬁer on top of features extracted by a ﬂat collection of numerous and various random convolutional kernels.
HIVE-COTE and TS-CHIEF (itself inspired by Proximity Forest (Lucas et al., 2019)), are very sophisticated methods which incorporate expert insights on time series data and consist of large, heterogeneous ensembles of classiﬁers utilizing shapelet transformations, elastic similarity measures, spectral features, random interval and dictionary-based techniques; however, these methods are highly complex, involve signiﬁcant computational cost, cannot beneﬁt from GPU hardware and scale poorly to datasets with many samples and long time series; moreover, they have been developed for and only been evaluated on univariate time series.
Unsupervised learning for multivariate time series :
Recent work on unsupervised learning for multivariate time series has predominantly employed autoencoders, trained with an input reconstruction objective and implemented either as Multi-Layer Perceptrons (MLP) or RNN (most commonly, LSTM) networks.
As interesting variations of the former, Kopf et al.
(2019) and Fortuin et al.
(2019) additionally incorporated Variational Autoencoding into this approach, but focused on clustering and the visualization of shifting sample topology with time.
As an example of the latter, Malhotra et al.
(2017) presented a multi-layered RNN sequence-to-sequence autoencoder, while
Lyu et al.
(2018) developed a multi-layered LSTM with an attention mechanism and evaluated both an input reconstruction (autoencoding) as well as a forecasting loss for unsupervised representation learning of Electronic Healthcare Record multivariate time series.
As a novel take on autoencoding, and with the goal of dealing with missing data, Bianchi et al.
(2019) employ a stacked bidirectional RNN encoder and stacked RNN decoder to reconstruct the input, and at the same time use a user-provided kernel matrix as prior information to condition internal representations and encourage learning similarity-preserving representations of the input.
They evaluate the method on the tasks of missing value imputation and classiﬁcation of time series under increasing “missingness” of values.
A distinct approach is followed by Zhang et al.
(2019), who use a composite convolutional - LSTM network with attention and a loss which aims at reconstructing correlation matrices between the variables of the multivariate time series input.
They use and evaluate their method only for the task of anomaly detection.
Finally, Jansen et al.
(2018) rely on a triplet loss and the idea of temporal proximity (the loss rewards similarity of representations between proximal segments and penalizes similarity between distal segments of the time series) for unsupervised representation learning of non-speech audio data.
This idea is explored further by Franceschi et al.
(2019), who combine the triplet loss with a deep causal dilated CNN, in order to make the method effective for very long time series.
Transformer models for time series : Recently, a full encoder-decoder transformer architecture was employed for univariate time series forecasting: Li et al.
(2019) showed superior performance compared to the classical statistical method ARIMA, the recent matrix factorization method TRMF, an RNN-based autoregressive model (DeepAR) and an RNN-based state space model (DeepState) on 4 public forecasting datasets, while Wu et al.
(2020) used a transformer to forecast inﬂuenza prevalence and similarly showed performance beneﬁts compared to ARIMA, an LSTM and a GRU
Seq2Seq model with attention, and Lim et al.
(2020) used a transformer for multi-horizon univariate forecasting, supporting interpretation of temporal dynamics.
Finally, Ma et al.
(2019) use an encoder-decoder architecture with a variant of self-attention for imputation of missing values in multivariate, geo-tagged time series and outperform classic as well as the state-of-the-art, RNN-based imputation methods on 3 public and 2 competition datasets for imputation.
By contrast, our work aspires to generalize the use of transformers from solutions to speciﬁc generative tasks (which require the full encoder-decoder architecture) to a framework which allows for unsupervised pre-training and with minor modiﬁcations can be readily used for a wide variety of downstream tasks; this is analogous to the way BERT (Devlin et al., 2018) converted a translation model into a generic framework based on unsupervised learning, an approach which has become a de facto standard and established the dominance of transformers in NLP.
M ETHODOLOGY 3. B ASE MODEL
At the core of our method lies a transformer encoder, as described in the original transformer work by Vaswani et al.
(2017); however, we do not use the decoder part of the architecture.
A schematic diagram of the generic part of our model, common across all considered tasks, is shown in Figure 1.
We refer the reader to the original work for a detailed description of the transformer model, and here present the proposed changes that make it compatible with multivariate time series data, instead of sequences of discrete word indices.
In particular, each training sample X ∈ R w × m , which is a multivariate time series of length w and m different variables, constitutes a sequence of w feature vectors x t ∈ R m : X ∈ R w × m =
[ x 1 , x 2 , . .
, x w ] .
The original feature vectors x t are ﬁrst normalized (for each dimension, we subtract the mean and divide by the variance across the training set samples) and then linearly projected onto a d -dimensional vector space, where d is the dimension of the transformer model sequence element representations (typically called model dimension ):
[Equation]
where W p ∈ R d × m , b p ∈ R
d are learnable parameters and u t ∈ R d , t = 0 , . . .
, w are the model input vectors 1 .
These will become the queries, keys and values of the self-attention layer, after adding the positional encodings and multiplying by the corresponding matrices.
We note that the above formulation also covers the univariate time series case, i.e., m = 1 , although we only evaluate our approach on multivariate time series in the scope of this work.
We additionally note that the input vectors u t need not necessarily be obtained from the (transformed) feature vectors at a time step t : because the computational complexity of the model scales as O ( w 2 ) and the number of parameters 2 as O ( w ) with the input sequence length w , to obtain u t in case the granularity (temporal resolution) of the data is very ﬁne, one may instead use a 1D-convolutional layer withinput and d output channels and kernels K i of size ( k, m ) , where k is the width in number of time steps and i the output channel:
[Equation]
In this way, one may control the temporal resolution by using a stride or dilation factor greater than 1.
Moreover, although in the present work we only used equation 1, one may use equation 2 as an input to compute the keys and queries and equation 1 to compute the values of the self-attention layer.
This is particularly useful in the case of univariate time series, where self-attention would otherwise match (consider relevant/compatible) all time steps which share similar values for the independent variable, as noted by Li et al.
Finally, since the transformer is a feed-forward architecture that is insensitive to the ordering of input, in order to make it aware of the sequential nature of the time series, we add positional encodings
W pos ∈ R w ×
d to the input vectors U ∈ R w ×
d
= [ u 1 , . .
, u w ] : U (cid:48)
=
U + W pos .
Instead of deterministic, sinusoidal encodings, which were originally proposed by Vaswani et al.
(2017), we use fully learnable positional encodings, as we observed that they perform better for all datasets presented in this work.
Based on the performance of our models, we also observe that the positional encodings generally appear not to signiﬁcantly interfere with the numerical information of the time series, similar to the case of word embeddings; we hypothesize that this is because they are learned so as to occupy a different, approximately orthogonal, subspace to the one in which the projected time series samples reside.
This approximate orthogonality condition is much easier to satisfy in high dimensional spaces.
An important consideration regarding time series data is that individual samples may display considerable variation in length.
This issue is effectively dealt with in our framework: after setting a maximum sequence length w for the entire dataset, shorter samples are padded with arbitrary values, and we generate a padding mask which adds a large negative value to the attention scores for the padded positions, before computing the self-attention distribution with the softmax function.
This forces the model to completely ignore padded positions, while allowing the parallel processing of samples in large minibatches.
Transformers in NLP use layer normalization after computing self-attention and after the feedforward part of each encoder block, leading to signiﬁcant performance gains over batch normalization, as originally proposed by Vaswani et al.
However, here we instead use batch normalization, because it can mitigate the effect of outlier values in time series, an issue that does not arise in NLP word embeddings.
Additionally, the inferior performance of batch normalization in NLP has been mainly attributed to extreme variation in sample length (i.e., sentences in most tasks)
(Shen et al., 2020), while in the datasets we examine this variation is much smaller. In Table 11 of the
Appendix we show that batch normalization can indeed offer a very signiﬁcant performance beneﬁt over layer normalization, while the extent can vary depending on dataset characteristics.
3. R EGRESSION AND CLASSIFICATION
The base model architecture presented in Section 3.1 and depicted in Figure 1 can be used for the purposes of regression and classiﬁcation with the following modiﬁcation: the ﬁnal representation vectors z t ∈ R d corresponding to all time steps are concatenated into a single vector ¯ z ∈ R d · w =
[ z 1 ; . .
; z w ] , which serves as the input to a linear output layer with parameters W o ∈ R n × ( d · w ) , b o ∈ R n , where n is the number of scalars to be estimated for the regression problem (typically n = 1 ), or the number of classes for the classiﬁcation problem:
[Equation]
In the case of regression, the loss for a single data sample will simply be the squared error L
= (cid:107) ˆy − y (cid:107) 2 , where y ∈ R n are the ground truth values.
We clarify that regression in the context of this work means predicting a numeric value for a given sequence (time series sample).
This numeric value is of a different nature than the numerical data appearing in the time series: for example, given a sequence of simultaneous temperature and humidity measurements of 9 rooms in a house, as well as weather and climate data such as temperature, pressure, humidity, wind speed, visibility and dewpoint, we wish to predict the total energy consumption in kWh of a house for that day.
The parameter n corresponds to the number of scalars (or the dimensionality of a vector) to be estimated.
In the case of classiﬁcation, the predictions ˆy will additionally be passed through a softmax function to obtain a distribution over classes, and its cross-entropy with the categorical ground truth labels will be the sample loss.
Finally, when ﬁne-tuning the pre-trained models, we allow training of all weights; instead, freezing all layers except for the output layer would be equivalent to using static, pre-extracted time-series representations of the time series.
In Table 12 in the Appendix we show the trade-off in terms of speed and performance when using a fully trainable model versus static representations.
As a task for the unsupervised pre-training of our model we consider the autoregressive task of denoising the input: speciﬁcally, we set part of the input to 0 and ask the model to predict the masked values.
The corresponding setup is depicted in the right part of Figure 1.
A binary noise mask M ∈ R w × m , is created independently for each training sample, and the input is masked by elementwise multiplication: ˜X = M (cid:12) X .
On average, a proportion r of each mask column of length w (corresponding to a single variable in the multivariate time series) is set to 0 by alternating between segments of 0s and 1s.
We choose the state transition probabilities such that each masked segment (sequence of 0s) has a length that follows a geometric distribution with mean l m and is succeeded by an unmasked segment (sequence of 1s) of mean length l u = 1 − rr l m .
We chose l m = 3 for all presented experiments.
The reason why we wish to control the length of the masked sequence, instead of simply using a Bernoulli distribution with parameter r to set all mask elements independently at random, is that very short masked sequences (e.g., of 1 masked element) in the input can often be trivially predicted with good approximation by replicating the immediately preceding or succeeding values or by the average thereof. In order to obtain enough long masked sequences with relatively high likelihood, a very high masking proportion r would be required, which would render the overall task detrimentally challenging.
Following the process above, at each time step on average r · m variables will be masked.
We empirically chose r = 0 .
15 for all presented experiments.
This input masking process is different from the “cloze type” masking used by NLP models such as BERT, where a special token and thus word embedding vector replaces the original word embedding, i.e., the entire feature vector at affected time steps.
We chose this masking pattern because it encourages the model to learn to attend both to preceding and succeeding segments in individual variables, as well as to existing contemporary values of the other variables in the time series, and thereby to learn to model inter-dependencies between variables.
In Table 10 in the Appendix we show that this masking scheme is more effective than other possibilities for denoising the input.
Using a linear layer with parameters W o ∈ R m × d , b o ∈ R m on top of the ﬁnal vector representations z t ∈ R d , for each time step the model concurrently outputs its estimate ˆx t of the full, uncorrupted input vectors x t ; however, only the predictions on the masked values (with indices in the set M ≡ { ( t, i ) : m t,i = 0 } , where m t,i are the elements of the mask M ), are considered in the
Mean Squared Error loss for each data sample:
[Equation]
This objective differs from the one used by denoising autoencoders, where the loss considers reconstruction of the entire input, under (typically Gaussian) noise corruption.
Also, we note that the approach described above differs from simple dropout on the input embeddings, both with respect to the statistical distributions of masked values, as well as the fact that here the masks also determine the loss function.
In fact, we additionally use a dropout of 10% when training all of our supervised and unsupervised models.
E XPERIMENTS & R ESULTS
In the experiments reported below we use the predeﬁned training - test set splits of the benchmark datasets and train all models long enough to ensure convergence.
We do this to account for the fact that training the transformer models in a fully supervised way typically requires more epochs than ﬁne-tuning the ones which have already been pre-trained using the unsupervised methodology of Section 3.3.
Because the benchmark datasets are very heterogeneous in terms of number of samples, dimensionality and length of the time series, as well as the nature of the data itself, we observed that we can obtain better performance by a cursory tuning of hyperparameters (such as the number of encoder blocks, the representation dimension, number of attention heads or dimension of the feed-forward part of the encoder blocks) separately for each dataset.
To select hyperparameters, for each dataset we randomly split the training set in two parts, 80%-20%, and used the 20% as a validation set for hyperparameter tuning.
After ﬁxing the hyperparameters, the entire training set was used to train the model again, which was ﬁnally evaluated on the test set.
4. R EGRESSION
We select a diverse range of 6 datasets from the Monash University, UEA, UCR Time Series Regression Archive Tan et al.
(2020a)
in a way so as to ensure diversity with respect to the dimensionality and length of time series samples, as well as the number of samples (see Appendix Table 3 for dataset characteristics).
Table 1 shows the Root Mean Squared Error achieved by of our models, named TST for “Time Series Transformer”, including a variant trained only through supervision, and one ﬁrst pre-trained on the same training set in an unsupervised way.
We compare them with the currently best performing models as reported in the archive.
Our transformer models rank ﬁrst on all but two of the examined datasets, for which they rank second.
They thus achieve an average rank of 1.33, setting them clearly apart from all other models; the overall second best model, XGBoost, has an average rank of 3.5, ROCKET (which outperformed ours on one dataset) on average ranks in 5.67th place and Inception (which outperformed ours on the second dataset) also has an average rank of 5.67.
On average, our models attain 30% lower RMSE than the mean RMSE among all models, and approx.
16% lower RMSE than the overall second best model (XGBoost), with absolute improvements varying among datasets from approx.
4% to 36%.
We note that all other deep learning methods achieve performance close to the middle of the ranking or lower.
[Table] Importantly, we also observe that the pre-trained transformer models outperform the fully supervised ones in 3 out of 6 datasets.
This is interesting, because no additional samples are used for pre-training: the beneﬁt appears to originate from reusing the same training samples for learning through an unsupervised objective.
To further elucidate this observation, we investigate the following questions:
Q1:
Given a partially labeled dataset of a certain size, how will additional labels affect performance?
This pertains to one of the most important decisions that data owners face, namely, to what extent will further annotation help.
To clearly demonstrate this effect, we choose the largest dataset we have considered from the regression archive (12.5k samples), in order to avoid the variance introduced by small set sizes.
The left panel of Figure 2 (where each marker is an experiment) shows how performance on the entire test set varies with an increasing proportion of labeled training set data used for supervised learning.
As expected, with an increasing proportion of available labels performance improves both for a fully supervised model, as well as the same model that has been ﬁrst pre-trained on the entire training set through the unsupervised objective and then ﬁne-tuned.
Interestingly, not only does the pre-trained model outperform the fully supervised one, but the beneﬁt persists throughout the entire range of label availability, even when the models are allowed to use all labels; this is consistent with our previous observation on Table 1 regarding the advantage of reusing samples.
Q2:
Given a labeled dataset, how will additional unlabeled samples affect performance?
In other words, to what extent does unsupervised learning make it worth collecting more data, even if no additional annotations are available?
This question differs from the above, as we now only scale the availability of data samples for unsupervised pre-training, while the number of labeled samples is ﬁxed.
The right panel of Figure 2 (where each marker is an experiment) shows that, for a given number of labels (shown as a percentage of the totally available labels), the more data samples are used for unsupervised learning, the lower the error achieved (note that the horizontal axis value 0 corresponds to fully supervised training only, while all other values to unsupervised pre-training followed by supervised ﬁne-tuning).
This trend is more linear in the case of supervised learning on 20% of the labels (approx.
Likely due to a small sample (here, meaning set) effect, in the case of having only 10% of the labels (approx. 1250) for supervised learning, the error
ﬁrst decreases rapidly as we use more samples for unsupervised pre-training, and then momentarily increases, before it decreases again (for clarity, the same graphs are shown separately in Figurein the Appendix).
Consistent with our observations above, it is interesting to again note that, for a given number of labeled samples, even reusing a subset of the same samples for unsupervised pretraining improves performance: for the 1250 labels (blue diamonds of the right panel of Figure 2 or left panel of Figure 3 in the Appendix) this can be observed in the horizontal axis range [0 , 0 . 1] , and for the 2500 labels (blue diamonds of the right panel of Figure 2 or right panel of Figure 3 in the
Appendix) in the horizontal axis range [0 , 0 . 2] .
4. C LASSIFICATION
We select a set of 11 multivariate datasets from the UEA Time Series Classiﬁcation Archive (Bagnall et al., 2018) with diverse characteristics in terms of the number, dimensionality and length of time series samples, as well as the number of classes (see Appendix Table 4).
As this archive is new, there have not been many reported model evaluations; we follow Franceschi et al.
and use as a baseline the best performing method studied by the creators of the archive, DTW D (dimension- [Figure] [Figure] [Figure]
Supervised        0.
[Figure] [Figure] [Figure] [Figure]
training
[Figure]
labels
[Figure]
[Figure]
Dependent DTW), together with the method proposed by Franceschi et al.
themselves (a dilation-CNN leveraging unsupervised and supervised learning).
Additionally, we use the publicly available implementations Tan et al.
(2020b) of ROCKET, which is currently the top performing model for univariate time series and one of the best in our regression evaluation, and XGBoost, which is one of the most commonly used models for univariate and multivariate time series, and also the best baseline model in our regression evaluation (Section 4.1).
Finally, we did not ﬁnd any reported evaluations of RNN-based models on any of the UCR/UEA archives, possibly because of a common perception for long training and inference times, as well as difﬁculty in training (Fawaz et al., 2019b); therefore, we implemented a stacked LSTM model and also include it in the comparison.
The performance of the baselines alongside our own models are shown in Table 2 in terms of accuracy, to allow comparison with reported values. Ours [Table] [Table]
[Table] [Table] [Table] FaceDetection
[Table]
[Table]
[Table]
[Table]
[Table]
[Table]
[Table]
Handwriting 0.
[Table]
[Table]
[Table]
[Table]
[Table]
Heartbeat 0.
JapaneseVowels 0.
InsectWingBeat 0.
PEMS-SF 0.
SelfRegulationSCP 0.
SelfRegulationSCP 0. SpokenArabicDigits [Table] It can be seen that our models performed best on 7 out of the 11 datasets, achieving an average rank of 1.7, followed by ROCKET, which performed best on 3 datasets and on average ranked
The dilation-CNN (Franceschi et al., 2019) and XGBoost, which performed best on the remaining 1 dataset, tied and on average ranked 3.7th and 3.8th respectively.
Interestingly, we observe that all datasets on which ROCKET outperformed our model were very low dimensional (speciﬁcally, 3-dimensional).
Although our models still achieved the second best performance for UWaveGestureLibrary, in general we believe that this indicates a relative weakness of our current models when dealing with very low dimensional time series.
As discussed in Section 3.1, this may be due to the problems introduced by a low-dimensional representation space to the attention mechanism, as well as the added positional embeddings; to mitigate this issue, in future work we intend to use a 1D-convolutional layer to extract more meaningful representations of low-dimensional input features (see Section 3.1).
Conversely, our models performed particularly well on very highdimensional datasets (FaceDetection, HeartBeat, InsectWingBeat, PEMS-SF), and/or datasets with relatively more training samples.
As a characteristic example, on InsectWingBeat (which is by far the largest dataset with 30k samples and contains time series of 200 dimensions and highly irregular length) our model reached an accuracy of 0.689, while all other methods performed very poorly - the second best was XGBoost with an accuracy of 0.369.
However, we note that our model performed exceptionally well also on datasets with only a couple of hundred samples, which in fact constitute 8 out of the 11 examined datasets.
Finally, we observe that the pre-trained transformer models performed better than the fully supervised ones in 8 out of 11 datasets, sometimes by a substantial margin.
Again, no additional samples were available for unsupervised pre-training, so the beneﬁt appears to originate from reusing the same samples.
C ONCLUSION
In this work we propose a novel framework for multivariate time series representation learning based on the transformer encoder architecture.
The framework includes an unsupervised pre-training scheme, which we show that can offer substantial performance beneﬁts over fully supervised learning, even without leveraging additional unlabeled data, i e., by reusing the same data samples.
By evaluating our framework on several public multivariate time series datasets from various domains and with diverse characteristics, we demonstrate that it is currently the best performing method for regression and classiﬁcation, even for datasets where only a few hundred training samples are available.
A A PPENDIX A. A DDITIONAL POINTS & F UTURE W ORK
Execution time for training: While a precise comparison in terms of training time is well out of scope for the present work, in Section A.3 of the Appendix we demonstrate that our transformerbased method is economical in terms of its use of computational resources.
However, alternative self-attention schemes, such as sparse attention patterns (Li et al., 2019), recurrence (Dai et al., 2019) or compressed (global-local) attention (Beltagy et al., 2020), can help drastically reduce the O ( w 2 ) complexity of the self-attention layers with respect to the time series length w , which is the main performance bottleneck.
Imputation and forecasting: The model and training process described in Section 3.3 is exactly the setup required to perform imputation of missing values, without any modiﬁcations, and we observed that it was possible to achieve very good results following this method; as a rough indication, our models could reach Root Mean Square Errors very close to 0 when asked to perform the input denoising (autoregressive) task on the test set, after being subjected to unsupervised pre-training on the training set.
However, we defer a systematic quantitative comparison with the state of the art to future work.
Furthermore, we note that one may simply use different patterns of masking to achieve different objectives, while the rest of the model and setup remain the same.
For example, using a mask which conceals the last part of all variables simultaneously, one may perform forecasting (see
Figure 4 in Appendix), while for longer time series one may additionally perform this process within a sliding window.
Again, we defer a systematic investigation to future work.
Extracted representations: The representations z t extracted by the transformer models can be used directly for evaluating similarity between time series, clustering, visualization and any other use cases where time series representations are used in practice.
A valuable beneﬁt offered by transformers is that representations can be independently addressed for each time step; this means that, for example, a greater weight can be placed at the beginning, middle or end of the time series, which allows to selectively compare time series, visualize temporal evolution of samples etc.
[Table]
[Table]
A. C RITERIA FOR DATASET SELECTION
We select a diverge range of datasets from the Monash University, UEA, UCR Time Series Regression and Classiﬁcation Archives, in a way so as to ensure diversity with respect to the dimensionality and length of time series samples, as well as the number of samples.
Additionally, we have tried to include both ”easy” and ”difﬁcult” datasets (where the baselines perform very well or less well).
In the following we provide a more detailed rationale for each of the selected multivariate datasets. EthanolConcentration : very low dimensional, very few samples, moderate length, large number of classes, challenging FaceDetection : very high dimensional, many samples, very short length, minimum number of classes
[Table]
[Table]
Handwriting very low dimensional, very few samples, moderate length, large number of classes
Heartbeat : high dimensional, very few samples, moderate length, minimum number of classes
JapaneseVowels : very heterogeneous sample length, moderate num. dimensions, very few samples, very short length, moderate number of classes, all baselines perform well InsectWingBeat : very high dimensional, many samples, very short length, moderate number of classes, very challenging PEMS-SF : extremely high dimensional, very few samples, moderate length, moderate number of classes
SelfRegulationSCP1 : Few dimensions, very few samples, long length, minimum number of classes, baselines perform well SelfRegulationSCP2 : similar to SelfRegulationSCP1, but challenging SpokenArabicDigits : Moderate number of dimensions, many samples, very heterogeneous length, moderate number of classes, most baselines perform well UWaveGestureLibrary : very low dimensional, very few samples, moderate length, moderate number of classes, baselines perform well
A. E XECUTION TIME
We recorded the times required for training our fully supervised models until convergence on a GPU, as well as for the currently fastest and top performing (in terms of classiﬁcation accuracy and regression error) baseline methods, ROCKET and XGBoost on a CPU.
These have been shown to be orders of magnitude faster than methods such as TS-CHIEF, Proximity Forest, Elastic Ensembles, DTW and HIVE-COTE, but also deep learning based methods Dempster et al.
Although
XGBoost and ROCKET are incomparably faster than the transformer on a CPU, as can be seen in
[Table]
Table 7 in the Appendix, exploiting commercial GPUs and the parallel processing capabilities of a transformer typically enables as fast (and sometimes faster) training times as these (currently fastest available) methods.
In practice, despite allowing for many hundreds of epochs, using a GPU we never trained our models longer than 3 hours on any of the examined datasets.
As regards deep learning models, LSTMs are well known to be slow, as they require O ( w ) sequential operations (where w is the length of the time series) for each sample, with the complexity per layer scaling as O ( N · d 2 ) , where d is the internal representation dimension (hidden state size).
We refer the reader to the original transformer paper (Vaswani et al., 2017) for a detailed discussion about how tranformers compare to Convolutional Neural Networks in terms of computational efﬁciency.
R M S E
Use of data for unsupervised pre-training           0.
R M S E
Use of data for unsupervised pre-training
[Table] [Table]
[Table]
[Table]
Problem
[Table]
EthanolConcentration
[Table]
FaceDetection      -
[Table]
Handwriting
Heartbeat
JapaneseVowels      -0.
PEMS-SF
SelfRegulationSCP        SelfRegulationSCP
SpokenArabicDigits [Table] [Table]
- tribution with a mean length of l m = 3 and each variable is masked on average by r = 15% . We observe that our proposed scheme, separately masking each variable through stateful generation, performs consistently well and shows the overall best performance across all examined datasets. [Table] Dataset
Task (Metric)
Static
Fine-tuned
Metric
Epoch time
[Table]
s
[Table]
Metric
Epoch
[Table]
Heartbeat
Classif.
[Table]
[Table]
[Table]
InsectWingbeat
Classif.
[Table]
Accuracy)
[Table]
[Table]
[Table]
SpokenArabicDigits
Classif.
[Table]
Accuracy)
[Table]
[Table]
PEMS-SF
Classif.
[Table]
[Table]
[Table]
BenzeneConcentration
[Table]
BeijingPM25Quality
[Table]
LiveFuelMoistureContent
[Table]
[Table]
[Table]
[Table]
tttt w xxx m 𝒙 𝑤 𝒙forecasting . . .
tttt w xxx m 𝒙 𝑤 𝒙
[Figure]
[Figure]
True, input
True,
[Figure]
A. A DVANTAGES OF TRANSFORMERS
Transformer models are based on a multi-headed attention mechanism that offers several key advantages and renders them particularly suitable for time series data:
• They can concurrently take into account long contexts of input sequence elements and learn to represent each sequence element by selectively attending to those input sequence elements which the model considers most relevant.
They do so without position-dependent prior bias; this is to be contrasted with RNN-based models: a) even bi-directional RNNs treat elements in the middle of the input sequence differently from elements close to the two endpoints, and b) despite careful design, even LSTM (Long Short Term Memory) and GRU (Gated Recurrent Unit) networks practically only retain information from a limited number of time steps stored inside their hidden state (vanishing gradient problem (Hochreiter, 1998;
Pascanu et al., 2013)), and thus the context used for representing each sequence element is inevitably local.
• Multiple attention heads can consider different representation subspaces, i.e., multiple aspects of relevance between input elements.
For example, in the context of a signal with two frequency components, 1 /T 1 and 1 /T 2 , one attention head can attend to neighboring time points, while another one may attend to points spaced a period T 1 before the currently examined time point, a third to a period T 2 before, etc.
This is to be contrasted with attention mechanisms in RNN models, which learn a single global aspect/mode of relevance between sequence elements.
• After each stage of contextual representation (i.e., transformer encoder layer), attention is redistributed over the sequence elements, taking into account progressively more abstract representations of the input elements as information ﬂows from the input towards the output.
By contrast, RNN models with attention use a single distribution of attention weights to extract a representation of the input, and most typically attend over a single layer of representation (hidden states).
A. H YPERPARAMETERS
[Table]
) hyperparameters used for all transformer models.
[Table]
[Table]
AppliancesEnergy
[Table]
BenzeneConcentration
[Table]
BeijingPM10Quality
[Table]
BeijingPM25Quality
[Table]
LiveFuelMoistureContent
[Table]
IEEEPPG
[Table]
[Table]
AppliancesEnergy
BenzeneConcentration
[Table]
BeijingPM10Quality
[Table]
BeijingPM25Quality
[Table]
LiveFuelMoistureContent
[Table]
IEEEPPG
[Table]