paper-with-me

홈 › Papers

Representing Time Series as Structured Programs for LLM Reasoning

2026-06-10 · Jaeho Kim, Changhun Oh, Seokhyun Lee, Irina Rish, Changhee Lee arxiv

Large language models (LLMs) have demonstrated strong reasoning and instruction-following capabilities, making them potentially powerful tools for time-series analysis. However, time series lie outside their native textual modality, raising a fundamental question: how should time series be represented so that LLMs can reason about them effectively? Existing work typically serializes raw numerical sequences or fine-tunes pre-trained LLMs on time-series data. These approaches place the burden of extracting temporal structure directly on the LLM, creating a modality mismatch that often degrades performance on long sequences and introduces substantial computational overhead. In this work, we introduce Time-Series-to-Structured-Program representation (T2SP), a deterministic, training-free method that represents a time series as a structured symbolic program. T2SP decomposes time series into trends, periods, and salient events, expressing them in a program-friendly format aligned with the textual and code-like modalities on which LLMs are natively trained. By shifting temporal-structure extraction from the model to the representation itself, T2SP enables off-the-shelf LLMs to leverage their existing reasoning capabilities for time-series understanding. We evaluate T2SP on three reasoning tasks -- editing, captioning, and question answering -- where it consistently improves performance, reduces reasoning time, and lowers failure rates compared with raw-string representations. Our results demonstrate that T2SP provides an effective interface between time series and LLMs.

📄 PDF Abstract BibTeX arXiv:2606.12481

Code (0)

등록된 구현이 없습니다.

Tasks

Question Answering

Similar Papers 제목 키워드 기반

Prism: Symbolic Superoptimization of Tensor Programs

2026-04-16 · Mengdi Wu, Xiaoyu Jiang, Oded Padon, Zhihao Jia arxiv

This paper presents Prism, the first symbolic superoptimizer for tensor programs. The key idea is sGraph, a symbolic, hierarchical representation that compactly encodes large classes of tensor programs by symbolically re…

Graph Generation

Automatic variational inference with cascading flows

2021-02-09 · Luca Ambrogioni, Gianluigi Silvestri, Marcel van Gerven

The automation of probabilistic reasoning is one of the primary aims of machine learning. Recently, the confluence of variational inference and deep learning has led to powerful and flexible automatic inference methods t…

Variational Inference

AgentArmor: Enforcing Program Analysis on Agent Runtime Trace to Defend Against Prompt Injection

2025-08-02 · Peiran Wang, Yang Liu, Yunfei Lu, Yifeng Cai 외 arxiv

Large Language Model (LLM) agents offer a powerful new paradigm for solving various problems by combining natural language reasoning with the execution of external tools. However, their dynamic and non-transparent behavi…

Synthesizing Visual Concepts as Vision-Language Programs

2025-11-24 · Antonia Wüst, Wolfgang Stammer, Hikaru Shindo, Lukas Helff 외 arxiv

Vision-Language models (VLMs) achieve strong performance on multimodal tasks but often fail at systematic visual reasoning tasks, leading to inconsistent or illogical outputs. Neuro-symbolic methods promise to address th…

Logical ReasoningProgram SynthesisVisual Reasoning

Evolutionary Feature Engineering for Structured Data

2026-07-02 · Ege Onur Taga, Yilin Zhuang, M. Emrullah Ildiz, Petros Mol 외 arxiv

Large language models are increasingly used as open-ended search operators in evolutionary optimization. We introduce Evolutionary Feature Engineering (EFE), a framework for using LLM-based evolution to discover preproce…

Feature Engineering