Challenge: Experimental results show that using only bi-encoders as an intermediate reranker can improve top-1 accuracy with negligible slowdown (7%).
Approach: They propose a framework that compares a query and multiple embeddings of similar candidates through shallow self-attention layers, delivering rich representations contextualized to each other.
Outcome: The proposed framework compares a query and multiple embeddings of similar candidates through shallow self-attention layers, delivering rich representations contextualized to each other.

Similar Papers

Retrieve Fast, Rerank Smart: Cooperative and Joint Approaches for Improved Cross-Modal Retrieval (2022.tacl-1)

Copied to clipboard

Challenge: Current approaches to cross-modal retrieval process text and visual input jointly . current approaches are pretrained from scratch and suffer from huge retrieval latency and inefficiency issues .
Approach: They propose a cooperative retrieve-and-rerank framework that turns pretrained text-image multi-modal models into efficient retrieval models.
Outcome: The proposed framework improves retrieval performance over current approaches . it uses twin networks to encode all items of a corpus and a cross-encoder component for a more nuanced ranking .
CORE: Cooperative Training of Retriever-Reranker for Effective Dialogue Response Selection (2023.acl-long)

Copied to clipboard

Challenge: Existing methods to train retrieval-based dialogue systems are suboptimal . existing methods to optimize retrieval and rerank modules are sub-optimal, causing sub-optimum performance.
Approach: They propose a retrieval-based dialogue system with a fast retriever and a smart response reranker that combine the best of both worlds.
Outcome: The proposed method can learn from each other and evolve together . it can be used in industrial applications and has powered industrial applications.
Multi-Vector Attention Models for Deep Re-ranking (2021.emnlp-main)

Copied to clipboard

Challenge: Document retrieval systems often use two styles of neural network models . dual encoder models are used for retrieval and deep re-ranking, while cross-attention models are typically used for shallow reranking.
Approach: They propose a dual encoder and cross-attention neural network architectures that combine query and document representations to optimize retrieval accuracy.
Outcome: The proposed architecture trades off retrieval accuracy with joint computation and offline document storage cost.
CODER: An efficient framework for improving retrieval through COntextual Document Embedding Reranking (2022.emnlp-main)

Copied to clipboard

Challenge: Contextual document embedding reranking is an efficient and efficient retrieval framework.
Approach: They propose a highly efficient retrieval framework that uses contextual document embedding reranking to incorporate ranking context into training.
Outcome: The proposed framework reduces the computational overhead of a first-stage method and can be used as stand-alone retrieval models.
Efficient Nearest Neighbor Search for Cross-Encoder Models using Matrix Factorization (2022.emnlp-main)

Copied to clipboard

Challenge: Efficient k-nearest neighbor search is a fundamental task, foundational for many problems in NLP.
Approach: They propose an approach that avoids the use of a dual-encoder for retrieval, relying solely on the cross-encoding model.
Outcome: Empirically, for k > 10, our approach provides test-time recall-vs-computational cost trade-offs superior to the current widely-used methods that re-rank items retrieved using a dual-encoder or TF-IDF.
Improving Document Representations by Generating Pseudo Query Embeddings for Dense Retrieval (2021.acl-long)

Copied to clipboard

Challenge: Existing retrieval models based on dense representations show better performance than sparse representations.
Approach: They propose a method to mimic the queries to each of the documents by an iterative clustering process and represent the documents using multiple pseudo queries.
Outcome: The proposed model achieves state-of-the-art results on a large dataset while remaining high efficiency.
Recall, Expand, and Multi-Candidate Cross-Encode: Fast and Accurate Ultra-Fine Entity Typing (2023.acl-long)

Copied to clipboard

Challenge: State-of-the-art (SOTA) methods use the cross-encoder architecture to concatenate a mention (and its context) with each type and feed it into a pretrained language model (PLM) to score their relevance.
Approach: They propose to perform entity typing in a recall-expand-filter manner and use a novel model to encode and score all these K candidates in one forward pass.
Outcome: The proposed method is thousands of times faster than the CE-based architecture and is very efficient in fine-grained (130 types) and coarse-grain (9 types) entity typing.
Benchmarking and Enabling Efficient Chinese Medical Retrieval via Asymmetric Encoders (2026.acl-long)

Copied to clipboard

Challenge: Effective medical text retrieval requires high accuracy and low latency.
Approach: They propose a benchmark for medical text retrieval in Chinese using a symmetric architecture . CARE is a lightweight encoder with an LLM-based encoder for offline document encoding .
Outcome: The proposed benchmark surpasses state-of-the-art symmetric models on CMedTEB . it matches high retrieval quality without increasing latency, and it performs well on a single GPU .
mGTE: Generalized Long-Context Text Representation and Reranking Models for Multilingual Text Retrieval (2024.emnlp-industry)

Copied to clipboard

Challenge: Existing models for text retrieval are based on a multi-stage process that involves retrieving documents from a large corpus.
Approach: They propose to build a multilingual text representation model and a cross-encoder reranker from scratch for text retrieval.
Outcome: The proposed models outperform the state-of-the-art models on long-context retrieval benchmarks.
CoRT: Complementary Rankings from Transformers (2021.naacl-main)

Copied to clipboard

Challenge: Recent approaches to information retrieval mitigate computational costs by using a multi-stage ranking pipeline.
Approach: They propose a ranking model that leverages contextual representations from pre-trained language models to complement term-based ranking functions while causing no significant delay at query time.
Outcome: The proposed model significantly increases candidate recall by complementing BM25 with missing candidates while causing no significant delay at query time.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations