arXiv cs.AI· Gerardo Pastrana, Haojun Li, Dhruv Mehta, Anoushka Vyas, Sina Khoshfetrat Pakazad, Henrik Ohlsson, John Paparrizos·· 9 天前AI 评分22
READ-Bench:面向时间序列诊断的历史实例检索基准
READ-Bench: Benchmarking Historical Instance Retrieval for Time-Series Diagnosis
AI 导读
研究者推出 READ-Bench,一个覆盖 12 个诊断数据集、以多变量时间序列为核心的历史案例检索基准,按共享故障或事件类型而非信号形状定义相关性。在统一协议下,预训练表示在纯检索上相对强经典与符号基线无统计显著优势,决定性因素是重排序阶段少量已解决案例监督——高斯过程重排序器在嵌入空间传播少量邻居标签,效果远超更复杂表示或语言模型推理。
正文 · 原文
Abstract:Time-series diagnostic systems rarely rely on retrieving relevant historical cases, and when they do, retrieval is evaluated only indirectly through downstream prediction. We introduce READ-Bench, a benchmark for historical-case retrieval across 12 diagnostic datasets, centered on multivariate time series, that defines relevance by shared fault or event type rather than signal shape, so visually different traces of the same fault count as relevant while similar-looking traces of different faults do not. Treating retrieval as a base retriever followed by a reranker, we evaluate classical distances, symbolic retrievers, self-supervised and foundation-model embedders, and their fusion, plus label-aware and language-model rerankers, under one protocol that varies supervision, pollution, and corpus scale with significance testing. Under a common channel-independent interface, pretrained representations offer no statistically detectable advantage over strong classical and symbolic baselines for search alone. The decisive factor is a small amount of resolved-case supervision at reranking, namely a Gaussian-process reranker that propagates a few neighbor labels in embedding space, which helps far more than more sophisticated representations or language-model reasoning and holds under pollution and at full corpus scale. Guided by these findings, we fuse a normal-residual-scored embedder with a dynamic time warping leg via reciprocal-rank fusion, then rerank with the Gaussian-process reranker, improving NDCG@10 over its own search stage on all 12 datasets, by +0.11 from reranking and +0.16 over the strongest single base retriever.
| Subjects: | Artificial Intelligence (cs.AI) |
| Cite as: | arXiv:2609.32123 [cs.AI] |
| (or arXiv:2609.32123v2 [cs.AI] for this version) | |
| https://doi.org/10.48550/arXiv.2609.32123 arXiv-issued DOI via DataCite |
Submission history
From: Anoushka Vyas [view email]
[v1]
Sat, 26 Sep 2026 00:53:42 UTC (1,097 KB)
[v2]
Thu, 8 Oct 2026 04:57:53 UTC (1,097 KB)
来源:arXiv cs.AI · arxiv.org