Query-focused and Memory-aware Reranker for Long Context Processing
AI 摘要
提出一种新的query-focused的memory-aware reranking框架,在多个数据集上超越SOTA。
主要贡献
- 提出query-focused reranking框架
- 利用attention score估计passage-query相关性
- 在多个数据集上超越SOTA
方法论
利用预训练语言模型的注意力机制,训练模型利用候选列表的整体信息,估计passage-query的相关性。
原文摘要
Built upon the existing analysis of retrieval heads in large language models, we propose an alternative reranking framework that trains models to estimate passage-query relevance using the attention scores of selected heads. This approach provides a listwise solution that leverages holistic information within the entire candidate shortlist during ranking. At the same time, it naturally produces continuous relevance scores, enabling training on arbitrary retrieval datasets without requiring Likert-scale supervision. Our framework is lightweight and effective, requiring only small-scale models (e.g., 4B parameters) to achieve strong performance. Extensive experiments demonstrate that our method outperforms existing state-of-the-art pointwise and listwise rerankers across multiple domains, including Wikipedia and long narrative datasets. It further establishes a new state-of-the-art on the LoCoMo benchmark that assesses the capabilities of dialogue understanding and memory usage. We further demonstrate that our framework supports flexible extensions. For example, augmenting candidate passages with contextual information further improves ranking accuracy, while training attention heads from middle layers enhances efficiency without sacrificing performance.