SparTerm: Learning Term-based Sparse Representation for Fast Text Retrieval
Yang Bai Tsinghua University , Xiaoguang Li Huawei Noah’s Ark Lab , Gang Wang Huawei Noah’s Ark Lab , Chaoliang Zhang Huawei Noah’s Ark Lab , Lifeng Shang Huawei Noah’s Ark Lab , Jun Xu Renmin University of China , Zhaowei Wang Huawei Noah’s Ark Lab , Fangshan Wang Huawei Technologies Co., Ltd and Qun Liu Huawei Noah’s Ark Lab
Abstract
Term-based sparse representations dominate the first-stage text retrieval in industrial applications, due to its advantage in efficiency, interpretability, and exact term matching. In this paper, we study the problem of transferring the deep knowledge of the pre-trained language model (PLM) to Term-based Sparse representations, aiming to improve the representation capacity of bag-of-words(BoW) method for semantic-level matching, while still keeping its advantages. Specifically, we propose a novel framework SparTerm to directly learn sparse text representations in the full vocabulary space. The proposed SparTerm comprises an importance predictor to predict the importance for each term in the vocabulary, and a gating controller to control the term activation. These two modules cooperatively ensure the sparsity and flexibility of the final text representation, which unifies the term-weighting and expansion in the same framework. Evaluated on MSMARCO dataset, SparTerm significantly outperforms traditional sparse methods and achieves state of the art ranking performance among all the PLM-based sparse models.
原文 arXiv:2010.00768;中英对照 + 大白话阅读 https://aha.fim.ai/paper/2010.00768v1