TFT
In summary Temporal Fusion Transformer (TFT) combines gating layers, an
LSTM recurrent encoder, with multi-head attention layers for a
multi-step forecasting strategy decoder.
TFT’s inputs are static
exogenous , historic exogenous
, exogenous available at the time of the
prediction and autorregresive features
, each of these inputs is further decomposed into
categorical and continuous. The network uses a multi-quantile regression
to model the following conditional
probability:
References
- Jan Golda, Krzysztof Kudrynski. “NVIDIA, Deep
Learning Forecasting
Examples”
-
Bryan Lim, Sercan O. Arik, Nicolas Loeff, Tomas Pfister, “Temporal
Fusion Transformers for interpretable multi-horizon time series
forecasting”
1. Auxiliary Functions
1.1 Gating Mechanisms
The Gated Residual Network (GRN) provides adaptive depth and network complexity capable of accommodating different size datasets. As residual connections allow for the network to skip the non-linear transformation of input and context .
The Gated Linear Unit (GLU) provides the flexibility of supressing unnecesary parts of the GRN. Consider GRN’s output then GLU transformation is defined by:
1.2 Variable Selection Networks
TFT includes automated variable selection capabilities, through its variable selection network (VSN) components. The VSN takes the original input and transforms it through embeddings or linear transformations into a high dimensional space .
For the observed historic data, the embedding matrix at time is a concatenation of variable embeddings:
The variable selection weights are given by:
The VSN processed features are then:
1.3. Multi-Head Attention
To avoid information bottlenecks from the classic Seq2Seq architecture, TFT incorporates a decoder-encoder attention mechanism inherited transformer architectures (Li et. al 2019, Vaswani et. al 2017). It transform the the outputs of the LSTM encoded temporal features, and helps the decoder better capture long-term relationships.
The original multihead attention for each component and its query, key, and value representations are denoted by , its transformation is given by:
TFT modifies the original multihead attention to improve its interpretability. To do it it uses shared values across heads and employs additive aggregation, . The mechanism has a great resemblence to a single attention layer, but it allows for multiple attention weights, and can be therefore be interpreted as the average ensemble of single attention layers.
2. TFT Architecture
The first TFT’s step is embed the original input into a high dimensional space , after which each embedding is gated by a variable selection network (VSN). The static embedding is used as context for variable selection and as initial condition to the LSTM. Finally the encoded variables are fed into the multi-head attention decoder.
2.1 Static Covariate Encoder
The static embedding is transformed by the StaticCovariateEncoder into contexts . Where are temporal variable selection contexts, are TemporalFusionDecoder enriching contexts, and are LSTM’s hidden/contexts for the TemporalCovariateEncoder.
2.2 Temporal Covariate Encoder
TemporalCovariateEncoder encodes the embeddings and contexts with an LSTM.
An analogous process is repeated for the future data, with the main difference that contains the future available information.
2.3 Temporal Fusion Decoder
The TemporalFusionDecoder enriches the LSTM’s outputs with and then uses an attention layer, and multi-step adapter.
source
TFT
*TFT
The Temporal Fusion Transformer architecture (TFT) is an Sequence-to-Sequence model that combines static, historic and future available data to predict an univariate target. The method combines gating layers, an LSTM recurrent encoder, with and interpretable multi-head attention layer and a multi-step forecasting strategy decoder.
Parameters:
h
: int, Forecast horizon.
input_size
: int,
autorregresive inputs size, y=[1,2,3,4] input_size=2 ->
y_[t-2:t]=[1,2].
stat_exog_list
: str list, static continuous
columns.
hist_exog_list
: str list, historic continuous
columns.
futr_exog_list
: str list, future continuous columns.
hidden_size
: int, units of embeddings and encoders.
dropout
:
float (0, 1), dropout of inputs VSNs.
n_head
: int=4, number of
attention heads in temporal fusion decoder.
attn_dropout
: float
(0, 1), dropout of fusion decoder’s attention layer.
grn_activation
: str, activation for the GRN module from [‘ReLU’,
‘Softplus’, ‘Tanh’, ‘SELU’, ‘LeakyReLU’, ‘Sigmoid’, ‘ELU’, ‘GLU’].
loss
: PyTorch module, instantiated train loss class from losses
collection.
valid_loss
: PyTorch module=loss
, instantiated valid loss class from
losses
collection.
max_steps
: int=1000, maximum number of training steps.
learning_rate
: float=1e-3, Learning rate between (0, 1).
num_lr_decays
: int=-1, Number of learning rate decays, evenly
distributed across max_steps.
early_stop_patience_steps
: int=-1,
Number of validation iterations before early stopping.
val_check_steps
: int=100, Number of training steps between every
validation loss check.
batch_size
: int, number of different series
in each batch.
windows_batch_size
: int=None, windows sampled from
rolled data, default uses all.
inference_windows_batch_size
:
int=-1, number of windows to sample in each inference batch, -1 uses
all.
start_padding_enabled
: bool=False, if True, the model will
pad the time series with zeros at the beginning, by input size.
valid_batch_size
: int=None, number of different series in each
validation and test batch.
step_size
: int=1, step size between
each window of temporal data.
scaler_type
: str=‘robust’, type of
scaler for temporal inputs normalization see temporal
scalers.
random_seed
: int, random seed initialization for replicability.
num_workers_loader
: int=os.cpu_count(), workers to be used by
TimeSeriesDataLoader
.
drop_last_loader
: bool=False, if True
TimeSeriesDataLoader
drops last non-full batch.
alias
: str,
optional, Custom name of the model.
optimizer
: Subclass of
‘torch.optim.Optimizer’, optional, user specified optimizer instead of
the default choice (Adam).
optimizer_kwargs
: dict, optional, list
of parameters used by the user specified optimizer
.
lr_scheduler
: Subclass of ‘torch.optim.lr_scheduler.LRScheduler’,
optional, user specified lr_scheduler instead of the default choice
(StepLR).
lr_scheduler_kwargs
: dict, optional, list of parameters
used by the user specified lr_scheduler
.
dataloader_kwargs
:
dict, optional, list of parameters passed into the PyTorch Lightning
dataloader by the TimeSeriesDataLoader
.
**trainer_kwargs
: int,
keyword trainer arguments inherited from PyTorch Lighning’s
trainer.
3. TFT methods
TFT.fit
*Fit.
The fit
method, optimizes the neural network’s weights using the
initialization parameters (learning_rate
, windows_batch_size
, …) and
the loss
function as defined during the initialization. Within fit
we use a PyTorch Lightning Trainer
that inherits the initialization’s
self.trainer_kwargs
, to customize its inputs, see PL’s trainer
arguments.
The method is designed to be compatible with SKLearn-like classes and in particular to be compatible with the StatsForecast library.
By default the model
is not saving training checkpoints to protect
disk memory, to get them change enable_checkpointing=True
in
__init__
.
Parameters:
dataset
: NeuralForecast’s
TimeSeriesDataset
,
see
documentation.
val_size
: int, validation size for temporal cross-validation.
random_seed
: int=None, random_seed for pytorch initializer and numpy
generators, overwrites model.__init__’s.
test_size
: int, test
size for temporal cross-validation.
*
TFT.predict
*Predict.
Neural network prediction with PL’s Trainer
execution of
predict_step
.
Parameters:
dataset
: NeuralForecast’s
TimeSeriesDataset
,
see
documentation.
test_size
: int=None, test size for temporal cross-validation.
step_size
: int=1, Step size between each window.
random_seed
:
int=None, random_seed for pytorch initializer and numpy generators,
overwrites model.__init__’s.
**data_module_kwargs
: PL’s
TimeSeriesDataModule args, see
documentation.*
source
TFT.feature_importances,
*Compute the feature importances for historical, future, and static features.
Returns: dict: A dictionary containing the feature importances for each feature type. The keys are ‘hist_vsn’, ‘future_vsn’, and ‘static_vsn’, and the values are pandas DataFrames with the corresponding feature importances.*
source
TFT.attention_weights
*Batch average attention weights
Returns: np.ndarray: A 1D array containing the attention weights for each time step.*
source
TFT.attention_weights
*Batch average attention weights
Returns: np.ndarray: A 1D array containing the attention weights for each time step.*
source
TFT.feature_importance_correlations
*Compute the correlation between the past and future feature importances and the mean attention weights.
Returns: pd.DataFrame: A DataFrame containing the correlation coefficients between the past feature importances and the mean attention weights.*
Usage Example
Interpretability
1. Attention Weights
1.1 Mean attention
1.2 Attention of all future time steps
1.3 Attention of a specific future time step
2. Feature Importance
2.1 Global feature importance
Static variable importances
Past variable importances
Future variable importances
2.2 Variable importances over time
Future variable importance over time
Importance of each future covariate at each future time step
2.3
Past variable importance over time
Past variable importance over time ponderated by attention
Decomposition of the importance of each time step based on importance of each variable at that time step
3. Variable importance correlations over time
Variables which gain and lose importance at same moments