TimeAwareRNN
Code used for the AAAI 2020 paper "System Identification with Time-Aware Neural Sequence Models"
view repo
Established recurrent neural networks are well-suited to solve a wide variety of prediction tasks involving discrete sequences. However, they do not perform as well in the task of dynamical system identification, when dealing with observations from continuous variables that are unevenly sampled in time, for example due to missing observations. We show how such neural sequence models can be adapted to deal with variable step sizes in a natural way. In particular, we introduce a time-aware and stationary extension of existing models (including the Gated Recurrent Unit) that allows them to deal with unevenly sampled system observations by adapting to the observation times, while facilitating higher-order temporal behavior. We discuss the properties and demonstrate the validity of the proposed approach, based on samples from two industrial input/output processes.
READ FULL TEXT VIEW PDF
Typical techniques for sequence classification are designed for
well-seg...
read it
Recurrent neural networks with various types of hidden units have been u...
read it
Many machine learning tasks can be expressed as the transformation---or
...
read it
Sequences have become first class citizens in supervised learning thanks...
read it
We report an extension of a Keras Model, called CTCModel, to perform the...
read it
We present a novel approach for learning to predict sets using deep lear...
read it
Large-scale recurrent networks have drawn increasing attention recently
...
read it
Code used for the AAAI 2020 paper "System Identification with Time-Aware Neural Sequence Models"
The field of system identification, aiming to build mathematical models of dynamical systems based on observed data, has been a large active research area for many years, with several specialized sub-fields [18]. Within this general field, the topic of research in this paper is the joint application of numerical methods developed to solve systems of differential equations, with established techniques from the field of artificial neural networks.
On the one hand, neural networks provide a highly flexible tool to train unknown parameterized functions to fit available data [13]
. In particular, recurrent neural networks (RNNs), and especially variants such as Long Short-Term Memory (LSTM) networks
[16] or Gated Recurrent Units (GRU) [6], have become important general-purpose tools for modeling discrete sequential data, for example in the area of natural language processing
[21]. These models are however not naturally suited to deal with sampled time series where the interval between consecutive samples may not be constant over time. Yet, so-called unevenly spaced time series occur often in practice, due to missing data after discarding invalid measurements, or because of variations in the sampling times [10]. For example, a patient’s clinical variables may only be measured at irregular moments. Or, observations from systems in meteorology, economics, finance, or geology might only be possible at irregular points in time. Multivariate data consisting of individual time series with different sample rates are also naturally treated as unevenly spaced time series. Eckner2014 Eckner2014 further summarizes a number of disadvantages of transforming unevenly spaced data through resampling into evenly spaced data.
On the other hand, numerical methods such as the Runge-Kutta schemes [3] lead to highly accurate solutions for dynamical systems with known differential equations, and are by construction able to deal with varying time intervals.
The main research question that we tackle is therefore the following. Given a set of dynamical system observations, how can we build a model that can make use of the full expressive power of general-purpose RNNs, but that naturally deals with unevenly spaced time series?
It has already been pointed out that the Euler scheme for numerically solving differential equations bears similarities with artificial neural network models containing residual connections
[9, 23, 4]. Naively applying this numerical scheme to RNNs for time series modeling, would indeed allow correctly dealing with uneven time intervals. However, unlike traditional RNNs, such schemes are incremental in nature, due to the residual connections along the time dimension, and therefore ill-suited for modeling stationary time series. We will show how this can be resolved, leading to models that take advantage of both the bounded character and expressive power of well-known RNNs, and the time-aware nature of numerical schemes for differential equations.The paper makes the following contributions:
We introduce an extension of general-purpose RNNs to deal with unevenly spaced time series (Section 3.1), and which can be used in higher-order numerical schemes (Section 3.2). In particular, we propose a solution for the so-called ‘unit root’ problem related to incremental recurrent schemes, to make the proposed approach suited for modeling stationary dynamical systems.
We introduce a time-aware and higher-order extension of the Gated Recurrent Unit and Antisymmetric RNN (Section 3.3).
We provide insights into the introduced models with experiments on data from two industrial input/output systems (Section 4). The code required to run the presented experiments is publicly available^{1}^{1}1https://github.com/tdmeeste/TimeAwareRNN.
This work is situated in between the fields of system identification, numerical techniques for differential equations, and deep neural networks. We refer the reader to standard works in these areas [18, 3, 13], and focus in the following paragraphs on specifically related works.
More than two decades ago, Wang1998 Wang1998 introduced ‘Runge Kutta Neural Networks’, to predict trajectories of time-invariant ODEs with unknown right-hand side. Their core idea of combining neural networks and Runge-Kutta schemes still applies to the underlying work.
Several authors have recently put forward techniques for learning to compose partial differential equations from data. Rudy2017 Rudy2017 presented an efficient method to select fitting nonlinear terms, from a library of potential candidate functions and their derivatives. Raissi2018 Raissi2018 proposed to use Gaussian Processes for learning system parameters, to balance model complexity and data fitting. Raissi2018b Raissi2018b introduced another interesting approach whereby two neural network models are simultaneously trained to model the solution as well as the right-hand side of unknown partial differential equations.
Rudy2019 Rudy2019 presented a new paradigm on system identification from noisy data. Rather than assuming ideal trajectories, they proposed simultaneously predicting the measurement noise on the training data, while learning the system dynamics. For the latter, they used multilayer feed-forward neural networks in a Runge-Kutta scheme, which allows dealing with non-uniform timesteps. They provided results on well-known autonomous dynamical systems including the chaotic Lorenz system and double pendulum. We focus on the use of general-purpose recurrent neural networks, which allow modeling input/output systems. Their ideas on predicting the measurement noise can however be applied in our setting, which provides an interesting future research direction.
Ayed2019 Ayed2019 proposed a general model for continuous state-space dynamics, based on the adjoint state method, and with the explicit Euler scheme for stepping through time. As in most of the related work mentioned above, they focus on initial-value problems, while we target input/output systems. Importantly, their model is able to capture the entire state dynamics even if these are only partly observed. In our work, we also consider systems for which the entire state is not captured by the observations alone, an ideal setting for RNNs which maintain a hidden state through time.
The work by Zhu2017 Zhu2017 is related to our work in the endeavor to extend RNN models with temporal information. They propose the Time-LSTM, engineered for applications in the context of recommendation engines. Its so-called ‘time gates’ are designed to model intervals over time, to capture users’ short- and long-term interests.
The use of RNNs in modeling time series with missing data was explored by Che2018 Che2018. More in particular, they leveraged ‘informative missingness’, the fact that patterns of missing values are often correlated with the target labels. They introduced the GRU-D, an extension of the GRU with a mask indicating which input variables are missing, as well as as a decay mechanism to model the fading influence of missing variables over time.
The successful use of neural networks in the field of dynamical systems, has in turn inspired some recent developments in the area of deep learning.
Weinan2017 Weinan2017 shared ideas on using dynamical systems to model high-dimensional nonlinear functions in machine learning, pointing out the link between the Euler scheme and deep residual networks.
Zhu2018 Zhu2018 started from the same link, in the area of image recognition, and suggested to extend the residual building blocks by multi-stage blocks, whereby suitable coefficients are learned jointly with the model (rather than relying on existing Runge-Kutta schemes).
Recently, Chen2018_nips Chen2018_nips introduced Neural ODEs, a new family of neural networks where the output is computed using a black-box ODE solver (which could involve explicit Runge-Kutta methods, or even more stable implicit methods). They provide proof-of-concept experiments on a range of applications. These include the ‘continuous depth’ setting, where ODE solvers (including a Runge-Kutta integrator) are shown to be able to replace residual blocks for a simple image classification task. They also discuss the ‘continuous time’ setting, and propose a generative time-series model. That model represents the considered time series, which may be unevenly spaced in time, as latent trajectories. These are initialized by encoding the observed time series using an RNN, and can be generated by the ODE solver at arbitrary points forwards or backwards in time. Training of the generative model is done as a variational auto-encoder. The complementary value of our work is in the fact that we provide an input/output dynamical systems formulation, and we believe that our extension from discrete RNNs to time-aware RNNs for dynamical systems makes it straightforward to apply.
Chang2019 Chang2019 introduced the Antisymmetric RNN (henceforth written ASRNN), again based on knowledge of the Euler scheme for dynamical systems. The use of an anti-symmetric hidden-to-hidden weight matrix in the incremental recurrent scheme (as well as a small diffusion term), ensured stability of the system. They demonstrated their model’s ability to capture long-term dependencies, for a number of image recognition tasks cast as sequence classification problems. What’s more, the ASRNN model is naturally suited for modeling unevenly sampled time series: while Chang et al. view the step size as a fixed hyperparameter to be tuned during model selection, it can just as well be used as the actual time step, which we will further describe in Section
3.3. We will adapt the ASRNN to become better suited for modeling stationary systems.Finally, we want to point out that our use of the term ‘higher-order’ models, refers to the order of the corresponding Runge-Kutta method. The term ‘higher order neural networks’ has also been used for neural network layers with multiplicative, rather than additive, combinations of features at the input [22]. Also, ‘higher order recurrent neural networks’ may refer to RNNs where the current hidden state has access to multiple previous hidden states, rather than only the last one.
After a general treatment on adapting recurrent neural networks to deal with unevenly spaced data (Section 3.1), we show how to use such models in higher-order Runge-Kutta schemes (Section 3.2), and introduce the higher-order time-aware extensions for the GRU and ASRNN (Section 3.3).
An RNN that models a discrete sequence of inputs and outputs , can generally be described as follows
(1) | ||||
The quantity is called the hidden state at time step , and is obtained by combining the input with the hidden state from the previous time step through the cell function , which contains the recurrent cell’s trainable parameters. The initial hidden state
can be fixed to the zero vector, or trained with the model parameters. The output function
, which converts the hidden state to the output , is typically a basic neural network designed for classification or regression, depending on the type of output data. The nature of the recurrent network is determined by . It could be for instance an Elman RNN [11] or a GRU. Variations to Eq. (1) are possible, for example for an LSTM where an additional internal cell state is passed between time steps.Now consider an unknown continuous-time dynamical system, with inputs and outputs at time . These do not necessarily cover the entire state space, as argued in [1]. We therefore explicitly introduce the state variable which, when observed at one point in time, allows determining the future system behavior, provided the system equations and future inputs are known. Many dynamical systems in science and technology can be described by an
’th order ordinary differential equation (ODE)
[7]. Assuming this holds for the considered system, its system equations can be reduced to a first-order ODE in the -dimensional state variable(2) | ||||
whereby represents a mapping from the latent state space to the output space. We assume time-invariant systems, i.e., the system equations only indirectly depend on the time, through the state and a potential source .
If we discretize time into a sequence , with potentially irregular step sizes , and make use of the differential form of the derivative over a single time step, we can discretize the system equations as
(3) | ||||
in which is shorthand for and similarly for the other quantities.
Because of the similarities between the ODE discretization formulation (Eq. (3)) and the standard RNN formulation (Eq. (1)), we will be able to use RNNs to model the system equations from the considered unknown system. However, there are two important differences between both formulations.
First of all, where the RNN allows predicting the output from the input at the same position in the sequence (combined with the previous state ), Eq. (3) only allows predicting the output at the next time step , given the input and state at the current time step . For evenly sampled data, shifting the entire output sequence over one position still allows training a model that predicts the output at the same point in time as the input while using a valid ODE discretization scheme. This is no longer possible for unevenly spaced data. However, our preliminary experiments on the considered datasets (see Section 4) show very little difference in prediction effectiveness, if we train a model that predicts either or from (in the evenly spaced case). Yet, it should be implemented with care in the case of irregular spacing, to avoid ending up with incorrect discretization schemes.
Secondly, the trainable function in Eq. (3) is only responsible for the ‘residual’ part besides when calculating . In other words, the term acts as a skip connection. Such skip connections form a key element in deep residual neural networks which have been highly successful for image recognition tasks [15]. However, in the time dimension they can have unwanted side effects. Naively extending a standard RNN with cell function to deal with uneven time steps according to the Euler scheme, yields the following update equation
(4) |
Consider for example an LSTM, its cell function bounded between and . When starting from a zero initial state, the bounds of the state after time steps become , or approximately , with the average step size. This does not necessarily lead to numerical problems, but a model with a potentially linearly growing state is ill-suited for modeling stationary time series. As will be demonstrated in Section 4, it leads to sub-optimal results.
A similar problem arises for the well-studied discrete-time stochastic process of first order defined by
(5) |
with
a serially uncorrelated zero-mean stochastic process with constant variance. The ‘unit root’ is a solution to the process’ characteristic equation. It leads to a trend in the mean, and hence a non-stationary process
[14]. However, the ‘differenced time series’ no longer has this unit root, and is stationary.Our update equation (4) similarly suffers from the unit root problem. We can therefore apply the idea of the differenced time series, but at the same time need to adhere to the general scheme (3) to correctly deal with variable sample intervals. We hence propose to use the following function in system equation (3)
(6) |
with again denoting the average step size. The first-order update equation for the state can then be written as
The unit root introduced by the term in Eq. (4) has indeed disappeared because the expected value of is zero. Note that unlike in Eq. (5), the RNN cell function in Eq. (4) is no zero-mean stochastic process, nor are its consecutive outputs uncorrelated. There is therefore no theoretical guarantee that the resulting model will be stationary. However, the neural network no longer has to explicitly ‘learn’ how to compensate for the unit root problem induced by the skip connection, and we hypothesize that it is therefore more naturally suited to deal with stationary data. For simplicity, in the remainder this will be called the ‘stationary’ formulation, in contrast to the incremental models with the unit root, for simplicity denoted as the ‘non-stationary’ one.
Combining equations (3) and (6) results in an extension of the standard RNN scheme towards unevenly spaced time series, in the sense that for evenly spaced samples () they reduce to the standard RNN in Eq. (1), or strictly speaking, one applied to predicting from and .
Note that the sample rate at inference time might not entirely correspond to
, leading to a remnant of the unit root effect. Our experimentation indicates that this is less of a problem than for instance the presence of outliers (i.e., occasionally very large gaps between consecutive samples).
A well-known family of higher order iterative ODE methods are the explicit Runge-Kutta methods [3]. Applying an -stage Runge-Kutta method to the ODE in Eq. (2) leads to the update equation
(7) |
where are found recursively over stages, as
for predefined values of the coefficients , , and . The error in predicting from a correct is called the local truncation error. A Runge-Kutta method of order denotes a method where the local truncation error is of the order . The coefficients for a number of well-known methods are listed in Table 1. For these methods, the number of stages equals their order. The update scheme initially proposed in Eq. (3) corresponds to Euler’s method (Euler), the simplest Runge-Kutta method. We further consider the second-order Explicit Midpoint method (Midpoint), Kutta’s third order method (Kutta3), and the classical fourth-order Runge-Kutta method (RK4).
Name (order) | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Euler (1) | 1 | ||||||||||
Midpoint (2) | 1/2 | 1/2 | |||||||||
Kutta3 (3) | 1/2 | 1 | 1/6 | 2/3 | 1/6 | 1/2 | -1 | 2 | |||
RK4 (4) | 1/2 | 1/2 | 1 | 1/6 | 1/3 | 1/3 | 1/6 | 1/2 | 1/2 | 1 |
If the function
is differentiable, the model can be trained by backpropagating the gradient of the loss on the predicted output through the considered sequence, and within each time step, through the stages of the considered Runge-Kutta update scheme. Existing RNN models
can hence be directly extended towards higher-order models that are suited for unevenly spaced data, by combining the proposed function in Eq. (6) with the Runge-Kutta update equation (7).Some recent works have already applied numerical ODE methods in combination with neural networks to model dynamical systems [5, 19]. However, they do not investigate input/output systems, the focus of this work. An important restriction to the use of higher-order methods for input/output systems, is the fact that the inputs may be only available under the form of samples . A valid Runge-Kutta update scheme however requires evaluating the input at intermediate points in time (as per Eq. (7)). As shown experimentally in Section 4
, this can be achieved through interpolation, but the approximation may counteract the effectiveness of higher-order methods. Another approach is to build a generative higher-order model for the input as well, which will be explored in future work.
To make the results from the previous sections more tangible, we write out the proposed time-aware extension for the GRU cell and for the ASRNN.
The cell function for the GRU [6], cast for the formulation , is given by
in which represents elementwise multiplication. The auxiliary vectors and are called the ‘gates’
with
the sigmoid function. With the hidden state dimension
and input size , the trainable parameters are given by the weight matrices , , and biases . Applying Eq. (6) to avoid the unit root, yields for the time-aware GRUwhereby for convenience is replaced by a new gate . The function is to be used with Eq. (3) for the first-order scheme, or with Eq. (7) for its higher-order counterparts. These equations retain the expressiveness and amount of trainable parameters from the original GRU cell, but remain valid for unevenly spaced data without inducing the unit root problem, and can be used in higher-order schemes. In Section 4, the non-stationary formulation from Eq. (4), i.e., , will be used as a baseline, to underline the importance of avoiding the unit root.
As a second example, we consider the gated ASRNN introduced by Chang2019 Chang2019. Its cell function can be written as
The hidden-to-hidden matrix can be written as . It corresponds to an anti-symmetric matrix (i.e., the difference between a weight matrix and its transpose ), with a small negative value on the diagonal (indicated by the non-negative ‘diffusion’ parameter and unit matrix ) to ensure stability. The original ASRNN formulation follows the incremental (i.e., non-stationary) first-order formulation, with the step size as a hyperparameter for weighting the residual term in the state update equation. We replace it by the actual step size (normalized by its mean) to deal with uneven sample times, and keep the scaling factor for tuning the model:
(8) |
Its stationary counterpart follows from Eq. (3) and Eq. (6)
(9) |
with straightforward extension to higher-order schemes.
This section presents experimental results on two input/output datasets. The main research questions we want to investigate are (i) what is the impact of unevenly sampled data on prediction results with standard RNNs vs. with their time-aware extension, (ii) how important is the use of state update schemes that avoid the unit root issue, (iii) is there any impact from applying the time-aware models with higher-order schemes, and (iv) how are the output predictions affected while applying such higher-order schemes based only on sampled inputs?
After describing the selected datasets (Section 4.1), the model architecture, and the training and evaluation setup (Section 4.2), we describe the experiments and discuss the results (Section 4.3).
We have selected two datasets from STADIUS’s Identification Database “DaISy” [8], a well-known database for system identification.
We use the Continuous Stirred Tank Reactor (CSTR) dataset^{2}^{2}2ftp://ftp.esat.kuleuven.be/pub/SISTA/data/process˙industry/cstr.dat.gz
. It contains evenly sampled observations (10 samples per minute) from a model of an exothermic reaction in a continuous stirred tank reactor. There is a single piecewise constant input signal, the coolant flow, and two output signals, the resulting concentration and temperature. The data was first studied by Lightbody1997 Lightbody1997, who introduced a basic neural network model in the context of adaptive control of nonlinear systems. It consists of a sequence of in total 7,500 samples, of which we used the first 70% for training, the next 15% for validation, and the last 15% for testing. We used the original dataset for an evenly spaced baseline model, and generated a version with missing data, by randomly leaving out samples with a probability of
. The average interval between consecutive samples is doubled ( minutes), but the data now contains gaps up to 13 times the original gap (). We normalize the input and outputs, by subtracting their respective mean value in the training data, and dividing by the standard deviation.
We also use the data from a Test Setup of an Industrial Winding Process^{3}^{3}3ftp://ftp.esat.kuleuven.be/pub/SISTA/data/process˙industry/winding.dat.gz (Winding). It contains a sequence of 2,500 evenly sampled measurements (10 samples per second). The test setup consists of 3 reels, the ‘unwinding reel’ from which a web is unwinded, after which it goes over a traction reel, and is rewinded onto the ‘rewinding reel’. The inputs are the angular speed of the 3 reels, as well as the setpoint current of the motors for the unwinding and rewinding reel, i.e., five inputs in total. The two outputs correspond to measurements of the web’s tension in between the reels. The data was introduced and first studied by Bastogne1997 Bastogne1997. We again created an artificial unevenly sampled data sequence based on real-world data, by randomly leaving out samples with probability . We used the first 70% of the input sequence for training, then 15% for development, and the last 15% for testing.
The overall goal of this work is to demonstrate how standard RNNs can be applied to unevenly sampled data from input/output models. To keep the approach generic, we use the same overall architecture and training procedure for both datasets.
Modeling the data using a recurrent network with the same input dimension as the number of observed system inputs, appeared not sufficient. We therefore use RNN cell functions with a potentially higher input size and the same state size, and feed it with the observed input data (1 dimension for CSTR, 5 for Winding) extended to dimensions by applying a trainable linear mapping from the inputs to dimensions, followed by a non-linearity. As output function (from Eq. (3)) we use a trainable linear mapping from state dimensions to the observed output space (2 dimensions for both datasets).
We report the root relative squared error (RRSE) averaged over the output channnels. Being a relative metric, it allows comparing results between different models and datasets. The RRSE is defined as [2]
in which represents the predicted test value for channel at time step , whereas is the corresponding ground truth value, with the channel mean.
Per output channel, the RRSE can be interpreted as the root mean squared (RMS) error of the prediction, normalized by the RMS error of the channel’s average as a baseline. In other words, for an RRSE value of 100%, the model performs no better than predicting the mean.
The test value is obtained by evaluating the model through the entire sequence, to ensure that the test sequence receives the appropriate initial state, and calculating the RRSE on the test sequence only. All reported values are the mean (and standard deviation) over five training runs starting from a different random initialization of the network.
We train the model with backpropagation-through-time [20] over 20 time steps, and perform the optimization in parallel over mini-batches of (possibly overlapping) segments of 20 time steps. The hidden state
at the start of the entire sequence is randomly initialized, and trained with the model. After each training epoch over all segments, a forward pass through the entire train sequence is performed, and the resulting states are used as initial state for the corresponding training segments (i.e., we used the training ‘scheme 4’ as introduced by Deboom18_rnn Deboom18_rnn). We minimize the mean squared error of the predicted outputs using the Adam optimizer
[17], and apply early stopping by measuring the RRSE on the validation sequence.In order to investigate whether the proposed models work out of the box, rather than requiring substantial tuning, we only tune the baseline GRU and ASRNN models, without missing data. The same hyperparameters are then adopted for the experiments in the uneven sampling setting. They are shown in Table 2.
During our preliminary experiments, we noticed that applying regularization through dropout gave higher prediction errors. Given the small amount of training data (i.e., a single sequence of a few thousand measurements), our hypothesis is that applying dropout while allowing for larger numbers of trainable parameters did not allow to better capture the system dynamics, while it made training more difficult. We therefore chose to tune the model complexity only through the hidden state size .
hyperparameter | CSTR | Winding | ||
---|---|---|---|---|
GRU | ASRNN | GRU | ASRNN | |
minibatch size | 512 | 512 | 512 | 64 |
state size | 20 | 100 | 10 | 10 |
learning rate | 0.001 | 0.001 | 0.003 | 0.01 |
The test error for the GRU and ASRNN baselines without missing data are shown in Table 3 (top two lines). As mentioned above, the hyperparameters from Table 2 are tuned on these. For both models, the formulation without unit root is used. For the GRU, this comes down to its standard formulation, whereas for the ASRNN, the stationary variant in Eq. (9) is used, which for evenly sampled data reduces to
Overall it can be seen that the prediction error for the CSTR data is much lower than for the Winding data. This is likely due to properties of the datasets. The CSTR dataset contains smooth simulation results, and has a relatively higher sample rate with respect to changes in the signal compared to the Winding data, which consists of actual measurements.
We created a number of baselines for the data with missing samples as well, also shown in Table 3. When the standard GRU is applied, ignoring the missing data, there is a substantial increase of the error (‘standard, ignore missing’ in Table 3). The results are not dramatic, though. We hypothesize that the model learns, to some extent, to compensate in its output for sudden larger gaps in the input (due to larger temporal gaps). From that perspective, it does make sense to apply a standard RNN to unevenly sampled data. A straightforward way to augment standard RNN models with variable time steps, is by providing the step size (normalized) as an additional input signal to the model. This reduces the error by a few percentage points (‘standard, extra input ’ in the table). More advanced models, in line with [24], may provide an even better alternative.
Finally, we applied the incremental Euler scheme of Eq. (4) without compensation of the unit root, both for the GRU and the ASRNN (indicated as ‘time-aware, non-station.’). This leads to an increased error, confirming the hypothesis from Section 3.1 that the presence of the unit root negatively affects the modeling of stationary data. Note however that the ASRNN seems less affected than the incremental GRU model. The step size and the diffusion parameter from the original ASRNN were both set to for the baseline without missing data, but were now tuned over the same values as in [4], without much improvement.
Model | CSTR | Winding |
---|---|---|
Baselines on all original samples | ||
GRU (standard) | ||
ASRNN (stationary) | ||
Baselines with missing data | ||
GRU (standard, ignore missing) | ||
GRU (standard, extra input ) | ||
GRU (time-aware, non-station.) | ||
ASRNN (time-aware, non-station.) |
The results for the stationary time-aware higher-order GRU model are shown in Table 4. The ‘constant’ vs. ‘linear’ input interpolation shown in the table is related to the issue identified in Section 3.2 that correct higher-order schemes require inputs evaluated in between samples, i.e., , with depending on the specific Runge-Kutta scheme. For the CSTR data, the constant approximation is sufficient as the inputs are piecewise constant over several time steps, and higher-order schemes lead to lower errors. However, this is not the case for the Winding dataset, where some of the inputs correspond to continuous variables. The results in Table 4 indeed show that higher-order schemes are not beneficial when the inputs are assumed piecewise constant within each sample interval (column ‘constant’ for the Winding data). However, with a simple linear interpolation between consecutive inputs , it seems the output error again decreases for the tested higher-order schemes. More advanced interpolation methods may be more suited still, but were considered out of scope for this work.
For both datasets, the Euler scheme performs a few percentage points worse than the standard GRU where the time steps are not explicitly encoded (see baseline ‘ignore missing’ in Table 3). This might be related to the absence of hyperparameter tuning for the time-aware models. However, increasing the order leads to gradually lower test errors for the time-aware methods with appropriate input interpolation. The 4’th order RK4 method leads to the overall lowest error for the missing data setting, even without tuning.
Due to space constraints, Table 4 only shows time-aware results for the stationary GRU. Note that the corresponding ASRNN errors would remain slightly higher, consistent with the baselines. Also, the non-stationary counterpart of Table 4 would show that the presence of the unit root annihilates the positive effect of higher-order schemes entirely.
Scheme | CSTR | Winding | |
---|---|---|---|
constant | constant | linear | |
Euler | |||
Midpoint | |||
Kutta3 | |||
RK4 |
We now shortly look back at the research questions formulated at the start of this section. In our setting, randomly leaving out training and test samples from a sequence of input/output system measurements leads to an increase in output prediction error. However, standard RNNs can still make meaningful predictions, especially when the temporal information is explicitly provided as a feature. For the datasets under study, the proposed time-aware higher-order schemes have the potential to compensate even better for the missing data. Eliminating the unit root appears however important when applying a standard RNN cell in an incremental update scheme. Furthermore, for data with continuously valued input samples, the use of higher-order schemes only makes sense if a proper interpolation in the input space is performed.
This paper focused on using neural sequence models for input/output system identification from unevenly spaced observations. We showed how to extend standard recurrent neural networks to naturally deal with unevenly spaced data by augmenting the update scheme with the local step size in a way that allows modeling stationary dynamical systems, and showed how the resulting model can be used in higher-order Runge-Kutta schemes.
We provided experimental results for two different input/output system datasets where we experimented with the impact of randomly leaving out data samples. Applying the time-aware model in higher-order schemes, gave better output predictions compared to ignoring the uneven sample times. The direct extension of RNNs with the incremental Euler scheme to correctly account for uneven sample times appeared to give inferior results. We hypothesized that this was due to the unit root problem, leading to an inherently non-stationary model, and showed how to avoid that problem.
Future research includes looking into more complex input/output systems with non-uniform noisy data. One potential research direction could involve the application of adaptive sampling schemes during forecasting. For example, the introduced models could be readily used with the Runge-Kutta-Fehlberg methods with adaptive step size [12] in a computationally efficient way. A further promising research direction is in extending the proposed techniques for dynamical systems to generative sampling models for time series as proposed by Chen2018_nips Chen2018_nips. A potentially interesting application domain would be in robotics, where light-weight dynamical system models with adaptive sample times could be of interest in terms of computational efficiency.
This research received funding from the Flemish Government under the “Onderzoeksprogramma Artificiële Intelligentie (AI) Vlaanderen” programme. I am grateful to Cedric De Boom for his feedback on the paper, and to the anonymous reviewers for their useful suggestions.
2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
, Vol. , pp. 770–778. External Links: Document, ISSN 1063-6919 Cited by: §3.1.Proceedings of the 26th International Joint Conference on Artificial Intelligence
, IJCAI’17, pp. 3602–3608. External Links: ISBN 978-0-9992411-0-3 Cited by: §4.3.
Comments
There are no comments yet.