Optimizing Multi-Hop Document Retrieval Through Intermediate Representations

Jiaen Lin, Jingyu Liu, Yingbo Liu
3/2/2025
cs.CLcs.AIcs.IR

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

Retrieval-augmented generation (RAG) encounters challenges when addressing complex queries, particularly multi-hop questions. While several methods tackle multi-hop queries by iteratively generating internal queries and retrieving external documents, these approaches are computationally expensive. In this paper, we identify a three-stage information processing pattern in LLMs during layer-by-layer reasoning, consisting of extraction, processing, and subsequent extraction steps. This observation suggests that the representations in intermediate layers contain richer information compared to those in other layers. Building on this insight, we propose Layer-wise RAG (L-RAG). Unlike prior methods that focus on generating new internal queries, L-RAG leverages intermediate representations from the middle layers, which capture next-hop information, to retrieve external knowledge. L-RAG achieves performance comparable to multi-step approaches while maintaining inference overhead similar to that of standard RAG. Experimental results show that L-RAG outperforms existing RAG methods on open-domain multi-hop question-answering datasets, including MuSiQue, HotpotQA, and 2WikiMultiHopQA. The code is available in https://github.com/Olive-2019/L-RAG

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lin2025optimizing,
  title  = {Optimizing Multi-Hop Document Retrieval Through Intermediate Representations},
  author = {Jiaen Lin and Jingyu Liu and Yingbo Liu},
  year   = {2025},
  eprint = {2503.04796},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2503.04796v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2503.04796.svg)](https://codeofpaper.com/paper/2503.04796)

Discussion