Score breakdown

Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks

paper-0125 · paper · 2020

Patrick Lewis et al.

RAG; grounding generation in retrieved evidence.

Abstract

Large pre-trained language models have been shown to store factual knowledge in their parameters, and achieve state-of-the-art results when fine-tuned on downstream NLP tasks. However, their ability to access and precisely manipulate knowledge is still limited, and hence on knowledge-intensive tasks, their performance lags behind task-specific architectures. Additionally, providing provenance for their decisions and updating their world knowledge remain open research problems. Pre-trained models with a differentiable access mechanism to explicit non-parametric memory can overcome this issue, but have so far been only investigated for extractive downstream tasks. We explore a general-purpose fine-tuning recipe for retrieval-augmented generation (RAG) -- models which combine pre-trained parametric and non-parametric memory for language generation. We introduce RAG models where the parametric memory is a pre-trained seq2seq model and the non-parametric memory is a dense vector index of Wikipedia, accessed with a pre-trained neural retriever. We compare two RAG formulations, one which conditions on the same retrieved passages across the whole generated sequence, the other can use different passages per token. We fine-tune and evaluate our models on a wide range of knowledge-intensive NLP tasks and set the state-of-the-art on three open domain QA tasks, outperforming parametric seq2seq models and task-specific retrieve-and-extract architectures. For language generation tasks, we find that RAG models generate more specific, diverse and factual language than a state-of-the-art parametric-only seq2seq baseline. [OpenAlex]

Academic, score -0.2214

MetricStatusValueNorm.WeightContributionSourceConfidenceLicenseProvenance
citation_countpresent18.07.7e-050.53.8e-05OpenAlexhighOpenAlex, CC0 metadatalink
library_holdingsmissingrecorded as missing, penalized by rule, never imputed−0.1recorded as missing; penalized by rule, never imputed
readership_persistencepresent2.00.0714290.050.003571OpenAlexmediumOpenAlex, CC0 metadatalink
syllabus_adoptionsmissingrecorded as missing, penalized by rule, never imputed−0.125recorded as missing; penalized by rule, never imputed

Broad Influence, score -0.1714

MetricStatusValueNorm.WeightContributionSourceConfidenceLicenseProvenance
citation_countpresent18.07.7e-050.21.5e-05OpenAlexhighOpenAlex, CC0 metadatalink
library_holdingsmissingrecorded as missing, penalized by rule, never imputed−0.125recorded as missing; penalized by rule, never imputed
readership_persistencepresent2.00.0714290.40.028571OpenAlexmediumOpenAlex, CC0 metadatalink
syllabus_adoptionsmissingrecorded as missing, penalized by rule, never imputed−0.075recorded as missing; penalized by rule, never imputed

Governance Practitioner, score -0.3178

MetricStatusValueNorm.WeightContributionSourceConfidenceLicenseProvenance
citation_countpresent18.07.7e-050.251.9e-05OpenAlexhighOpenAlex, CC0 metadatalink
library_holdingsmissingrecorded as missing, penalized by rule, never imputed−0.15recorded as missing; penalized by rule, never imputed
readership_persistencepresent2.00.0714290.10.007143OpenAlexmediumOpenAlex, CC0 metadatalink
syllabus_adoptionsmissingrecorded as missing, penalized by rule, never imputed−0.175recorded as missing; penalized by rule, never imputed

A rank is not a verdict on intrinsic worth. It is a transparent output of declared evidence, weights, and missing-data rules at a specific release date.

Disagree with this rank or a number? Challenge it with your evidence. Every challenge gets a public identifier and a published resolution.