Challenge: Interpretability in information retrieval (IR) models is coarse-grained and poorly understood . a cross-encoder model extracts traditional relevance signals, such as term frequency and inverse document frequency .
Approach: They analyze how a common IR model extracts traditional relevance signals . this is similar to the probabilistic ranking function BM25 .
Outcome: The proposed model extracts traditional relevance signals in early-to-middle layers, similar to BM25 . the model then combine these concepts in later layers, laying the groundwork for future interventions .

Similar Papers

Bridging the Gap between Relevance Matching and Semantic Matching for Short Text Similarity Modeling (D19-1)

Copied to clipboard

Challenge: Existing techniques for relevance and semantic matching cannot be easily adapted to the other.
Approach: They propose a model that incorporates a hybrid encoder module, a relevance matching module and co-attention mechanisms that capture context-aware semantic relatedness.
Outcome: The proposed model incorporates a hybrid encoder module, a relevance matching module and co-attention mechanisms that capture context-aware semantic relatedness.
Deep Relevance Ranking Using Enhanced Document-Query Interactions (D18-1)

Copied to clipboard

Challenge: Document relevance ranking is the task of ranking documents from a large collection using the query and the text of each document only.
Approach: They propose to use convolutional n-gram matching to inject rich context-sensitive encodings into their models, inspired by PACRR's convolution-based ngram matching features.
Outcome: The proposed models outperform baselines, DRMM, and PACRR on the BIOASQ and TREC ROBUST questions and document inputs.
A Counterfactual Explanation Framework for Retrieval Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing literature on explainability of information retrieval has focused on illustrating the concept of relevance concerning a retrieval model.
Approach: They propose to add terms to a document to improve its ranking to answer the question of which words played a role in not being favored by a retrieval model.
Outcome: The proposed framework predicts counterfactuals for statistical and deep-learning models.
Contextual Relevance and Adaptive Sampling for LLM-Based Document Reranking (2026.acl-long)

Copied to clipboard

Challenge: identifying relevant documents for Reasoning-intensive queries remains a challenge . large language models have shown strong performance in zero-shot document reranking .
Approach: They propose a reranking algorithm that estimates contextual relevance by aggregating LLMs' relevance judgments across batches.
Outcome: The proposed algorithm improves nDCG@10 over retrieval and reranking baselines by 15% and 6–21% respectively.
Pseudo-Relevance for Enhancing Document Representation (2022.emnlp-main)

Copied to clipboard

Challenge: a novel approach to document retrieval can be used to encode documents as vectors . a few query-relevant terms can be pruned out to reduce index overhead .
Approach: They propose to enhance the document representation for the bi-encoder approach in dense document retrieval.
Outcome: The proposed solution reduces latency and memory footprint up to 8- and 3-fold . it is validated on MSMARCO and real-world search query logs .
The Challenges of Optimizing Machine Translation for Low Resource Cross-Language Information Retrieval (D19-1)

Copied to clipboard

Challenge: Existing studies do not investigate the effectiveness of MT metrics in predicting performance of downstream IR models.
Approach: They examine the relationship between MT performance and IR quality in a CLIR-based system . they find that the choice of IR collection can significantly affect MT tuning decisions .
Outcome: The proposed model can predict CLIR performance better from MT quality, the authors show . the proposed model is based on a BLEU-based model with a bag of words constraint .
Why These Documents? Explainable Generative Retrieval with Hierarchical Category Paths (2026.findings-acl)

Copied to clipboard

Challenge: Generative retrieval directly decodes a document identifier, making it impossible to provide explanations for its retrieval decision.
Approach: They propose a hierarchical category path-Enhanced Generative Retrieval that generates category paths step-by-step and decodes docid.
Outcome: The proposed method provides explanations for retrieval decision by generating hierarchical category paths step-by-step and decoding docid.
Sparse, Dense, and Attentional Representations for Text Retrieval (2021.tacl-1)

Copied to clipboard

Challenge: Dual encoders perform retrieval by encoding documents and queries into dense low-dimensional vectors, scoring each document by its inner product with the query.
Approach: They propose a dual-encoder-based neural model that combines the efficiency of dual encoders with expressiveness of more costly attentional architectures.
Outcome: The proposed model outperforms strong alternatives in large-scale retrieval.
Discovering Biases in Information Retrieval Models Using Relevance Thesaurus as Global Explanation (2024.emnlp-main)

Copied to clipboard

Challenge: Currently, local explanations are not effective in predicting the model’s behavior on unseen texts.
Approach: They propose a method to build a relevance thesaurus containing semantically relevant query term and document term pairs which can augment BM25 scoring functions to better approximate the neural model’s predictions.
Outcome: The proposed method can augment BM25 scoring functions to better approximate the neural relevance model’s predictions.
Neural Retriever and Go Beyond: A Thesis Proposal (2022.naacl-srw)

Copied to clipboard

Challenge: Existing neural retrievers are developed for pure-text queries, which prevents them from handling multi-modality queries.
Approach: They propose methods to address issues of existing neural retrievers from three angles . they propose new model architectures, IR-oriented pretraining tasks and generating large scale training data .
Outcome: The proposed methods address the abovementioned issues of neural retrievers from three angles and generate large scale training data.

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