Dense Passage Retrieval In Conversational Search

Abstract

Information retrieval systems have traditionally relied on exact term match methods such as BM25 for first-stage retrieval. However, recent advancements in neural network-based techniques have introduced a new method called dense retrieval. This approach uses a dual-encoder to create contextual embeddings that can be indexed and clustered efficiently at run-time, resulting in improved retrieval performance in Open-domain Question Answering systems. In this paper, we apply the dense retrieval technique to conversational search by conducting experiments on the CAsT benchmark dataset. We also propose an end-to-end conversational search system called GPT2QR+DPR, which incorporates various query reformulation strategies to improve retrieval accuracy. Our findings indicate that dense retrieval outperforms BM25 even without extensive fine-tuning. Our work contributes to the growing body of research on neural-based retrieval methods in conversational search, and highlights the potential of den

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keysalamah2025dense

Related papers

• Contextualized Query Embeddings For Conversational Search (2021)10.21
• CONVERSER: Few-shot Conversational Dense Retrieval With Synthetic Data Generation (2023)8.25
• Few-shot Conversational Dense Retrieval (2021)16.68
• Dense Passage Retrieval: Is It Retrieving? (2024)6.34
• Pseudo-relevance Feedback For Multiple Representation Dense Retrieval (2021)12.93
• Interpreting Conversational Dense Retrieval By Rewriting-enhanced Inversion Of Session Embedding (2024)6.77
• Efficient Passage Retrieval With Hashing For Open-domain Question Answering (2021)15.77
• Improving Query Representations For Dense Retrieval With Pseudo Relevance Feedback (2021)12.10