arXiv Computation and Language By Zhao Tan, Xianglong Bao, Zhipeng Xi, Ming Jin

TT-SAX: A Two-Track Time Series Symbolization for Natural Language Shape Querying

Read the original on arXiv Computation and Language →

The paper introduces TT‑SAX, a two‑track time series symbolization designed specifically for natural language shape querying. It addresses three identified shortcomings of existing symbolizations—missing direction, too fine a scale for direction, and arbitrary letters—by adding trend letters measured across neighboring segments and aligning them with query adjectives. Experiments on the NLQTSBench benchmark show TT‑SAX outperforming six classical symbolizations across six large language models, with ablation studies confirming the contribution of each design choice.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv AI
Aug 19

TSQueryBench: LLM-as-a-Judge for Time Series Explanations

TSQueryBench is a synthetic benchmark comprising 500 time‑series instances and 10 query types, each paired with correct, partially correct, and incorrect natural‑language explanations. The study evaluates six large language models on explanation generation, ranking, scoring, and anomaly detection, revealing that models often fail to generate numerically correct explanations yet can reliably identify or score correct ones. These findings suggest that rubric‑guided LLM evaluation is more dependable than generation for numerically grounded time‑series reasoning.

By Preetham Sivalingam, Murari Mandal, Dhruv Kumar, Saurabh Deshpande
arXiv Machine Learning
Sep 22

ShapeLex: Decoupling Local Shape Symbolization and Global Scale Modeling for Text-Controlled Time Series Generation

ShapeLex introduces a two-stage approach for text-controlled time series generation. It first creates a reusable vocabulary of discrete shape units—such as rises, spikes, and sharp drops—derived from training data, then uses an autoregressive generator to select and arrange these shapes based on textual input while adjusting their position and duration. Finally, a mixture-density scale head models global attributes like level and volatility to produce realistic time series that align closely with real data distributions.

By Subo Wei, Jianqi Gao, Mingyan Fan, Shaorong Xie, Xinzhi Wang, Yongpeng Dong
arXiv AI
Aug 24

RAG Deserves an Index: Why Ingest-Time Compilation Beats Query-Time Interpretation

The paper argues that retrieval‑augmented question‑answering systems should perform semantic compilation at ingest time rather than re‑deriving meaning at query time. By building a maintained structure—incrementally updated embeddings and validated atomic claims—read operations become far cheaper, with experimental results showing higher accuracy and lower token usage compared to traditional chunk‑based retrieval. The authors present two proofs: cheaper incremental updates and superior performance on broadcast‑interview transcripts, suggesting a new systems agenda for compilation and read planning.

By Kyle Wild, Yusuke Takahashi, Asako Uraki