← Back to all news
arXiv Machine Learning By Daeun Ji, Minkyoung Kim, Dongkuk Kim, Yohan Lee, Beomsoo Kim, Beakcheol Jang

Beyond Similarity: Coverage-Aware Prompt Selection for Time Series Forecasting with LLMs

Read the original on arXiv Machine Learning →

The paper introduces CASP-LLM, a coverage‑aware semantic prompting framework that mitigates bias toward dominant temporal patterns in prompt‑based time series forecasting. Unlike traditional similarity‑based retrieval that selects top‑K candidates by cosine similarity, CASP‑LLM uses usage‑tracking and a saturating‑gate regularizer to diversify prompt selection without adding learnable parameters. Experiments on six long‑term and the M4 short‑term benchmarks show that CASP‑LLM matches or outperforms similarity‑based LLM forecasters in most settings, with failures traced to cross‑batch usage rather than within‑retrieval redundancy.

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 Machine Learning.

Related stories

arXiv Machine Learning
Jun 4

Stationarity-Aware Retrieval-Augmented Time Series Forecasting

arXiv:2606. 04135v1 Announce Type: new Abstract: Time series forecasting relies on historical patterns, but real-world series often exhibit non-stationarity and regime shifts that challenge fully parametric forecasters.

By Shiqiao Zhou, Holger Sch\"oner, Zipeng Wu, Edouard Fouch\'e, IAG Wilson, Shuo Wang
rag
More like this →
arXiv Machine Learning
Sep 17

Which Histories Matter for Time Series Forecasting? Learning Predictive Relevance with Future Supervision

The paper investigates which historical examples are most useful for time‑series forecasting by defining predictive relevance as the expected future utility conditioned on inference‑time information. It introduces a two‑stage approach: a normalized‑pattern retriever generates a coarse candidate set, and a lightweight MLP reranks these candidates using future‑supervised relevance while keeping inference strictly past‑only. Experiments on six benchmarks show that this reranker improves pattern retrieval and outperforms a matched‑protocol baseline, revealing that historical relevance is structured, domain‑dependent, and not governed by a single universal retrieval rule.

By Yong-Hoon Choi, Kwang-Hyun Park, Youngjin Cho
ragbenchmarks
More like this →
arXiv Machine Learning
Jun 16

Not All Retrievals are Useful: Cross-Attention for Input-Aware RAG in Time Series Forecasting

arXiv:2603. 14709v2 Announce Type: replace Abstract: Retrieval-augmented generation (RAG) enhances zero-shot time series (TS) forecasting by leveraging external knowledge bases, yet existing approaches overlook input-level relevance when fusing retrieved samples with the query.

By Seunghan Lee, Jaehoon Lee, Jun Seo, Sungdong Yoo, Minjae Kim, Tae Yoon Lim, Dongwan Kang, Hwanil Choi, SoonYoung Lee, Wonbin Ahn
rag
More like this →
arXiv AI
Oct 1

Linguistic Loopholes in LLM Unlearning: From a 174-Language Benchmark to Coverage-Aware Unlearning

The paper introduces the problem of cross‑lingual loopholes in large language model (LLM) unlearning, where forgetting a fact in one language can leave it accessible in others. It presents a new 174‑language benchmark, the Cross‑Lingual Unlearning Tensor, and proposes COVER, a method that selects a subset of source languages to maximize unlearning coverage under a language budget. Experiments show COVER reduces residual knowledge by 7.8–27.3% compared to uniform selection and works on both synthetic and real low‑resource news data.

By Tyler Skow, Shravan Chaudhari, Rama Chellappa, Abhay Yadav
llmsbenchmarks
More like this →
arXiv Computation and Language
Oct 12

Tracing and Taming Hallucinated Terms via Subsequence-Association Filtering and Breadth-Aware Selection for LLM Query Expansion

The paper introduces SAFE‑QE, a training‑free, retriever‑agnostic method for query expansion that mitigates hallucinated terms from large language models. It uses a subsequence‑association filter to score candidate terms based on their reproducibility across randomised query contexts, down‑weighting terms that lack corpus support. SAFE‑QE then selects a broad yet consistent set of expansions via constrained coverage maximisation, and defines a new metric, the Hallucinated Expansion Term Rate, to quantify faithfulness. The approach matches state‑of‑the‑art ranking performance while injecting far fewer unsupported terms on TREC and BEIR benchmarks.

By Amit Kumar Jaiswal, Sagar Uprety, Prayag Tiwari
llmssafety
More like this →