M ULTIVARIATE P ROBABILISTIC T IME S ERIES F ORECASTING VIA C ONDITIONED N ORMALIZING F LOWS
Anonymous authors
Paper under double-blind review
A BSTRACT
Time series forecasting is often fundamental to scientiﬁc and engineering problems and enables decision making.
With ever increasing data set sizes, a trivial solution to scale up predictions is to assume independence between interacting time series.
However, modeling statistical dependencies can improve accuracy and enable analysis of interaction effects.
Deep learning methods are well suited for this problem, but multivariate models often assume a simple parametric distribution and do not scale to high dimensions.
In this work we model the multivariate temporal dynamics of time series via an autoregressive deep learning model, where the data distribution is represented by a conditioned normalizing ﬂow.
This combination retains the power of autoregressive models, such as good performance in extrapolation into the future, with the ﬂexibility of ﬂows as a general purpose high-dimensional distribution model, while remaining computationally tractable.
We show that it improves over the state-of-the-art for standard metrics on many real-world data sets with several thousand interacting time-series.
I NTRODUCTION
Classical time series forecasting methods such as those in Hyndman & Athanasopoulos (2018) typically provide univariate forecasts and require hand tuned features to model seasonality and other parameters.
Time series models based on recurrent neural networks (RNN), like LSTM (Hochreiter & Schmidhuber, 1997), have become popular methods due to their end-to-end training, the ease of incorporating exogenous covariates, and their automatic feature extraction abilities, which are the hallmarks of deep learning.
Forecasting outputs can either be points or probability distributions, in which case the forecasts typically come with uncertainty bounds.
The problem of modeling uncertainties in time series forecasting is of vital importance for assessing how much to trust the predictions for downstream tasks, such as anomaly detection or (business) decision making.
Without probabilistic modeling, the importance of the forecast in regions of low noise (small variance around a mean value) versus a scenario with high noise cannot be distinguished.
Hence, point estimation models ignore risk stemming from this noise, which would be of particular importance in some contexts such as making (business) decisions.
Finally, individual time series, in many cases, are statistically dependent on each other, and models need the capacity to adapt to this in order to improve forecast accuracy (Tsay, 2014).
For example, to model the demand for a retail article, it is important to not only model its sales dependent on its own past sales, but also to take into account the effect of interacting articles, which can lead to cannibalization effects in the case of article competition.
As another example, consider trafﬁc ﬂow in a network of streets as measured by occupancy sensors.
A disruption on one particular street will also ripple to occupancy sensors of nearby streets — a univariate model would arguably not be able to account for these effects.
In this work we propose end-to-end trainable autoregressive deep learning architectures for probabilistic forecasting that explicitly models multivariate time series and their temporal dynamics by employing a normalizing ﬂow, like the Masked Autoregressive Flow (Papamakarios et al., 2017) or
Real NVP (Dinh et al., 2017).
These models are able to scale to thousands of interacting time series, we show that they are able to learn ground-truth dependency structure on toy data and we establish new state-of-the-art results on diverse real world data sets by comparing to competitive baselines.
Additionally, these methods adapts to a broad class of underlying data distribution on account of using a normalizing ﬂow and our Transformer based model is highly efﬁcient due to the parallel nature of attention layers while training.
The paper ﬁrst provides some background context in Section 2.
We cover related work in Section 3.
Section 4 introduces our model and the experiments are detailed in Section 5.
We conclude with some discussion in Section 6.
The Appendix contains details of the datasets, additional metrics and exploratory plots of forecast intervals as well as details of our model.
B ACKGROUND 2. D ENSITY E STIMATION VIA N ORMALIZING F LOWS
Normalizing ﬂows (Tabak & Turner, 2013; Papamakarios et al., 2019) are mappings from R D to R D such that densities p X on the input space X
= R D are transformed into some simple distribution
p Z (e.g. an isotropic Gaussian) on the space Z = R D .
This mapping f : X (cid:55)→ Z , is composed of a sequence of bijections or invertible functions.
Due to the change of variables formula we can express p X ( x ) by
[Equation]
(cid:12) (cid:12)(cid:12)(cid:12) det (cid:18)
[Equation]
(cid:19)(cid:12) (cid:12)(cid:12)(cid:12) , where ∂f ( x ) /∂
x is the Jacobian of f at x .
Normalizing ﬂows have the property that the inverse x = f − 1 ( z ) is easy to evaluate and computing the Jacobian determinant takes O ( D ) time.
The bijection introduced by Real NVP (Dinh et al., 2017) called the coupling layer satisﬁes the above two properties.
It leaves part of its inputs unchanged and transforms the other part via functions of the un-transformed variables (with super-script denoting the coordinate indices)
[Equation]
where (cid:12) is an element wise product, s () is a scaling and t () a translation function from R d (cid:55)→ R D − d , given by neural networks.
To model a nonlinear density map f ( x ) , a number of coupling layers which map X (cid:55)→ Y 1 (cid:55)→ · · · (cid:55)→ Y K − 1 (cid:55)→ Z are composed together all the while alternating the dimensions which are unchanged and transformed.
Via the change of variables formula the probability density function (PDF) of the ﬂow given a data point can be written as
[Equation]
Note that the Jacobian for the Real NVP is a block-triangular matrix and thus the log-determinant of each map simply becomes
[Equation]
where sum () is the sum over all the vector elements.
This model, parameterized by the weights of the scaling and translation neural networks θ , is then trained via stochastic gradient descent (SGD) on training data points where for each batch
D we maximize the average log likelihood (1) given by
[Equation]
In practice Batch Normalization (Ioffe & Szegedy, 2015) is applied, as a bijection, to outputs of successive coupling layers to stabilize training of normalizing ﬂows.
This bijection implements the normalization procedure using a weighted moving average of the layer’s mean and standard deviation values, which has to be adapted to either training or inference regimes.
The Real NVP approach can be generalized, resulting in Masked Autoregressive Flows (Papamakarios et al., 2017) (MAF) where the transformation layer is built as an autoregressive neural network in the sense that it takes in some input x ∈ R D and outputs y
=
( y 1 , . .
y D ) with the requirement that this transformation is invertible and any output y i cannot depend on input with dimension indices
≥ i , i.e. x ≥ i .
The Jacobian of this transformation is triangular and thus the Jacobian determinant is tractable.
Instead of using a RNN to share parameters across the D dimensions of x one avoids this sequential computation by using masking, giving the method its name.
The inverse however, needed for generating samples, is sequential.
By realizing that the scaling and translation function approximators don’t need to be invertible, it is straight-forward to implement conditioning of the PDF p X ( x | h ) on some additional information h ∈ R H : we concatenate h to the inputs of the scaling and translation function approximators of the coupling layers, i.e. s ( concat ( x 1: d , h )) and t ( concat ( x 1: d , h )) which are modiﬁed to map R d + H (cid:55)→ R D − d .
Another approach is to add a bias computed from h to every layer inside the s and t networks as proposed by Korshunova et al.
This does not change the log-determinant of the coupling layers given by (2).
More importantly for us, for sequential data, indexed by t , we can share parameters across the different conditioners h t by using RNNs or Attention in an autoregressive fashion.
For discrete data the distribution has differential entropy of negative inﬁnity, which leads to arbitrary high likelihoods when training normalizing ﬂow models, even on test data.
To avoid this one can dequantize the data, often by adding Uniform[0 , 1) noise to integer valued data.
The log-likelihood of the resulting continuous model is then lower-bounded by the log-likelihood of the discrete one as shown in Theis et al.
2. S ELF - ATTENTION
The self-attention based Transformer (Vaswani et al., 2017) model has been used for sequence modeling with great success.
The multi-head self-attention mechanism enables it to capture both longand short-term dependencies in time series data.
Essentially, the Transformer takes in a sequence
X =
[ x 1 , . .
, x T ]
(cid:124) ∈ R T × D , and the multi-head self-attention transforms this into H distinct query
Q h = XW Qh , key K h = XW Kh and value V h =
XW Vh matrices, where the W Qh , W Kh , and W Vh are learnable parameters.
After these linear projections the scaled dot-product attention computes a sequence of vector outputs via:
[Equation]
where a mask M can be applied to ﬁlter out right-ward attention (or future information leakage) by setting its upper-triangular elements to −∞ and we normalize by d K the dimension of the W Kh matrices.
Afterwards all H outputs
O h are concatenated and linearly projected again.
One typically uses the Transformer in an encoder-decoder setup, where some warm up time series is passed through the encoder and the decoder can be used to learn and autoregressively generate outputs.
R ELATED W ORK
Related to this work are models that combine normalizing ﬂows for sequential modeling in some way.
Transformation Autoregressive Networks (Oliva et al., 2018) which model the density of a multi-variate variable x ∈ R D as D conditional distributions Π Di =1 p X ( x i | x i − 1 , . . .
, x 1 ) , where the conditioning is given by a mixture model coming from the state of a RNN, and is then transformed via a bijection.
The PixelSNAIL (Chen et al., 2018) method also models the joint as a product of conditional distributions, optionally with some global conditioning, via causal convolutions and self-attention (Vaswani et al., 2017) to capture long-term temporal dependencies.
These methods are well suited to modeling high dimensional data like images, however their use in modeling the temporal development of data has only recently been explored for example in VideoFlow (Kumar et al., 2019) which consists of a normalizing ﬂow that autoregressively models the latent variable at each time point as a Gaussian whose parameters are functions of the ﬂow at previous time steps.
Using RNNs for modeling either multivariate or temporal dynamics introduces sequential computational dependencies that are not amenable to parallelization.
However, RNNs have been shown to be very effective in modeling sequential dynamics and we feel that it is important to nonetheless explore RNN-based temporal conditioning for multivariate time series forecasting.
A recent work in this direction (Hwang et al., 2019) employs bipartite ﬂows with RNNs for temporal conditioning to develop a conditional generative model of multivariate sequential data.
The authors use a bidirectional training procedure to learn a generative model of observations that together with the temporal conditioning through a RNN, can also be conditioned on (observed) covariates that are modeled as additional conditioning variables in the latent space, which adds extra padding dimensions to the normalizing ﬂow.
The other aspect of related works deal with multivariate probabilistic time series methods which are able to model high dimensional data.
The Gaussian Copula Process method (Salinas et al., 2019a) is a RNN-based time series method with a Gaussian copula process output modeled using a low-rank covariance structure to reduce computational complexity and handle non-Gaussian marginal distributions.
By using a low-rank approximation of the covariance matrix they obtain a computationally tractable method and are able to scale to multivariate dimensions in the thousands with state-of-the-art results.
We will compare our model to this method in what follows.
T EMPORAL C ONDITIONED N ORMALIZING F LOWS
We denote the entities of a multivariate time series by x it ∈ R for i ∈ { 1 , . . .
, D } where t is the time index.
Thus the multivariate vector at time t is given by x t ∈ R D .
We will in what follows consider time series with t ∈ [1 , T ] , sampled from the complete time series history of our data, where for training we will split this time series by some context window [1 , t 0 ) and prediction window [ t 0 , T ] .
In the DeepAR model (Salinas et al., 2019b), the log-likelihood of each entity x it at a time step t ∈ [ t 0 , T ] is maximized given an individual time series’ prediction window.
This is done with respect to the parameters of the chosen distributional model (e.g. negative binomal for count data) via the state of a RNN derived from its previous time step x it − 1 and its corresponding covariates c
it − 1 .
The emission distribution model, which is typically Gaussian for real-valued data or negative binomial for count data, is selected to best match the statistics of the time series and the network incorporates activation functions that satisfy the constraints of these distribution parameters, e.g. a softplus() for the scale parameter of the Gaussian.
A simple model for multivariate real-valued data could use a factorizing distribution in the emissions.
Shared parameters can then learn patterns across the individual time series through the temporal component — but the model falls short of capturing dependencies in the emissions of the model.
For this, a full joint distribution at each time step must be modeled, for example by using a multivariate
Gaussian model.
However, modeling the full covariance matrix not only increases the number of parameters of the neural network by O ( D 2 ) , making learning difﬁcult, but computing the loss becomes expensive when D is large.
Further, statistical dependencies in the emissions would be limited to second-order effects.
These models are referred to as Vec-LSTM in Salinas et al. (2019a).
[Figure]
schematic at time t , consisting of K blocks of coupling layers and Batch Normalization, where in each coupling layer we condition x t and its transformations on the state of a shared RNN from the previous time step x t − 1 and its covariates c t −which are typically time dependent and time independent features.
We wish to have a scalable model of D interacting time-series x t , and further to use a ﬂexible distribution model on the emissions that allows for capturing and representing higher order moments.
To this end, we model the conditional joint distribution at time t of all time series p X ( x t | h t ; θ ) with a ﬂow, e.g. a Real NVP, conditioned on either the hidden state of a RNN at time t or an embedding of the time series up to t − 1 from an attention module.
In the case of an autoregressive RNN (either a LSTM or a
GRU (Chung et al., 2014)), its hidden state h t is updated given the previous time step observation x t − 1 and associated covariates c t − 1 (as in
Figure 1):
[Equation]
This model is autoregressive since it consumes the observation of the last time step x t − 1 as well as the recurrent state h t − 1 to produce the state h t on which we condition the current observation.
To get a powerful and general emission distribution model, we stack K layers of the ﬂow model (Real NVP or MAF).
Together with the RNN, we arrive at our model of the conditional distribution of the future of all time series, given its past t ∈ [1 , t 0 ) and all the covariates in t ∈ [1 , T ] .
As the model is autoregressive it can be written as a product of factors
[Equation]
where θ denotes the set of all parameters of both the ﬂow and the RNN.
For modeling the time evolution, we also investigate using an encoder-decoder Transformer (Vaswani et al., 2017) architecture where the encoder embeds x 1: t 0 − 1 and the decoder outputs the conditioning for the ﬂow over x t 0 : T via a masked attention module.
See Figure 2 for a schematic of the overall model in this case.
While training, care has to be taken to prevent using information from future time points as well as to preserve the autoregressive property by utilizing a mask that reﬂects the causal direction of progressing time, i.e. to mask out future time points.
The Transformer allows the model to access any part of the historic time series regardless of temporal distance (Li et al., 2019) and thus is potentially able to generate better conditioning for the normalizing ﬂow.
[Figure]
stack where the encoder takes in some context length of time series and then uses it to generate conditioning for the prediction length portion of the time series via a causally masked decoder stack.
Note that the positional encodings are part of the covariates and unlike the RNN model, here all x 1: T time points are trained in parallel.
In real-world data the magnitudes of different time series can vary drastically.
To normalize scales, we divide each individual time series by their training window means before feeding it into the model.
At inference the distributions are then correspondingly transformed with the same mean values to match the original scale.
This rescaling technique simpliﬁes the problem for the model, which is reﬂected in signiﬁcantly improved empirical performance as noted in Salinas et al.
(2019b).
4. T RAINING
Given D , a batch of time series, where for each time series and each time step we have x t ∈ R D and their associated covariates c t , we maximize the log-likelihood given by (1) and (3), i.e.
[Equation]
via SGD using Adam (Kingma & Ba, 2015) with respect to the parameters θ of the conditional ﬂow and the RNN or Transformer.
In practice, the time series x 1: T in a batch D are selected from a random time window of size T within our training data, and the relative time steps are kept constant.
This allows the model to learn to cold-start given only the covariates.
This also increases the size of our training data when the training data has small time history and allows us to trade-off computation time with memory consumption especially when D or T are large.
Note that information about absolute time is only available to the RNN or Transformer via the covariates and not the relative position of x t in the training data.
The Transformer has computational complexity
O ( T 2 D ) compared to a RNN which is O ( TD 2 ) , where T is the time series length and the assumption that the dimension of the hidden states are proportional to the number of simultaneous time-series modeled.
This means for large multivariate time series, i.e. D > T , the Transformer ﬂow model has smaller computational complexity.
In addition, unlike the RNN, all the computation while training happens in parallel .
4. C OVARIATES
We employ embeddings for categorical features (Charrington, 2018), which allows for relationships within a category, or its context, to be captured while training models.
Combining these embeddings as features for time series forecasting yields powerful models like the ﬁrst place winner of the Kaggle
Taxi Trajectory Prediction 1 challenge (De Br´ebisson et al., 2015).
The covariates c t we use are composed of time-dependent (e.g. day of week, hour of day) and time-independent embeddings, if applicable, as well as lag features depending on the time frequency of the data set we are training on.
All covariates are thus known for the time periods we wish to forecast.
4. I NFERENCE
For inference we either obtain the hidden state ˆ h t 1 by passing a “warm up” time series x 1: t 1 −through the RNN or use the cold-start hidden state, i.e. we set ˆ h t 1 =
h 1 = (cid:126) 0 , and then by sampling a noise vector z t 1 ∈ R D from an isotropic Gaussian, go backward through the ﬂow to obtain a sample of our time series for the next time step, ˆ x t 1 = f − 1 ( z t 1 | ˆ h t 1 ) , conditioned on this starting state.
We then use this sample and its covariate to obtain the next conditioning state ˆ h t 1 +1 via the RNN and repeat till our inference horizon.
This process of sampling trajectories from some initial state can be repeated many times to obtain empirical quantiles of the uncertainty of our prediction for arbitrary long forecast horizons.
The attention model similarly uses a warm up time series x 1: t 1 − 1 and covariates and passes them through the encoder and then uses the decoder to output the conditioning for sampling from the ﬂow.
This sample is then used again in the decoder to iteratively sample the next conditioning state, similar to the inference procedure in seq-to-seq models.
Note that we do not sample from a reduced-temperature model, e.g. by scaling the variance of the isotropic Gaussian, unlike what is done in likelihood based generative models (Parmar et al., 2018) to obtain higher quality samples.
E XPERIMENTS
Here we discuss a toy experiment for sanity-checking our model and evaluate probabilistic forecasting results on six real world data sets with competitive baselines.
5. S IMULATED F LOW IN A S YSTEM OF P IPES
In this toy experiment, we check if the inductive bias of incorporating relations between time series is learnt in our model by simulating ﬂow of a liquid in a system of pipes with valves.
See Figure 3 for a depiction of the system.
S S
V
S
V
S
Liquid
, where pressure at the ﬁrst sensor in the system is given by
S
= X + 3 , X ∼ Gamma(1 , 0 . 2) in the shape/scale parameterization of the Gamma distribution.
The valves are given by V 1 , V 2 ∼ iid
Beta(0 . 5 , 0 . 5) , and we have
[Equation]
for i ∈ { 1 , 2 } and ﬁnally S 3 = S 1 + S 2 + (cid:15) 3 with (cid:15) ∗ ∼ N (0 , 0 . 1) .
With this simulation we check whether our model captures correlations in space and time.
The correlation between S 1 and S 2 results from both having the same source, measured by S 0 .
This is reﬂected by Cov( S 1 , S 2) > 0 , which is captured by our model as shown in Figure 4 left.
The cross-covariance structure between consecutive time points in ground truth and as captured by our trained model is depicted in Figure 4 right.
It reﬂects the true ﬂow of liquid in the system from
S 0 at time t to S 1 and S 2 at time t + 1 , on to S 3 at time t + 2 .
R EAL W ORLD D ATA S ETS
For evaluation we compute the Continuous Ranked Probability Score (CRPS) (Matheson & Winkler, 1976) on each individual time series, as well as on the sum of all time series (the latter denoted by CRPS sum ).
CRPS measures the compatibility of a cumulative distribution function F with an
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
observation x as
[Equation]
(5) where I { x ≤ z } is the indicator function which is one if x ≤ z and zero otherwise.
CRPS is a proper scoring function, hence CRPS attains its minimum when the predictive distribution F and the data distribution are equal.
Employing the empirical CDF of F , i.e. ˆ F ( z ) = 1 n (cid:80) ni
=
I { X i ≤ z } with n samples X i ∼ F as a natural approximation of the predictive CDF, CRPS can be directly computed from simulated samples of the conditional distribution (4) at each time point (Jordan et al., 2019).
We take 100 samples to estimate the empirical CDF in practice.
Finally, CRPS sum is obtained by ﬁrst summing across the D time-series — both for the ground-truth data, and sampled data (yielding ˆ
F sum ( t ) for each time-point).
The results are then averaged over the prediction horizon, i.e. formally
CRPS
[Equation]
ˆ F sum ( t ) , (cid:80) i x it (cid:17)(cid:105)
Our model is trained on the training split of each data set, and for testing we use a rolling windows prediction starting from the last point seen in the training data set and compare it to the test set.
We train on Exchange (Lai et al., 2018),
Solar (Lai et al., 2018), Electricity 2 , Traffic 3 ,
Taxi 4 and Wikipedia 5 open data sets, preprocessed exactly as in Salinas et al.
(2019a), with their properties listed in Table 2 of the appendix.
Both Taxi and Wikipedia consist of count data and are thus dequantized before being fed to the ﬂow (and mean-scaled).
We compare our method using LSTM and two different normalizing ﬂows ( LSTM-Real-NVP and LSTM-MAF based on Real NVP and MAF, respectively) as well as a Transformer model with MAF ( Transformer-MAF ), with the most competitive baseline probabilistic models from Salinas et al. (2019a) on the six data sets and report the results in Table 1.
Vec-LSTM-ind-scaling outputs the parameters of an independent normal distribution with mean-scaling, Vec-LSTM-lowrank-Copula parametrizes a low-rank plus diagonal covariance via Copula process.
GP-scaling unrolls a LSTM with scaling on each individual time series before reconstructing the joint distribution.
Similarly, GP-Copula unrolls a LSTM on each individual https time series and then the joint emission distribution is given by a low-rank plus diagonal covariance
Gaussian copula.
[Figure]
In Table 1 we observe that MAF with either RNN or self-attention mechanism for temporal conditioning achieves the state-of-the-art (to the best of our knowledge) CRPS sum on all benchmarks.
Moreover, bipartite ﬂows with RNN either also outperform or are found to be competitive w.r.t.
the previous state-of-the-art results as listed in the ﬁrst four columns of Table 1.
Further analyses with other metrics (e.g. CRPS and MSE) are reported in Section B of the appendix.
To showcase how well our model captures dependencies in extrapolating the time series into the future versus real data, we plot in Figure 5 the cross-covariance matrix of observations (plotted left) as well as the mean of 100 sample trajectories (middle plot) drawn from Transformer-MAF model for the test split of Traffic data set.
As can be seen, most of the covariance structure especially in the top-left region of highly correlated sensors is very well reﬂected in the samples drawn from the model.
C ONCLUSION
We have presented a general method to model high dimensional probabilistic multivariate time series by combining conditional normalizing ﬂows with an autoregressive model, such as a recurrent neural network or an attention module.
Autoregressive models have a long-standing reputation for working very well for time series forecasting, as they show good performance in extrapolation into the future.
The ﬂow model, on the other hand, does not assume any simple ﬁxed distribution class, but instead can adapt to a broad range of high-dimensional data distributions.
The combination hence combines the extrapolation power of the autoregressive model class with the density estimation ﬂexibility of ﬂows.
Further, it is computationally efﬁcient, without the need of resorting to approximations (e.g. low-rank approximations of a covariance structure as in Gaussian copula methods) and is robust compared to Deep Kernel learning methods especially for large D .
Analysis on six commonly used time series benchmarks establish the new state-of-the-art performance against competitive methods.
A natural way to improve our method is to incorporate a better underlying ﬂow model.
For example,
Table 1 showed that swapping the Real NVP ﬂow with a MAF improved performance, which is a consequence of Real NVP lacking in density modeling performance compared to MAF.
Likewise, we would expect other design choices of the ﬂow model to improve performance, e.g. changes on the dequantization method, the speciﬁc afﬁne coupling layer or more expressive conditioning, say via another Transformer.
Recent improvements to ﬂows, e.g. as proposed in the Flow++ (Ho et al., 2019), to obtain expressive bipartite ﬂow models, or models to handle discrete categorical data (Tran et al., 2019), are left as future work to assess their usefulness.
To our knowledge, it is however still an open problem how to model discrete ordinal data via ﬂows — which would best capture the nature of some data sets (e.g. sales data).
A D ATA S ET D ETAILS
the data sets used in experiments.
[Table]
B A DDITIONAL M ETRICS
We used exactly the same open source code to evaluate our metrics as provided by the authors of Salinas et al. (2019a)
. B. C OMPARISON AGAINST CLASSICAL BASELINES
We report test set CRPS sum results on VAR (L¨utkepohl, 2007) a mutlivariate linear vector autoregressive model with lags corresponding to the periodicity of the data, VAR-Lasso a Lasso regularized VAR , GARCH (van der Weide, 2002) a multivariate conditional heteroskedastic model, GP
Gaussian process model, KVAE (Krishnan et al., 2017) a variational autoencoder on top of a linear state space model and VES a innovation state space model (Hyndman et al., 2008) in Table 3. Note that VAR-Lasso , KVAE and VES metrics are from (de B´ezenac et al., 2020).
B. C ONTINUOUS R ANKED P ROBABILITY S CORE (CRPS)
The average marginal CRPS over dimensions D and over the predicted time steps compared to the test interval is given in Table 4.
[Table] [Table]
B. M EAN S QUARED E RROR (MSE)
The MSE is deﬁned as the mean squared error over all the time series dimensions D and over the whole prediction range with respect to the test data.
Table 5 shows the MSE results for the the marginal MSE .
[Table]
[Table]
C U NIVARIATE AND P OINT F ORECASTS
Univariate methods typically give better forecasts than multivariate ones, which is counter-intuitive, the reason being the difﬁculty in estimating the cross-series correlations.
The additional variance that multivariate methods add often ends up harming the forecast, even when one knows that individual time series are related.
Thus as an additional sanity check, that this method is good enough to improve the forecast and not make it worse, we report the metrics with respect to a modern univariate point forecasting method as well as a multivariate point forecasting method for the Traffic data set.
Figure 6 reports the metrics from LSTNet (Lai et al., 2018) a multivariate point forecasting method and Figure 7 reports the metrics from N-BEATS (Oreshkin et al., 2020) a univariate model.
As can be seen our methods improves on the metrics for the Traffic data set and this pattern holds for other data sets in our experiments.
As a visual comparison we have also plotted prediction intervals using our models in Figures 8, 9, 10 and 11.
[Figure]
× 10 − 4 .
D E XPERIMENT D ETAILS D. F EATURES
For hourly data sets we used hour of day, day of week, day of month features which are normalized.
For daily data sets we use the day of week features.
For data sets with minute granularity we use minute of hour, hour of day and day of week features.
The normalized features are concatenated to the RNN or Transformer input at each time step.
We also concatenate lag values as inputs according to the data set’s time frequency: [1 , 24 , 168] for hourly data, [1 , 7 , 14] for daily and [1 , 2 , 4 , 12 , 24 , 48] for the half-hourly data.
D. H YPERPARAMETERS
We use batch sizes of 64 , with 100 batches per epoch and train for a maximum of 40 epochs with a learning rate of 1e − 3 .
The LSTM hyperparameters were the ones from Salinas et al.
(2019a)
and we used K = 5 stacks of normalizing ﬂow bijections layers.
The components of the normalizing ﬂows ( f and g ) are linear feed forward layers (with ﬁxed input and ﬁnal output sizes because we model bijections) with hidden dimensions of 100 and ELU (Clevert et al., 2016) activation functions.
[Figure]
228 and MSE : 8 . 4 ×
10 − 4 .
We sample 100 times to report the metrics on the test set.
The Transformer uses H = 8 heads and n = 3 encoding and m = 3 decoding layers and a dropout rate of 0 . 1 .
All the experiments run on a single Nvidia V-100 GPU and the code to reproduce the results will be made available after the review process.
[Figure] [Figure]
[Figure] [Figure]