SDR: Efficient Neural Re-ranking Using Succinct Document Representation

Abstract

BERT based ranking models have achieved superior performance on various information retrieval tasks. However, the large number of parameters and complex self-attention operation come at a significant latency overhead. To remedy this, recent works propose late-interaction architectures, which allow pre-computation of intermediate document representations, thus reducing the runtime latency. Nonetheless, having solved the immediate latency issue, these methods now introduce storage costs and network fetching latency, which limits their adoption in real-life production systems. In this work, we propose the Succinct Document Representation (SDR) scheme that computes highly compressed intermediate document representations, mitigating the storage/network issue. Our approach first reduces the dimension of token representations by encoding them using a novel autoencoder architecture that uses the document's textual content in both the encoding and decoding phases. After this token encoding st

Stats

• citations2
• S2 citations—
• github stars0
• HF likes0
• heat score3.58
• arxiv keycohen2021sdr

Related papers

• QDER: Query-specific Document And Entity Representations For Multi-vector Document Re-ranking (2025)0.00
• Drowning In Documents: Consequences Of Scaling Reranker Inference (2024)0.00
• Colbertv2: Effective And Efficient Retrieval Via Lightweight Late Interaction (2021)17.46
• Improving Neural Ranking Models With Traditional IR Methods (2023)0.00
• Efficient Neural Ranking Using Forward Indexes (2021)8.82
• CODER: An Efficient Framework For Improving Retrieval Through Contextual Document Embedding Reranking (2021)7.16
• Ultra-high Dimensional Sparse Representations With Binarization For Efficient Text Retrieval (2021)8.60
• Incorporating Query Term Independence Assumption For Efficient Retrieval And Ranking Using Deep Neural Networks (2019)0.00