Q-TIE: A Lightweight and Generalizable Re-ranking Framework for Temporal Information Retrieval
On the map: Retrieval-augmented generation → Generation and context integration
Abstract (arXiv)
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 tstart, tend 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.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Generation and context integration, one of 15 directions in Retrieval-augmented generation. Builds on 18 of its 42 references that are in the map. First posted on arXiv 20 Sep 2026.
Builds on
18 of 42 references.
Closest ancestors · 1
Same direction, newest first
Other references · 17
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
- 2025Qwen3 Technical Reportcited by 8,195
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
- 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,928
- 2023Self-RAG: Learning to Retrieve, Generate, and Critique through Self-Reflectioncited by 1,800
- 2021Unsupervised Dense Information Retrieval with Contrastive Learningcited by 1,203
- 2025Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Modelscited by 1,175
- 2024Nomic Embed: Training a Reproducible Long Context Text Embeddercited by 255
- 2021A Dataset for Answering Time-Sensitive Questionscited by 150
- 2023Jina Embeddings 2: 8192-Token General-Purpose Text Embeddings for Long Documentscited by 103
- 2025TempRetriever: Fusion-based Temporal Dense Passage Retrieval for Time-Sensitive Questionscited by 14
5 more
- 2025RAG Meets Temporal Graphs: Time-Sensitive Modeling and Retrieval for Evolving Knowledgecited by 10
- 2024Temporal Knowledge Graph Question Answering: A Surveycited by 9
- 2022Multilingual Normalization of Temporal Expressions with Masked Language Modelscited by 7
- 2025Temporal Information Retrieval via Time-Specifier Model Mergingcited by 5
- 2018Temporal Information Extraction by Predicting Relative Time-linescited by 4
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026FRESCO: Benchmarking and Optimizing Re-rankers for Evolving Semantic Conflict in Retrieval-Augmented Generation
- 2026TEMPS: Temporal Sentence Embeddings for Temporal Information Retrieval
- 2026Difficulty-Gated Fusion of Reasoning Views for Temporal Retrieval
- 2025Embedding-Based Context-Aware Reranker
- 2026TEMPO: A Realistic Multi-Domain Benchmark for Temporal Reasoning-Intensive Retrieval
- 2026Efficient Temporal-aware Matryoshka Adaptation for Temporal Information Retrieval
- 2025Enhancing Retrieval-Augmented Generation with Two-Stage Retrieval: FlashRank Reranking and Query Expansion
- 2024Attention in Large Language Models Yields Efficient Zero-Shot Re-Rankers