paper-with-me

홈 › Papers

DocReRank: Single-Page Hard Negative Query Generation for Training Multi-Modal RAG Rerankers

2025-05-28 · Navve Wasserman, Oliver Heinimann, Yuval Golbari, Tal Zimbalist, Eli Schwartz, Michal Irani

Rerankers play a critical role in multimodal Retrieval-Augmented Generation (RAG) by refining ranking of an initial set of retrieved documents. Rerankers are typically trained using hard negative mining, whose goal is to select pages for each query which rank high, but are actually irrelevant. However, this selection process is typically passive and restricted to what the retriever can find in the available corpus, leading to several inherent limitations. These include: limited diversity, negative examples which are often not hard enough, low controllability, and frequent false negatives which harm training. Our paper proposes an alternative approach: Single-Page Hard Negative Query Generation, which goes the other way around. Instead of retrieving negative pages per query, we generate hard negative queries per page. Using an automated LLM-VLM pipeline, and given a page and its positive query, we create hard negatives by rephrasing the query to be as similar as possible in form and context, yet not answerable from the page. This paradigm enables fine-grained control over the generated queries, resulting in diverse, hard, and targeted negatives. It also supports efficient false negative verification. Our experiments show that rerankers trained with data generated using our approach outperform existing models and significantly improve retrieval performance.

📄 PDF Abstract BibTeX arXiv:2505.22584

Code (0)

등록된 구현이 없습니다.

Tasks

RAGRetrievalRetrieval-augmented Generation

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

TinyServe: Query-Aware Cache Selection for Efficient LLM Serving

2025-08-28 · Dong Liu, Yanxuan Yu arxiv

Serving large language models (LLMs) efficiently remains challenging due to the high memory and latency overhead of key-value (KV) cache access during autoregressive decoding. We present \textbf{TinyServe}, a lightweight…

WebFAQ 2.0: A Multilingual QA Dataset with Mined Hard Negatives for Dense Retrieval

2026-02-19 · Michael Dinzinger, Laura Caspari, Ali Salman, Irvin Topi 외 arxiv

We introduce WebFAQ 2.0, a new version of the WebFAQ dataset, containing 198 million FAQ-based natural question-answer pairs across 108 languages. Compared to the previous version, it significantly expands multilingual c…

Knowledge DistillationContrastive Learning

Are all negatives created equal in contrastive instance discrimination?

2020-10-13 · Tiffany Tianhui Cai, Jonathan Frankle, David J. Schwab, Ari S. Morcos

Self-supervised learning has recently begun to rival supervised learning on computer vision tasks. Many of the recent approaches have been based on contrastive instance discrimination (CID), in which the network is train…

Allimage-classificationImage ClassificationSelf-Supervised Learning

Don't Retrieve, Generate: Prompting LLMs for Synthetic Training Data in Dense Retrieval

2025-04-20 · Aarush Sinha

Training effective dense retrieval models often relies on hard negative (HN) examples mined from the document corpus via methods like BM25 or cross-encoders (CE), processes that can be computationally demanding and requi…

Large Language ModelRetrieval

One-Bit Active Query With Contrastive Pairs

2022-01-01 · CVPR 2022 1 · Yuhang Zhang, Xiaopeng Zhang, Lingxi Xie, Jie Li 외

How to achieve better results with fewer labeling costs remains a challenging task. In this paper, we present a new active learning framework, which for the first time incorporates contrastive learning into recently …

Active LearningContrastive Learning