PaperScope
LIVE · 2026-09-22 05:40 UTC

Q-TIE: A Lightweight and Generalizable Re-ranking Framework for Temporal Information Retrieval

Soyeon Kim, Hyunjin Kim, JinYeong Bak, Steven Euijong Whang

Latestcs.CLcs.LGcs.AIcs.CV
arXiv ID
2609.23880 v1
Category
Submitted
2026-09-20

Abstract

Temporal Information Retrieval (TIR) has been increasingly critical given the rise of Retrieval-Augmented Generation (RAG). Since temporally mismatched evidence can be highly misleading, TIR aims to retrieve documents that are both semantically and temporally relevant to a query. Two TIR paradigms have emerged - temporal retrievers and temporal re-rankers - differing in how temporal relevance is modeled. While these paradigms provide complementary strengths, our analysis reveals that each alone falls short of robust TIR: temporal retrievers provide flexible query understanding via learned representations, but often fail to explicitly account for temporal constraints; temporal re-rankers can enforce such constraints more explicitly, but often rely on predefined re-ranking rules. To address this, we propose Q-TIE, a re-ranking framework based on learned Temporal Intent Extraction (TIE). By introducing a TIE model that maps each query's temporal constraint into a unified interval representation (i.e., $\langle t_{start}, t_{end} \rangle$), Q-TIE generalizes beyond predefined rules via model-based learning while explicitly modeling temporal constraints as a separate signal - jointly achieving what each paradigm typically trades off. Experiments demonstrate that Q-TIE consistently outperforms existing TIR methods with stronger generalizability across temporal query types, and provides a lightweight yet effective add-on for temporally-aware RAG pipelines. Code: https://github.com/ssoy0701/Q-TIE.

Comment: Accepted to EMNLP 2026 (Main Conference). Code: https://github.com/ssoy0701/Q-TIE

arXiv abs page · PDF · same-day batch