arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2202.07280cs.CL
收藏

会话搜索中从依赖关系中节省密集检索器

Saving Dense Retriever from Shortcut Dependency in Conversational Search

NAVER AI Lab(NAVER人工智能实验室);KAIST AI(韩国科学技术院人工智能研究院);Korea University(高丽大学)

Sungdong Kim, Gangwoo Kim

摘要:

对话搜索(CS)需要对对话输入进行全面理解才能检索相关段落。在本文中,我们证明了在CS中存在一个检索捷径,这导致模型只依赖于部分历史检索段落,而忽略了最新的问题。通过深入的分析,我们首先表明,天真的训练密集检索大量利用的捷径,因此表现不佳,当被要求回答历史无关的问题。为了构建更强大的模型来对抗捷径依赖,我们探索了各种硬否定挖掘策略。实验结果表明,基于模型的硬否定训练有效地减轻了对捷径的依赖,显着提高了最近CS基准测试的密集检索器。特别是,我们的寻回犬在QReCC上的Recall@10中的表现优于之前的最先进模型11.0。

英文摘要:

Conversational search (CS) needs a holistic understanding of conversational inputs to retrieve relevant passages. In this paper, we demonstrate the existence of a retrieval shortcut in CS, which causes models to retrieve passages solely relying on partial history while disregarding the latest question. With in-depth analysis, we first show that naively trained dense retrievers heavily exploit the shortcut and hence perform poorly when asked to answer history-independent questions. To build more robust models against shortcut dependency, we explore various hard negative mining strategies. Experimental results show that training with the model-based hard negatives effectively mitigates the dependency on the shortcut, significantly improving dense retrievers on recent CS benchmarks. In particular, our retriever outperforms the previous state-of-the-art model by 11.0 in Recall@10 on QReCC.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑