Skip to content
AI News HubLIVE
Original source3 min read

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

Summary

Researchers propose WETW, a learned distance that adapts embedding comparisons per pair of time series, combined with the WESEE encoder and ranking regularization, achieving 11.4x speedup over the fastest exact method with mean recall@10 of 0.93 across eight datasets.

SourcearXiv Machine LearningAuthor: Christos Panourgias, Qitong Wang, George Tzagkarakis, Themis Palpanas
WETW: Learning Pair-Specific Weighted Euclidean Distances for Efficient DTW Search
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[Submitted on 12 Nov 2026]

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

View a PDF of the paper titled WETW: Learning Pair-Specific Weighted Euclidean Distances for Efficient DTW Search, by Christos Panourgias and 3 other authors

View PDF HTML (experimental)

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.

Subjects:

Machine Learning (cs.LG); Artificial Intelligence (cs.AI)

Cite as: arXiv:2611.17412 [cs.LG]

(or arXiv:2611.17412v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2611.17412

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Christos Panourgias [view email] [v1] Thu, 12 Nov 2026 19:00:03 UTC (1,981 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled WETW: Learning Pair-Specific Weighted Euclidean Distances for Efficient DTW Search, by Christos Panourgias and 3 other authors

View PDF

HTML (experimental)

TeX Source

view license

Additional Features

Audio Summary

Current browse context:

cs.LG

new | recent | 2026-11

Change to browse by:

cs cs.AI

References & Citations

SciX

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

IArxiv recommender toggle

IArxiv Recommender (What is IArxiv?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

EngineersAdvanced

Key points

  • WETW builds on the observation that once a pair is aligned, DTW equals a Euclidean distance over coordinates selected for that pair, so a small symmetric network predicts one weight per embedding dimension and pair
  • The WESEE encoder's multi-scale temporal feature extractor preserves timing information and raises recall@1 from 0.90 to 0.95
  • Regression alone misorders nearest neighbors; adding ranking regularization lifts recall@1 from 0.79 to 0.95
  • WETW-FV uses a filter-and-verify pipeline returning only exact DTW distances and remains 40x faster than the UCR Suite on 48K-point series

Highlights and analysis are generated automatically and may contain errors. Check the original source.

WETW: Learning Pair-Specific Weighted Euclidean Distances for Efficient DTW Search | AI News Hub