Deep Relevance Ranking Using Enhanced Document-Query Interactions
We explore several new models for document relevance ranking, building upon the Deep Relevance Matching Model (DRMM) of Guo et al. (2016). Unlike DRMM, which uses context-insensitive encodings of terms and query-document term interactions, we inject rich context-sensitive encodings throughout our models, inspired by PACRR's (Hui et al., 2017) convolutional n-gram matching features, but extended in several ways including multiple views of query and document inputs. We test our models on datasets from the BIOASQ question answering challenge (Tsatsaronis et al., 2015) and TREC ROBUST 2004 (Voorhees, 2005), showing they outperform BM25-based baselines, DRMM, and PACRR.
Code (1)
Tasks
Ad-Hoc Information RetrievalQuestion AnsweringSimilar Papers 제목 키워드 기반
Composite Re-Ranking for Efficient Document Search with BERT
Although considerable efforts have been devoted to transformer-based ranking models for document search, the relevance-efficiency tradeoff remains a critical problem for ad-hoc ranking. To overcome this challenge, this p…
Re-RankingMarlRank: Multi-agent Reinforced Learning to Rank
When estimating the relevancy between a query and a document, ranking models largely neglect the mutual information among documents. A common wisdom is that if two documents are similar in terms of the same query, they a…
Document RankingLearning-To-RankReBOL: Retrieval via Bayesian Optimization with Batched LLM Relevance Observations and Query Reformulation
LLM-reranking is limited by the top-k documents retrieved by vector similarity, which neither enables contextual query-document token interactions nor captures multimodal relevance distributions. While LLM query reformul…
Co-BERT: A Context-Aware BERT Retrieval Model Incorporating Local and Query-specific Context
BERT-based text ranking models have dramatically advanced the state-of-the-art in ad-hoc retrieval, wherein most models tend to consider individual query-document pairs independently. In the mean time, the importance and…
Learning-To-RankRe-RankingRetrievalE2Rank: Unifying Text Embedding and Listwise Reranking for Effective and Efficient Search
Text embedding models deliver competitive retrieval performance with high efficiency, but their ranking fidelity remains limited compared to LLM-based listwise rerankers, which capture fine-grained query-document and doc…
Computational Efficiency