Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2403.13291 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911804589867008 |
|---|---|
| author | Liu, Qi Guo, Gang Mao, Jiaxin Dou, Zhicheng Wen, Ji-Rong Jiang, Hao Zhang, Xinyu Cao, Zhao |
| author_facet | Liu, Qi Guo, Gang Mao, Jiaxin Dou, Zhicheng Wen, Ji-Rong Jiang, Hao Zhang, Xinyu Cao, Zhao |
| contents | With the development of pre-trained language models, the dense retrieval models have become promising alternatives to the traditional retrieval models that rely on exact match and sparse bag-of-words representations. Different from most dense retrieval models using a bi-encoder to encode each query or document into a dense vector, the recently proposed late-interaction multi-vector models (i.e., ColBERT and COIL) achieve state-of-the-art retrieval effectiveness by using all token embeddings to represent documents and queries and modeling their relevance with a sum-of-max operation. However, these fine-grained representations may cause unacceptable storage overhead for practical search systems. In this study, we systematically analyze the matching mechanism of these late-interaction models and show that the sum-of-max operation heavily relies on the co-occurrence signals and some important words in the document. Based on these findings, we then propose several simple document pruning methods to reduce the storage overhead and compare the effectiveness of different pruning methods on different late-interaction models. We also leverage query pruning methods to further reduce the retrieval latency. We conduct extensive experiments on both in-domain and out-domain datasets and show that some of the used pruning methods can significantly improve the efficiency of these late-interaction models without substantially hurting their retrieval effectiveness. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_13291 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | An Analysis on Matching Mechanisms and Token Pruning for Late-interaction Models Liu, Qi Guo, Gang Mao, Jiaxin Dou, Zhicheng Wen, Ji-Rong Jiang, Hao Zhang, Xinyu Cao, Zhao Information Retrieval With the development of pre-trained language models, the dense retrieval models have become promising alternatives to the traditional retrieval models that rely on exact match and sparse bag-of-words representations. Different from most dense retrieval models using a bi-encoder to encode each query or document into a dense vector, the recently proposed late-interaction multi-vector models (i.e., ColBERT and COIL) achieve state-of-the-art retrieval effectiveness by using all token embeddings to represent documents and queries and modeling their relevance with a sum-of-max operation. However, these fine-grained representations may cause unacceptable storage overhead for practical search systems. In this study, we systematically analyze the matching mechanism of these late-interaction models and show that the sum-of-max operation heavily relies on the co-occurrence signals and some important words in the document. Based on these findings, we then propose several simple document pruning methods to reduce the storage overhead and compare the effectiveness of different pruning methods on different late-interaction models. We also leverage query pruning methods to further reduce the retrieval latency. We conduct extensive experiments on both in-domain and out-domain datasets and show that some of the used pruning methods can significantly improve the efficiency of these late-interaction models without substantially hurting their retrieval effectiveness. |
| title | An Analysis on Matching Mechanisms and Token Pruning for Late-interaction Models |
| topic | Information Retrieval |
| url | https://arxiv.org/abs/2403.13291 |