Uncertainty-DTW for Time Series and Sequences
- URL: http://arxiv.org/abs/2211.00005v1
- Date: Sun, 30 Oct 2022 17:06:55 GMT
- Title: Uncertainty-DTW for Time Series and Sequences
- Authors: Lei Wang and Piotr Koniusz
- Abstract summary: We propose to model the so-called aleatoric uncertainty of a differentiable (soft) version of Dynamic Time Warping.
Our uncertainty-DTW is the smallest weighted path distance among all paths.
We showcase forecasting the evolution of time series, estimating the Fr'echet mean of time series, and supervised/unsupervised few-shot action recognition of the articulated human 3D body joints.
- Score: 38.27785891922479
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Dynamic Time Warping (DTW) is used for matching pairs of sequences and
celebrated in applications such as forecasting the evolution of time series,
clustering time series or even matching sequence pairs in few-shot action
recognition. The transportation plan of DTW contains a set of paths; each path
matches frames between two sequences under a varying degree of time warping, to
account for varying temporal intra-class dynamics of actions. However, as DTW
is the smallest distance among all paths, it may be affected by the feature
uncertainty which varies across time steps/frames. Thus, in this paper, we
propose to model the so-called aleatoric uncertainty of a differentiable (soft)
version of DTW. To this end, we model the heteroscedastic aleatoric uncertainty
of each path by the product of likelihoods from Normal distributions, each
capturing variance of pair of frames. (The path distance is the sum of base
distances between features of pairs of frames of the path.) The Maximum
Likelihood Estimation (MLE) applied to a path yields two terms: (i) a sum of
Euclidean distances weighted by the variance inverse, and (ii) a sum of
log-variance regularization terms. Thus, our uncertainty-DTW is the smallest
weighted path distance among all paths, and the regularization term (penalty
for the high uncertainty) is the aggregate of log-variances along the path. The
distance and the regularization term can be used in various objectives. We
showcase forecasting the evolution of time series, estimating the Fr\'echet
mean of time series, and supervised/unsupervised few-shot action recognition of
the articulated human 3D body joints.
Related papers
- Timer-XL: Long-Context Transformers for Unified Time Series Forecasting [67.83502953961505]
We present Timer-XL, a generative Transformer for unified time series forecasting.
Timer-XL achieves state-of-the-art performance across challenging forecasting benchmarks through a unified approach.
arXiv Detail & Related papers (2024-10-07T07:27:39Z) - Compatible Transformer for Irregularly Sampled Multivariate Time Series [75.79309862085303]
We propose a transformer-based encoder to achieve comprehensive temporal-interaction feature learning for each individual sample.
We conduct extensive experiments on 3 real-world datasets and validate that the proposed CoFormer significantly and consistently outperforms existing methods.
arXiv Detail & Related papers (2023-10-17T06:29:09Z) - Probabilistic Learning of Multivariate Time Series with Temporal Irregularity [21.361823581838355]
Real-world time series often suffer from temporal irregularities, including nonuniform intervals and misaligned variables.
We propose an end-to-end framework that models temporal irregularities while capturing the joint distribution of variables at arbitrary continuous-time points.
arXiv Detail & Related papers (2023-06-15T14:08:48Z) - Deep Declarative Dynamic Time Warping for End-to-End Learning of
Alignment Paths [54.53208538517505]
This paper addresses learning end-to-end models for time series data that include a temporal alignment step via dynamic time warping (DTW)
We propose a DTW layer based around bi-level optimisation and deep declarative networks, which we name DecDTW.
We show that this property is particularly useful for applications where downstream loss functions are defined on the optimal alignment path itself.
arXiv Detail & Related papers (2023-03-19T21:58:37Z) - Approximating DTW with a convolutional neural network on EEG data [9.409281517596396]
We propose a fast and differentiable approximation of Dynamic Time Wrapping (DTW)
We show that our methods achieve at least the same level of accuracy as other DTW main approximations with higher computational efficiency.
arXiv Detail & Related papers (2023-01-30T13:27:47Z) - ODformer: Spatial-Temporal Transformers for Long Sequence
Origin-Destination Matrix Forecasting Against Cross Application Scenario [18.241804329382543]
Origin-Destination (OD) record directional flow data between pairs of OD regions.
Most of the related methods are designed for very short sequence time series forecasting in specific application scenarios.
We propose a Transformer-like model named ODformer, with two salient characteristics.
arXiv Detail & Related papers (2022-08-17T10:58:46Z) - Triformer: Triangular, Variable-Specific Attentions for Long Sequence
Multivariate Time Series Forecasting--Full Version [50.43914511877446]
We propose a triangular, variable-specific attention to ensure high efficiency and accuracy.
We show that Triformer outperforms state-of-the-art methods w.r.t. both accuracy and efficiency.
arXiv Detail & Related papers (2022-04-28T20:41:49Z) - Graph Gamma Process Generalized Linear Dynamical Systems [60.467040479276704]
We introduce graph gamma process (GGP) linear dynamical systems to model real multivariate time series.
For temporal pattern discovery, the latent representation under the model is used to decompose the time series into a parsimonious set of multivariate sub-sequences.
We use the generated random graph, whose number of nonzero-degree nodes is finite, to define both the sparsity pattern and dimension of the latent state transition matrix.
arXiv Detail & Related papers (2020-07-25T04:16:34Z) - Time Series Alignment with Global Invariances [14.632733235929926]
We propose a novel distance accounting both feature space and temporal variabilities by learning a latent global transformation of the feature space together with a temporal alignment.
We present two algorithms for the computation of time series barycenters under this new geometry.
We illustrate the interest of our approach on both simulated and real world data and show the robustness of our approach compared to state-of-the-art methods.
arXiv Detail & Related papers (2020-02-10T15:11:50Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.