Seq2Synth is introduced, a unified benchmark for assessing temporal and schema properties to determine applicable evaluations, covering timestamp, cross-sectional, longitudinal, and structural fidelity, alongside trajectory-aware utility and privacy.
Abstract
Synthetic sequential tabular data are increasingly used for privacy-preserving data sharing and research, yet conventional tabular metrics often overlook temporal structure. Existing single-table and relational evaluation protocols largely collapse records into static distributions, leaving key temporal properties insufficiently evaluated. We introduce Seq2Synth, a unified benchmark for assessing these properties. Its taxonomy characterizes temporal and schema properties to determine applicable evaluations, covering timestamp, cross-sectional, longitudinal, and structural fidelity, alongside trajectory-aware utility and privacy. Across seven core datasets from a 13-dataset benchmark and eight generators, models with near-perfect static fidelity still violate basic temporal constraints, producing duplicate timestamps, irregular intervals, and incomplete observation grids. Moreover, static and temporal-aware rankings diverge substantially, showing that temporal fidelity must be evaluated directly rather than inferred from static or relational scores. Project page and online appendices are available at: https://seq2synth.github.io/.
A comprehensive evaluation of 17 state-of-the-art methods across Temporal Graph Neural Networks (TGNNs) and Large Language Model (LLM)-based paradigms reveals a clear capability divide between the two paradigms: TGNN-based methods excel at structural prediction but fail at semantic tracking, whereas LLM-based predictor...
Generating structurally valid synthetic tabular data remains difficult: outputs with high statistical fidelity and downstream utility can still violate semantically meaningful domain constraints. We study the discovery and enforcement of three complementary inter-column constraint families---equations, linear inequalit...
LLMODE is proposed, a token-efficient framework for irregular spatio-temporal forecasting with a frozen LLM backbone that shows competitive overall performance, with clearer advantages under sparse or dynamically complex irregular sampling.
Di Zhang, Jing-Yang Zhang, Zi-Qian Wang et al.· 0 citations
HiLoRe is introduced, which allocates graph-attributed recovery units among high-precision storage, low-precision compression, and deterministic recomputation using measured recovery utility and update-conditioned approximation risk, and combines high-precision storage and deterministic recomputation with low-precision...
Xin-Rui Chen, Mengyang Li, Ou Wu et al.· 0 citations
Long-context LLM agents accumulate interaction histories that strain KV-cache memory and attention computation. Although sparse attention reduces these costs, heterogeneous cache representations and workflows hinder integration with existing inference engines, while prior sparse-serving abstractions support only specif...
Jitai Hao, Quan-Sheng Gu, Qiang Huang et al.· 0 citations
I/O traces are essential for storage system evaluation and workload analysis, but real traces are often scarce due to privacy concerns, collection costs, and workload diversity. While LSTM-based generators model short-term sequential dependencies, they suffer from autoregressive error accumulation and struggle to joint...
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.