Metraipolis › archive › dc_0d6728584cd7
A Matryoshka Hierarchical RAG for Efficient Multi-Hop Question Answering — arXiv:2610.01767
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.01767
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T13:56:02.871Z
- SHA-256 of the archived text
48ba7db9bf0722161f97f0b7311c132facd5bbcc8a1c74e61d88929a28b9c274- Stable URL of this page
https://metraipolis.com/documento/dc_0d6728584cd7
How to cite
A Matryoshka Hierarchical RAG for Efficient Multi-Hop Question Answering — arXiv:2610.01767 — arXiv (en), https://arxiv.org/abs/2610.01767 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0d6728584cd7 (Metraipolis archive dc_0d6728584cd7, sha256 48ba7db9bf0722161f97f0b7311c132facd5bbcc8a1c74e61d88929a28b9c274)
BibTeX
@misc{dc0d6728584cd7,
title = {A Matryoshka Hierarchical RAG for Efficient Multi-Hop Question Answering — arXiv:2610.01767},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.01767},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0d6728584cd7; sha256 48ba7db9bf0722161f97f0b7311c132facd5bbcc8a1c74e61d88929a28b9c274},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.01767. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Retrieval-Augmented Generation (RAG) systems for multi-hop Question Answering (QA) must balance retrieval quality with computational cost. This cost is incurred during indexing time, through the use of expensive Knowledge Graphs (KGs) or Large Language Models (LLMs) to generate summaries, or during querying, through iterative LLM-driven retrieval. To reduce it while maintaining retrieval quality, we present MatRAG, a hierarchical framework that combines RAG systems with Matryoshka Representation Learning (MRL). MatRAG addresses both kinds of cost by aligning the semantic hierarchy of a clustering structure with the nested structure of MRL. Specifically, it organizes the corpus of documents into a Directed Acyclic Graph (DAG) of clusters with progressively coarser granularity. Each level is indexed by a lower Matryoshka dimension. MatRAG pairs an iterative, top-down traversal of the DAG with an entity-driven mechanism that controls the hop budget and re-ranks candidates. We evaluated MatRAG on three standard multi-hop QA benchmarks against seven representative baselines. MatRAG outperforms its strongest competitors in terms of retrieval quality; furthermore, it reduces indexing costs by avoiding KG construction and LLM-based summarization, and lowers query-time costs through dimension-aware similarity. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-10-02 in cs.CL). Categorie arXiv: Computation and Language (cs.CL) ; Information Retrieval (cs.IR). Pagina del lavoro: https://arxiv.org/abs/2610.01767 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-06T12:15:34.746Z dalla pagina https://arxiv.org/catchup/cs.CL/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).