ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERT
arXiv:2004.12832
Abstract
Recent progress in Natural Language Understanding (NLU) is driving fast-paced advances in Information Retrieval (IR), largely owed to fine-tuning deep language models (LMs) for document ranking. While remarkably effective, the ranking models based on these LMs increase computational cost by orders of magnitude over prior approaches, particularly as they must feed each query-document pair through a massive neural network to compute a single relevance score. To tackle this, we present ColBERT, a novel ranking model that adapts deep LMs (in particular, BERT) for efficient retrieval. ColBERT introduces a late interaction architecture that independently encodes the query and the document using BERT and then employs a cheap yet powerful interaction step that models their fine-grained similarity. By delaying and yet retaining this fine-granular interaction, ColBERT can leverage the expressiveness of deep LMs while simultaneously gaining the ability to pre-compute document representations offline, considerably speeding up query processing. Beyond reducing the cost of re-ranking the documents retrieved by a traditional model, ColBERT's pruning-friendly interaction mechanism enables leveraging vector-similarity indexes for end-to-end retrieval directly from a large document collection. We extensively evaluate ColBERT using two recent passage search datasets. Results show that ColBERT's effectiveness is competitive with existing BERT-based models (and outperforms every non-BERT baseline), while executing two orders-of-magnitude faster and requiring four orders-of-magnitude fewer FLOPs per query.
arXiv commentAccepted at SIGIR 2020
References in corpus (17)
- Adam: A Method for Stochastic Optimization
- Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translation
- Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer
- A Deep Relevance Matching Model for Ad-hoc Retrieval
- End-to-End Neural Ad-hoc Ranking with Kernel Pooling
- Q8BERT: Quantized 8Bit BERT
- Deeper Text Understanding for IR with Contextual Neural Language Modeling
- Passage Re-ranking with BERT
- Distilling Task-Specific Knowledge from BERT into Simple Neural Networks
- Multi-Stage Document Ranking with BERT
- Understanding the Behaviors of BERT in Ranking
- Context-Aware Sentence/Passage Term Importance Estimation For First Stage Retrieval
- An Updated Duet Model for Passage Re-ranking
- Incorporating Query Term Independence Assumption for Efficient Retrieval and Ranking using Deep Neural Networks
- A Deep Look into Neural Ranking Models for Information Retrieval
- Let's measure run time! Extending the IR replicability infrastructure to include performance aspects
- TU Wien @ TREC Deep Learning '19 -- Simple Contextualization for Re-ranking
Cited by in corpus (37)
- Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval
- Evaluation of Retrieval-Augmented Generation: A Survey
- QAnswer: Towards Question Answering Search over Websites
- CorpusBrain: Pre-train a Generative Retrieval Model for Knowledge-Intensive Language Tasks
- The Information Retrieval Experiment Platform
- Generative Relevance Feedback with Large Language Models
- Query Embedding Pruning for Dense Retrieval
- Pre-train a Discriminative Text Encoder for Dense Retrieval via Contrastive Span Prediction
- Adaptive Re-Ranking with a Corpus Graph
- Improving Cross-lingual Information Retrieval on Low-Resource Languages via Optimal Transport Distillation
- CharacterBERT and Self-Teaching for Improving the Robustness of Dense Retrievers on Queries with Typos
- Foundations of Vector Retrieval
- Conformer-Kernel with Query Term Independence for Document Retrieval
- To Interpolate or not to Interpolate: PRF, Dense and Sparse Retrievers
- Zero-shot Query Contextualization for Conversational Search
- SpaDE: Improving Sparse Representations using a Dual Document Encoder for First-stage Retrieval
- Certified Robustness to Word Substitution Ranking Attack for Neural Ranking Models
- RecJPQ: Training Large-Catalogue Sequential Recommenders
- Semi-Siamese Bi-encoder Neural Ranking Model Using Lightweight Fine-Tuning
- CODER: An efficient framework for improving retrieval through COntextual Document Embedding Reranking
- Soft Prompt Decoding for Multilingual Dense Retrieval
- Implicit Feedback for Dense Passage Retrieval: A Counterfactual Approach
- Learning Multi-Stage Multi-Grained Semantic Embeddings for E-Commerce Search
- ZeQR: Zero-shot Query Reformulation for Conversational Search
- Asyncval: A Toolkit for Asynchronously Validating Dense Retriever Checkpoints during Training
- Open-domain question classification and completion in conversational information search
- IntenT5: Search Result Diversification using Causal Language Models
- OFAR: A Multimodal Evidence Retrieval Framework for Illegal Live-streaming Identification
- Explicit and Implicit Semantic Ranking Framework
- VILT: Video Instructions Linking for Complex Tasks
- Pre-trained Language Model based Ranking in Baidu Search
- A multi-perspective combined recall and rank framework for Chinese procedure terminology normalization
- Multi-EuP: The Multilingual European Parliament Dataset for Analysis of Bias in Information Retrieval
- Semantic Homogenization in Italian Popular Music: A Diachronic Analysis
- MIX : a Multi-task Learning Approach to Solve Open-Domain Question Answering
- BERT2DNN: BERT Distillation with Massive Unlabeled Data for Online E-Commerce Search
- Red Dragon AI at TextGraphs 2021 Shared Task: Multi-Hop Inference Explanation Regeneration by Matching Expert Ratings