arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2306.15917cs.CLcs.IR
收藏

置信度校准的集成稠密短语检索

Confidence-Calibrated Ensemble Dense Phrase Retrieval

William Yang, Noah Bergam, Arnav Jain, Nima Sheikhoslami

AI总结:

本文提出一种置信度校准的集成稠密短语检索方法,通过在不同短语长度上应用DPR上下文编码器并进行集成预测,在无需额外预训练的情况下,于多个基准和特定领域数据集上取得最优结果。

摘要:

本文探讨了在不进一步预训练的情况下,能在多大程度上优化由(Karpukhin et. al. 2020)开发的基于transformer的Dense Passage Retrieval (DPR)算法。我们的方法包含两个特定见解:我们在各种短语长度(例如单句与五句片段)上应用DPR上下文编码器,并对所有这些不同分段进行置信度校准的集成预测。这种相当详尽的方法在Google NQ和SQuAD等基准数据集上取得了最先进的结果。我们还将该方法应用于特定领域数据集,结果表明不同粒度对不同领域是最优的。

英文摘要:

In this paper, we consider the extent to which the transformer-based Dense Passage Retrieval (DPR) algorithm, developed by (Karpukhin et. al. 2020), can be optimized without further pre-training. Our method involves two particular insights: we apply the DPR context encoder at various phrase lengths (e.g. one-sentence versus five-sentence segments), and we take a confidence-calibrated ensemble prediction over all of these different segmentations. This somewhat exhaustive approach achieves start-of-the-art results on benchmark datasets such as Google NQ and SQuAD. We also apply our method to domain-specific datasets, and the results suggest how different granularities are optimal for different domains

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

↑