LaSTR: Language-Driven Time-Series Segment Retrieval

Kota Dohi, Harsh Purohit, Tomoya Nishida, Takashi Endo, Yusuke Ohtsubo +4 more
2/28/2026
cs.CL

No confident code implementation found for this paper.

Abstract

Effectively searching time-series data is essential for system analysis, but existing methods often require expert-designed similarity criteria or rely on global, series-level descriptions. We study language-driven segment retrieval: given a natural language query, the goal is to retrieve relevant local segments from large time-series repositories. We build large-scale segment--caption training data by applying TV2-based segmentation to LOTSA windows and generating segment descriptions with GPT-5.2, and then train a Conformer-based contrastive retriever in a shared text--time-series embedding space. On a held-out test split, we evaluate single-positive retrieval together with caption-side consistency (SBERT and VLM-as-a-judge) under multiple candidate pool sizes. Across all settings, LaSTR outperforms random and CLIP baselines, yielding improved ranking quality and stronger semantic agreement between retrieved segments and query intent.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{dohi2026lastr,
  title  = {LaSTR: Language-Driven Time-Series Segment Retrieval},
  author = {Kota Dohi and Harsh Purohit and Tomoya Nishida and Takashi Endo and Yusuke Ohtsubo and Koichiro Yawata and Koki Takeshita and Tatsuya Sasaki and Yohei Kawaguchi},
  year   = {2026},
  eprint = {2603.00725},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2603.00725v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2603.00725.svg)](https://codeofpaper.com/paper/2603.00725)

Discussion