SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2211.00005 · ECCV · 2022

Uncertainty-DTW for Time Series and Sequences

Piotr Koniusz, Lei Wang

arXiv · PDF · Open in the Atlas

Code that ran

We lifted 7 functions out of this paper's own repositories and ran 4 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.

RepositoryRoleRan
leiwangr/udtw — 4 of 7
FunctionStatusWhere it lives
_SoftDTW Ran leiwangr/udtw/uDTW.py
pointer only (licence: NONE) · get_code("3cd72643274fe371")
_SoftDTWCUDA Ran leiwangr/udtw/uDTW.py
pointer only (licence: NONE) · get_code("939fea17c8ba2fcd")
compute_softdtw Ran leiwangr/udtw/uDTW.py
pointer only (licence: NONE) · get_code("7004997843b54cce")
compute_softdtw_backward Ran leiwangr/udtw/uDTW.py
pointer only (licence: NONE) · get_code("c059b14c600bf564")
compute_softdtw_backward_cuda Not yet run leiwangr/udtw/uDTW.py
pointer only (licence: NONE) · get_code("e23326afe6cbf283")
compute_softdtw_cuda Not yet run leiwangr/udtw/uDTW.py
pointer only (licence: NONE) · get_code("7aecca5640ddf1da")
uDTW Not yet run leiwangr/udtw/uDTW.py
pointer only (licence: NONE) · get_code("8d82d78cfff3ba9c")

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

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échet mean of time series, and supervised/unsupervised few-shot action recognition of the articulated human 3D body joints.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2211.00005")
get_code_for_paper("2211.00005")
have("2211.00005")

Connect an agent — have() is free.