I^3 Retriever: Incorporating Implicit Interaction in Pre-trained Language Models for Passage Retrieval
Not on the map. Why?
Abstract (arXiv)
Passage retrieval is a fundamental task in many information systems, such as web search and question answering, where both efficiency and effectiveness are critical concerns. In recent years, neural retrievers based on pre-trained language models (PLM), such as dual-encoders, have achieved huge success. Yet, studies have found that the performance of dual-encoders are often limited due to the neglecting of the interaction information between queries and candidate passages. Therefore, various interaction paradigms have been proposed to improve the performance of vanilla dual-encoders. Particularly, recent state-of-the-art methods often introduce late-interaction during the model inference process. However, such late-interaction based methods usually bring extensive computation and storage cost on large corpus. Despite their effectiveness, the concern of efficiency and space footprint is still an important factor that limits the application of interaction-based neural retrieval models. To tackle this issue, we incorporate implicit interaction into dual-encoders, and propose I^3 retriever. In particular, our implicit interaction paradigm leverages generated pseudo-queries to simulate query-passage interaction, which jointly optimizes with query and passage encoders in an end-to-end manner. It can be fully pre-computed and cached, and its inference process only involves simple dot product operation of the query vector and passage vector, which makes it as efficient as the vanilla dual encoders. We conduct comprehensive experiments on MSMARCO and TREC2019 Deep Learning Datasets, demonstrating the I^3 retriever's superiority in terms of both effectiveness and efficiency. Moreover, the proposed implicit interaction is compatible with special pre-training and knowledge distillation for passage retrieval, which brings a new state-of-the-art performance.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Jun 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 3.
5 papers.
- 2025Parametric Retrieval Augmented Generationcited by 38
- 2023LeCaRDv2: A Large-Scale Chinese Legal Case Retrieval Datasetcited by 37
- 2024LexEval: A Comprehensive Chinese Legal Benchmark for Evaluating Large Language Modelscited by 36
- 2025SelfRACG: Enabling LLMs to Self-Express and Retrieve for Code Generationcited by 2
- 2025EduEval: A Hierarchical Cognitive Benchmark for Evaluating Large Language Models in Chinese Educationcited by 2
- 2025EduEval: A Hierarchical Cognitive Benchmark for Evaluating Large Language Models in Chinese Education29 Nov 2025
- 2025SelfRACG: Enabling LLMs to Self-Express and Retrieve for Code Generation25 Jul 2025
- 2025Parametric Retrieval Augmented Generation27 Jan 2025
- 2024LexEval: A Comprehensive Chinese Legal Benchmark for Evaluating Large Language Models30 Sep 2024
- 2023LeCaRDv2: A Large-Scale Chinese Legal Case Retrieval Dataset26 Oct 2023