Autonomous Knowledge Graph Exploration with Adaptive Breadth-Depth Retrieval (2026.acl-long)
Copied to clipboard
Joaquin Polonuer, Lucas Vittor, Iñaki Arango, Ayush Noori, David A. Clifton, Luciano Del Corro, Marinka Zitnik
| Challenge: | ARK: Adaptive Retriever of Knowledge is a tool-using KG retriever that allows a language model to control breadth-depth tradeoffs without requiring a fragile seed selection or pre-set hop depth. |
| Approach: | They propose a tool-using KG retriever that gives a language model control over breadth-depth tradeoff using global lexical search over node descriptors and one-hop neighborhood exploration that composes into multi-hop traversal. |
| Outcome: | The proposed model improves on a teacher's dataset by +7.0, +26.6, and +13.5% while retaining 98.5% of the teacher' s Hit@1 rate. |
Similar Papers
GRIL: Knowledge Graph Retrieval-Integrated Learning with Large Language Models (2025.findings-emnlp)
Copied to clipboard
Jialin Chen, Houyu Zhang, Seongjun Yun, Alejandro Mottini, Rex Ying, Xiang Song, Vassilis N. Ioannidis, Zheng Li, Qingjun Cui
| Challenge: | Existing graph RAGs decouple retrieval and reasoning processes, preventing adaptability . existing graph Raggings depend heavily on ground-truth entities, which are often unavailable in open-domain settings. |
| Approach: | They propose a graph retriever that is trained end-to-end with large-scale graphs . structure and semantic features are encoded via soft tokens and the verbalized graph . |
| Outcome: | The proposed approach improves the performance of large-scale graph retrieval models by grounding it with external knowledge. |
Chain-of-Relations: Faithful and Efficient LLM Reasoning over Knowledge Graphs via Relation-Centric Exploration (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods adopt entity-centric exploration that incrementally constructs reasoning paths by selecting and connecting intermediate entities. |
| Approach: | They propose to use relation-centric exploration to construct reasoning paths by selecting and connecting intermediate entities and to reduce the dependence on entity completeness. |
| Outcome: | The proposed method outperforms baselines on three benchmark datasets in both F1 score and KG-grounded Rate. |
Semantic Exploration with Adaptive Gating for Efficient Problem Solving with Language Models (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for multi-step reasoning suffer from inefficiency and redundancy . existing methods neglect the diversity of task difficulties leading to extensive searches even for easy tasks . |
| Approach: | They propose a method that explores reasoning paths with a gating mechanism that decides whether to conduct a tree search based on the confidence level of answers from a previous simple reasoning method. |
| Outcome: | The proposed method significantly improves accuracy by 4.3% on average while requiring only 31% of computational costs. |
KG-Adapter: Enabling Knowledge Graph Integration in Large Language Models through Parameter-Efficient Fine-Tuning (2024.findings-acl)
Copied to clipboard
| Challenge: | Large language models (LLMs) are criticized for lack of expertise and knowledge conflict . KG-Adapter is a parameter-level KG integration method for decoder-only LLMs . |
| Approach: | They propose a parameter-level KG integration method based on parameter-efficient fine-tuning . they use KG-Adapter to integrate knowledge graphs with LLMs and perform joint reasoning . |
| Outcome: | The proposed method outperforms the current state-of-the-art method on four datasets for two different tasks. |
The Role of Exploration Modules in Small Language Models for Knowledge Graph Question Answering (2025.acl-srw)
Copied to clipboard
| Challenge: | Existing methods to integrate knowledge graphs into large language models often rely on proprietary or extremely large models . |
| Approach: | They propose to integrate knowledge graphs into reasoning processes of large language models . they propose to use simple and efficient exploration modules to handle knowledge graph traversal . |
| Outcome: | The proposed modules improve the performance of small language models on knowledge graph question answering tasks. |
Knowledge-Aware Query Expansion with Large Language Models for Textual and Relational Retrieval (2025.naacl-long)
Copied to clipboard
| Challenge: | Existing methods to generate query expansions focus on enhancing textual similarities between search queries and document corpus, overlooking document relations. |
| Approach: | They propose a knowledge-aware query expansion framework augmenting LLMs with structured document relations from knowledge graph (KG) they leverage document texts as rich KG node representations and use document-based relation filtering for their method. |
| Outcome: | The proposed framework augments LLMs with structured document relations from knowledge graph (KG) Extensive experiments on three datasets of diverse domains show the advantages compared against state-of-the-art methods on textual and relational semi-structured retrieval. |
Tree-KG: An Expandable Knowledge Graph Construction Framework for Knowledge-intensive Domains (2025.acl-long)
Copied to clipboard
| Challenge: | Knowledge graphs are a useful tool for organizing complex data in knowledge-intensive domains. |
| Approach: | They propose an expandable framework that combines structured domain texts with advanced semantic techniques to create a tree-like graph from textbooks. |
| Outcome: | The proposed framework surpasses competing methods in the text-Annotated dataset with high scores on the Text-Annalytated data. |
DIVKNOWQA: Assessing the Reasoning Ability of LLMs via Open-Domain Question Answering over Knowledge Base and Text (2024.findings-naacl)
Copied to clipboard
| Challenge: | Retrievalaugmented LLMs have been used to ground LLM in external knowledge . a gap exists in the current landscape regarding the effectiveness of grounding LLM on heterogeneous knowledge sources. |
| Approach: | They propose a model that uses symbolic language to generate symbolic queries . they use a dataset that is generated using predefined reasoning chains and human annotation . |
| Outcome: | The proposed model outperforms previous approaches by a significant margin in QA tasks over text. |
Thought-Action Graph Reasoning: Faithful and Efficient Reasoning of Large Language Models via Reusing Past Experience (2026.findings-acl)
Copied to clipboard
Zhixiao Qi, Feng Huang, Yunqi Zhang, Shijie Zhang, Qingqing Sun, Yongfeng Huang, Minghu Jiang, Shuai Chen, Tianyi Zhang
| Challenge: | Existing methods for integrating knowledge graphs with LLMs suffer from poor generalization or low reasoning efficiency. |
| Approach: | They propose a thought-action Graph (TAG) that decomposes LLM-KG interaction trajectories into fine-grained semantic operators and guides LLM to execute on them. |
| Outcome: | The proposed paradigm outperforms state-of-the-art methods on KGQA benchmarks while reducing the number of LLM calls and generated tokens. |
Fact Finder - Enhancing Domain Expertise of Large Language Models by Incorporating Knowledge Graphs (2026.eacl-demo)
Copied to clipboard
Daniel Steinigen, Roman Teucher, Timm Heine Ruland, Max Rudat, Nicolas Flores-Herr, Peter Fischer, Nikola Milosevic, Christopher Schymura, Angelo Ziletti
| Challenge: | Recent advances in Large Language Models have demonstrated their proficiency in answering natural language queries. |
| Approach: | They propose a system that augments Large Language Models with domain-specific knowledge graphs . they evaluate a medical KG and use a KG-based retrieval approach to enhance factual correctness . |
| Outcome: | The proposed system surpasses a standalone LLM in accuracy and completeness on a medical KG dataset. |