paper-with-me

홈 › Papers

Understanding Performance of Long-Document Ranking Models through Comprehensive Evaluation and Leaderboarding

2022-07-04 · Leonid Boytsov, David Akinpelu, Tianyi Lin, Fangwei Gao, Yutian Zhao, Jeffrey Huang, Nipun Katyal, Eric Nyberg

We evaluated 20+ Transformer models for ranking of long documents (including recent LongP models trained with FlashAttention) and compared them with a simple FirstP baseline, which applies the same model to the truncated input (at most 512 tokens). We used MS MARCO Documents v1 as a primary training set and evaluated both the zero-shot transferred and fine-tuned models. On MS MARCO, TREC DLs, and Robust04 no long-document model outperformed FirstP by more than 5% in NDCG and MRR (when averaged over all test sets). We conjectured this was not due to models' inability to process long context, but due to a positional bias of relevant passages, whose distribution was skewed towards the beginning of documents. We found direct evidence of this bias in some test sets, which motivated us to create MS MARCO FarRelevant (based on MS MARCO Passages) where the relevant passages were not present among the first 512 tokens. Unlike standard collections where we saw both little benefit from incorporating longer contexts and limited variability in model performance (within a few %), experiments on MS MARCO FarRelevant uncovered dramatic differences among models. The FirstP models performed roughly at the random-baseline level in both zero-shot and fine-tuning scenarios. Simple aggregation models including MaxP and PARADE Attention had good zero-shot accuracy, but benefited little from fine-tuning. Most other models had poor zero-shot performance (sometimes at a random baseline level), but outstripped MaxP by as much as 13-28% after fine-tuning. Thus, the positional bias not only diminishes benefits of processing longer document contexts, but also leads to model overfitting to positional bias and performing poorly in a zero-shot setting when the distribution of relevant passages changes substantially. We make our software and data available.

📄 PDF Abstract BibTeX arXiv:2207.01262

Code (3)

searchivarius/long_doc_rank_model_analysis 공식 구현
oaqa/FlexNeuART pytorch
oaqa/knn4qa pytorch

Tasks

BenchmarkingDocument Ranking

Methods 이 논문이 사용한 방법론

Attention 설명 없음
Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Multi-Head Attention 설명 없음
Residual Connection 설명 없음
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
BPE Byte Pair Encoding, or BPE, is a subword segmentation algorithm that encodes rare and unknown words as sequences of subword units. The intuition is that various word…
Absolute Position Encodings Absolute Position Encodings are a type of position embeddings for [Transformer-based models] where positional encodings are…

Similar Papers 제목 키워드 기반

RRADistill: Distilling LLMs' Passage Ranking Ability for Long-Tail Queries Document Re-Ranking on a Search Engine

2024-10-08 · Nayoung Choi, Youngjune Lee, Gyu-Hwung Cho, Haeyu Jeong 외

Large Language Models (LLMs) excel at understanding the semantic relationships between queries and documents, even with lengthy and complex long-tail queries. These queries are challenging for feedback-based rankings due…

DecoderPassage RankingRe-Ranking

Passage Query Methods for Retrieval and Reranking in Conversational Agents

2025-02-28 · Victor De Lima. Grace Hui Yang

This paper presents our approach to the TREC Interactive Knowledge Assistance Track (iKAT), which focuses on improving conversational information-seeking (CIS) systems. While recent advancements in CIS have improved conv…

Passage RankingRerankingRetrieval

Longformer for MS MARCO Document Re-ranking Task

2020-09-20 · Ivan Sekulić, Amir Soleimani, Mohammad Aliannejadi, Fabio Crestani

Two step document ranking, where the initial retrieval is done by a classical information retrieval method, followed by neural re-ranking model, is the new standard. The best performance is achieved by using transformer-…

Document RankingInformation RetrievalRe-RankingRetrieval

Efficient Zero-Shot Long Document Classification by Reducing Context Through Sentence Ranking

2025-08-24 · Prathamesh Kokate, Mitali Sarnaik, Manavi Khopade, Mukta Takalikar 외 arxiv

Transformer-based models like BERT excel at short text classification but struggle with long document classification (LDC) due to input length limitations and computational inefficiencies. In this work, we propose an eff…

Document ClassificationText Classification

Graph Neural Re-Ranking via Corpus Graph

2024-06-17 · Andrea Giuseppe Di Francesco, Christian Giannetti, Nicola Tonellotto, Fabrizio Silvestri

Re-ranking systems aim to reorder an initial list of documents to satisfy better the information needs associated with a user-provided query. Modern re-rankers predominantly rely on neural network models, which have prov…

Re-Ranking