Metraipolis › archive › dc_2163f12db39f

Efficient LLM-based Subgraph Retrieval for Multi-Hop Knowledge Base Question Answering — arXiv:2610.39667

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.39667
License (as archived)
CC0-1.0
Archived
2026-11-01T02:40:00.342Z
SHA-256 of the archived text
588b79bd31949f2523e5033f984987943f9613e31527deea54fdfbca90aea4ed
Stable URL of this page
https://metraipolis.com/documento/dc_2163f12db39f

How to cite

Efficient LLM-based Subgraph Retrieval for Multi-Hop Knowledge Base Question Answering — arXiv:2610.39667 — arXiv (en), https://arxiv.org/abs/2610.39667 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2163f12db39f (Metraipolis archive dc_2163f12db39f, sha256 588b79bd31949f2523e5033f984987943f9613e31527deea54fdfbca90aea4ed)
BibTeX
@misc{dc2163f12db39f,
  title = {Efficient LLM-based Subgraph Retrieval for Multi-Hop Knowledge Base Question Answering — arXiv:2610.39667},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.39667},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2163f12db39f; sha256 588b79bd31949f2523e5033f984987943f9613e31527deea54fdfbca90aea4ed},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.39667. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Multi-hop Knowledge Base Question Answering (KBQA) aims to find answer entities in the knowledge base that are multiple hops away from the entities in the question. Information retrieval-based (IR-based) methods extract a pivotal subgraph from the entire KB to locate candidate answers and then evaluate their plausibility through semantic matching with the question. However, we observed that the extracted subgraphs often include nodes that are weakly related or irrelevant to the question. Without a proper node filtering mechanism, the number of irrelevant nodes grows as the number of hops increases, leading to excessive consumption of computational resources. To address these challenges, this study introduces an efficient LLM-based subgraph retrieval method for multi-hop knowledge base question answering, M-ER. The framework leverages Monte Carlo Tree Search (MCTS) to transform subgraph exploration into a tree-structured search process. During the MCTS selection phase, nodes that are highly relevant to the question are prioritized for inclusion in the subgraph, eliminating the need to traverse all nodes in the KB. The framework further incorporates a large language model (LLM) to refine the search direction, ensuring that exploration remains focused on nodes relevant to the question. In addition, selected nodes are quantitatively scored, and these scores are fed back into the node selection process to effectively filter out irrelevant candidates, thereby improving the quality of the subgraph. This mechanism not only narrows the search space but also enhances the overall efficiency of multi-hop KBQA. Experiments on the WebQSP benchmark demonstrate that M-ER achieves 78.88\% on the Hits@1 metric, while also improving computational efficiency. These results not only validate the effectiveness of M-ER, but also offer a viable technical path to balance performance and computational efficiency.

Tema degli esploratori: statistica e scienza dei dati (elenco arXiv cs.IR, nuovi lavori del giorno).
Categorie arXiv: Information Retrieval (cs.IR).
Pagina del lavoro: https://arxiv.org/abs/2610.39667 — 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-11-01T02:16:28.228Z dalla pagina https://arxiv.org/list/cs.IR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).