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.
Figures & tables
Fig. 1: Example VLM input and corresponding outputs for segment captioning. The four captions are generated in the same order as the segment indices shown in the plot.
Pool
Method
Recall@1
Recall@5
Recall@10
mAP
100
Random
0.000
0.000
0.000
0.009
100
CLIP
0.010
0.020
0.030
0.027
100
LaSTR
0.240
0.710
0.840
0.446
1000
Random
0.000
0.000
0.000
0.001
1000
CLIP
0.000
0.000
0.010
0.003
1000
LaSTR
0.050
0.220
0.310
0.145
TABLE I: Retrieval performance evaluated in single-positive segment retrieval setting with different pool sizes.
Pool
Method
Mean SBERT @10
VLM Score (1–5)@10
VLM Precision (binary)@10
100
Random
0.496
3.550
0.351
100
CLIP
0.505
3.631
0.433
100
LaSTR
0.625
4.037
0.719
1000
Random
0.489
3.521
0.327
1000
CLIP
0.505
3.690
0.437
1000
LaSTR
0.639
4.122
0.804
TABLE II: SBERT and VLM-as-a-judge scores (Top-10) across candidate pool sizes.
Fig. 2: Distribution of per-query mean VLM scores over top-10 retrieved segments (test split, pool size =10000 , 5-point scale).
Fig. 3: Qualitative retrieval examples on the test split. For each query, the figure shows the query caption and the corresponding rank-1 retrieved time-series window at pool size 10,000. Segment boundaries are overlaid, and the retrieved segment is highlighted to indicate the matched region.
Time Series Language Models (TSLMs) promise reasoning over real-world temporal data, but their ability to retrieve and reason over long time-series remains largely untested. We introduce TS-Haystack, a multi-domain retrieval benchmark with ten event-grounded question-answering tasks over contexts from 100 seconds to 24 hours, spanning direct retrieval, temporal reasoning, multi-step reasoning, and contextual anomaly detection. Existing TSLMs exhibit severe long-context degradation: accuracy declines with context length, direct-tokenization models run out of memory beyond 100 seconds on high-rate signals, and time-interval-grounded tasks collapse toward near-zero accuracy when increasing the time-series lengths, aligning with existing literature on text and multi-modal long context retrieval. An agentic retrieval framework using specialized time-series classifier tools matches or outperforms SoTA TSLMs on 9 of 10 tasks, highlighting agentic retrieval as a promising approach for long-context TSLMs.
Nicolas Zumarraga, Thomas Kaar, Ning Wang +12
1Agentic Systems Lab, ETH Zurich · 2Stanford University · 3Traffic Engineering Group, Institute for Transport Planning and Systems, ETH Zurich +4
Time Series Language Models (TSLMs) offer a promising path toward time series understanding by reasoning over temporal signals and producing natural language answers and explanations. A common approach is Chain-of-Thought (CoT), which generates step-by-step rationales linking relevant signal patterns to final answers. Although these models learn from reference CoT traces during post-training, generating faithful descriptions of input time series at inference remains challenging. Expressing high-dimensional, continuous temporal representations in discrete language tokens may cause the model to neglect task-relevant patterns or describe them inaccurately. Because later reasoning steps build on these descriptions, early errors propagate, leading to incorrect answers with plausible explanations that are inconsistent with the input signal. We propose Lapras (Latent Post-trained Reasoning Across Series), a post-training framework that equips TSLMs with latent reasoning. A model trained with Lapras reasons through a sequence of continuous thoughts in the joint time series-language space, producing text only for the final answer. It learns this through teacher-student self-distillation, where a teacher trained on CoT reference traces reasons explicitly through text. The student aligns its hidden states with the teacher's at the answer stage, transferring the teacher's reasoning ability into its latent computation. We evaluate Lapras across four TSLM backbones on five time series question answering benchmarks. Lapras improves average F1 by up to 10.79% over explicit CoT while generating 23.9x fewer tokens. Lapras's continuous thoughts can also be decoded into readable reasoning traces via standard language decoding, preserving textual explanations. Together, these results highlight Lapras as a promising post-training paradigm for efficient, effective, and interpretable TSLM reasoning.
Yuliang Chen, Yu Yvonne Wu, Patrick Langer +11
Dartmouth College · Aionic Labs · Agentic Systems Lab, ETH Zurich +2
Comprehensive understanding of time series remains a significant challenge for Large Language Models (LLMs). Current research is hindered by fragmented task definitions and benchmarks with inherent ambiguities, precluding rigorous evaluation and the development of unified Time Series Reasoning Models(TSRMs). To bridge this gap, we formalize Time Series Reasoning (TSR) via a four-level taxonomy of increasing cognitive complexity. We introduce HiTSR, a hierarchical time series reasoning dataset comprising 83k samples with diverse task combinations and verified Chain-of-Thought (CoT) trajectories. Leveraging HiTSR, we propose LLaTiSA, a strong TSRM that integrates visualized patterns with precision-calibrated numerical tables to enhance the temporal perception of Vision-Language Models (VLMs). Through a multi-stage curriculum fine-tuning strategy, LLaTiSA achieves superior performance and exhibits robust out-of-distribution generalization across diverse TSR tasks and real-world scenarios. Our code is available at https://github.com/RainingNovember/LLaTiSA.