paper-with-me

홈 › Papers

RankRAG: Unifying Context Ranking with Retrieval-Augmented Generation in LLMs

2024-07-02 · Yue Yu, Wei Ping, Zihan Liu, Boxin Wang, Jiaxuan You, Chao Zhang, Mohammad Shoeybi, Bryan Catanzaro

Large language models (LLMs) typically utilize the top-k contexts from a retriever in retrieval-augmented generation (RAG). In this work, we propose a novel instruction fine-tuning framework RankRAG, which instruction-tunes a single LLM for the dual purpose of context ranking and answer generation in RAG. In particular, the instruction-tuned LLMs work surprisingly well by adding a small fraction of ranking data into the training blend, and outperform existing expert ranking models, including the same LLM exclusively fine-tuned on a large amount of ranking data. For generation, we compare our model with many strong baselines, including GPT-4-0613, GPT-4-turbo-2024-0409, and ChatQA-1.5, an open-sourced model with the state-of-the-art performance on RAG benchmarks. Specifically, our Llama3-RankRAG significantly outperforms Llama3-ChatQA-1.5 and GPT-4 models on nine knowledge-intensive benchmarks. In addition, it also performs comparably to GPT-4 on five RAG benchmarks in the biomedical domain without instruction fine-tuning on biomedical data, demonstrating its superb capability for generalization to new domains.

📄 PDF Abstract BibTeX arXiv:2407.02485

Code (0)

등록된 구현이 없습니다.

Tasks

Answer GenerationQuestion AnsweringRAGRetrievalRetrieval-augmented Generation

Methods 이 논문이 사용한 방법론

Refunds@Expedia|||How do I get a full refund from Expedia? “How do I get a full refund from Expedia? How do I get a full refund from Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Quick Help &…
Attention 설명 없음
Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Weight Decay 설명 없음
Multi-Head Attention 설명 없음
WordPiece 설명 없음
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$…
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…

Similar Papers 제목 키워드 기반

Provence: efficient and robust context pruning for retrieval-augmented generation

2025-01-27 · Nadezhda Chirkova, Thibault Formal, Vassilina Nikoulina, Stéphane Clinchant

Retrieval-augmented generation improves various aspects of large language models (LLMs) generation, but suffers from computational overhead caused by long contexts as well as the propagation of irrelevant retrieved infor…

Question AnsweringRAGRerankingRetrieval+1

RaCoT: Plug-and-Play Contrastive Example Generation Mechanism for Enhanced LLM Reasoning Reliability

2025-10-26 · Kaitong Cai, Jusheng Zhang, Yijia Fan, Jing Yang 외 arxiv

Retrieval-Augmented Generation (RAG) faces a core bottleneck with knowledge-sparse and semantically ambiguous long-tail queries, where retrieval noise distorts reasoning and necessitates costly post-processing. To tackle…

Roles of MLLMs in Visually Rich Document Retrieval for RAG: A Survey

2025-12-16 · Xiantao Zhang arxiv

Visually rich documents (VRDs) challenge retrieval-augmented generation (RAG) with layout-dependent semantics, brittle OCR, and evidence spread across complex figures and structured tables. This survey examines how Multi…

List-aware Reranking-Truncation Joint Model for Search and Retrieval-augmented Generation

2024-02-05 · Shicheng Xu, Liang Pang, Jun Xu, HuaWei Shen 외

The results of information retrieval (IR) are usually presented in the form of a ranked list of candidate documents, such as web search for humans and retrieval-augmented generation for large language models (LLMs). List…

Information RetrievalLearning-To-RankMisinformationReranking+2

Long Context Modeling with Ranked Memory-Augmented Retrieval

2025-03-19 · Ghadir Alselwi, Hao Xue, Shoaib Jameel, Basem Suleiman 외

Effective long-term memory management is crucial for language models handling extended contexts. We introduce a novel framework that dynamically ranks memory entries based on relevance. Unlike previous works, our model i…

Information RetrievalLearning-To-RankManagementRe-Ranking+1