Papers
arxiv:2610.29722

Retrieval Augmented Generation Compositionality

Published on Oct 21
ยท Submitted by
Ido Levy
on Oct 22
ยท ibm IBM
Authors:
,

Abstract

LASAGNA evaluates composed RAG pipelines across scales and finds that isolated technique gains do not reliably predict combined retrieval quality, faithfulness, or large-corpus performance.

Retrieval Augmented Generation (RAG) grounds large language models in external knowledge. Modern pipelines combine embedding, chunking, retrieval, reranking, query augmentation, context compression, and agentic verification, yet these techniques are typically evaluated one at a time. It remains unclear whether their isolated gains survive composition, whether retrieval quality and answer faithfulness favor the same design choices, and whether conclusions from small corpora hold at large scale. We pre-declare three hypotheses and introduce LASAGNA, an open-source framework for controlled RAG evaluation. We test 450 configurations across eight benchmarks and corpora ranging from 5K to 200K documents. Three findings emerge. First, individually strong techniques from different phases of a RAG pipeline do not necessarily compose: three retrieval techniques predict a +47% combined improvement but deliver only +17% when used together. Second, component gains stack differently for retrieval and faithfulness, and optimizing one can hurt the other. Third, the best composition changes as the corpus grows: the combination that wins on a small corpus may not remain best at large scale. These findings show that gains measured in isolation are not reliable predictors of realistic performance, and that new RAG techniques should be tested with the full surrounding stack. We call on researchers to do so and supply LASAGNA to simplify these experiments.

Community

Paper author Paper submitter

First author here. The question behind the paper: RAG techniques are usually tested one at a time. Do their gains hold when you use them together?

We pre-declared three hypotheses and ran 450 configurations across eight benchmarks, on corpora from 5K to 200K documents.

  1. Retrieval gains shrink when combined. Three retrieval techniques predict +47% NDCG@10 together and deliver +17%. Across 17 combinations the shortfall ranges from 7% to 72%, median 41%.
  2. Faithfulness gains combine nearly additively (+28% predicted, +32% realized). Retrieval quality and faithfulness depend on different stages, so tuning for one can hurt the other.
  3. Scale changes the winner. The design that leads on small corpora trails by 13.7% NDCG@10 at 200K, with the rank flip visible from 25K.

Not settled: our pre-declared H1 test was not met; the interaction it flagged is real but small. All results use one English test bed and proprietary generators.

Lasagna, the framework, is open source: eight swappable stages, pip install lasagna-rag. Register a technique with one decorator and test it inside the full pipeline, with paired sign-flip tests.

Code: https://github.com/dolev31/lasagna
Page: https://dolev31.github.io/lasagna/

Which combination should we test next?

Sign up or log in to comment

Get this paper in your agent:

hf papers read 2610.29722
Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash

Models citing this paper 0

No model linking this paper

Cite arxiv.org/abs/2610.29722 in a model README.md to link it from this page.

Datasets citing this paper 0

No dataset linking this paper

Cite arxiv.org/abs/2610.29722 in a dataset README.md to link it from this page.

Spaces citing this paper 0

No Space linking this paper

Cite arxiv.org/abs/2610.29722 in a Space README.md to link it from this page.

Collections including this paper 0

No Collection including this paper

Add this paper to a collection to link it from this page.