cs.LGNov 12, 2026

WETW: Learning Pair-Specific Weighted Euclidean Distances for Efficient DTW Search

Authors: Christos Panourgias, Qitong Wang, George Tzagkarakis, Themis Palpanas

Organizations: LIPADE, Universit´e Paris Cit´e, France · Harvard University, Cambridge, MA, USA · FORTH-ICS, Heraklion, Greece

Abstract

Dynamic Time Warping (DTW) is the standard distance for similarity search over time series that are misaligned in time, but its cost is quadratic in the series length and lower bounds often prune few candidates, so search over large collections of long series is slow. Learned approximations embed the series to make comparisons cheap, yet compare every pair with the same fixed rule, usually the Euclidean distance, although DTW aligns each pair differently. We observe that, once a pair is aligned, DTW is a Euclidean distance over coordinates selected for that pair. Building on this view, we propose Weighted Euclidean Time Warping (WETW), a learned distance that adapts the comparison of fixed-length embeddings to each pair. A small symmetric network predicts one weight per embedding di- mension and pair without computing an alignment, which halves the error of the best static distance on the same embeddings. The embeddings come from the Weighted Euclidean SEries Encoder (WESEE), whose multi-scale Temporal Feature Extractor keeps the timing information that global pooling removes and raises recall@1 from 0.90 to 0.95, although WETW works with any encoder. We also show that fitting DTW distances is not enough for search, as regression alone misorders the closest neighbours, and that ranking regularization raises recall@1 from 0.79 to 0.95. Our filter-and-verify pipeline, WETW-FV, uses WETW to build a shortlist and exact DTW to check it, so the search is approximate but every returned distance is exact. Over eight datasets, WETW-FV is 11.4x faster than the fastest exact method among the UCR Suite, lower bounds and MESSI-DTW, at a mean recall@10 of 0.93, while the best learned baseline reaches 0.59 at the same speed. On 48K-point series, WETW- FV remains 40x faster than the UCR Suite at a recall@10 of 0.91.

Figures & tables

Explore similar work

CardsList
  1. Fast Gradient-Based Approximation of Continuous Dynamic Time Warping

    Oct 9, 2026Pierre Houedry, Romain Tavenard, Nicolas Courty +1Dynamic Time Warping

  2. SoftDTW-CUDA-Torch: Memory-Efficient GPU-Accelerated Soft Dynamic Time Warping for PyTorch

    Feb 19, 2026Ron Shapira Weber, Oren FreifeldDynamic Time WarpingGPU Acceleration

  3. Deep Distance Measurement Method for Unsupervised Multivariate Time Series Similarity Retrieval

    Mar 13, 2026Susumu Naito, Kouta Nakata, Yasunori TaguchiTime Series Representation LearningMetric Learning