Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.08825 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916071131316224 |
|---|---|
| author | Sun, Jia Ao Yu, Hao Gotti, Fabrizio Mo, Fengran Wu, Yihong Hui, Yuchen Su, Zhan Xiao, Lingfeng Nie, Jian-Yun |
| author_facet | Sun, Jia Ao Yu, Hao Gotti, Fabrizio Mo, Fengran Wu, Yihong Hui, Yuchen Su, Zhan Xiao, Lingfeng Nie, Jian-Yun |
| contents | Large language models (LLMs) augmented with knowledge graphs (KGs) offer a promising approach for knowledge-intensive reasoning. Central to this approach is the selection of appropriate reasoning paths in the KG. Yet, existing methods face a common limitation: reasoning path selection is often performed by separate modules using criteria that are only weakly connected to the reasoning requirements. This often results in selecting incorrect relations or premature pruning of relevant paths. We propose Search-on-Graph (SoG), a method that strengthens the connection between path selection and reasoning by having the LLM itself select which relations to follow, informed by both the available KG structure and the complete reasoning history. SoG follows an \textit{observe-think-navigate} paradigm: at each step, the LLM observes the relational connections available at the current entity, reasons about which path best advances toward answering the question, and navigates accordingly. This context-aware navigation fully exploits the LLM's reasoning capabilities rather than relying on independent selection modules with surrogate criteria. Experiments on six knowledge graph question answering (KGQA) benchmarks demonstrate that SoG outperforms state-of-the-art methods while requiring no task-specific fine-tuning and generalizing across different KG schemas. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_08825 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Search-on-Graph: Iterative Informed Navigation for Large Language Model Reasoning on Knowledge Graphs Sun, Jia Ao Yu, Hao Gotti, Fabrizio Mo, Fengran Wu, Yihong Hui, Yuchen Su, Zhan Xiao, Lingfeng Nie, Jian-Yun Computation and Language Large language models (LLMs) augmented with knowledge graphs (KGs) offer a promising approach for knowledge-intensive reasoning. Central to this approach is the selection of appropriate reasoning paths in the KG. Yet, existing methods face a common limitation: reasoning path selection is often performed by separate modules using criteria that are only weakly connected to the reasoning requirements. This often results in selecting incorrect relations or premature pruning of relevant paths. We propose Search-on-Graph (SoG), a method that strengthens the connection between path selection and reasoning by having the LLM itself select which relations to follow, informed by both the available KG structure and the complete reasoning history. SoG follows an \textit{observe-think-navigate} paradigm: at each step, the LLM observes the relational connections available at the current entity, reasons about which path best advances toward answering the question, and navigates accordingly. This context-aware navigation fully exploits the LLM's reasoning capabilities rather than relying on independent selection modules with surrogate criteria. Experiments on six knowledge graph question answering (KGQA) benchmarks demonstrate that SoG outperforms state-of-the-art methods while requiring no task-specific fine-tuning and generalizing across different KG schemas. |
| title | Search-on-Graph: Iterative Informed Navigation for Large Language Model Reasoning on Knowledge Graphs |
| topic | Computation and Language |
| url | https://arxiv.org/abs/2510.08825 |