Graph Agent: Explicit Reasoning Agent for Graphs

2023-10-25 · Qinyong Wang, Zhenxiang Gao, Rong Xu

Graph embedding methods such as Graph Neural Networks (GNNs) and Graph Transformers have contributed to the development of graph reasoning algorithms for various tasks on knowledge graphs. However, the lack of interpretability and explainability of graph embedding methods has limited their applicability in scenarios requiring explicit reasoning. In this paper, we introduce the Graph Agent (GA), an intelligent agent methodology of leveraging large language models (LLMs), inductive-deductive reasoning modules, and long-term memory for knowledge graph reasoning tasks. GA integrates aspects of symbolic reasoning and existing graph embedding methods to provide an innovative approach for complex graph reasoning tasks. By converting graph structures into textual data, GA enables LLMs to process, reason, and provide predictions alongside human-interpretable explanations. The effectiveness of the GA was evaluated on node classification and link prediction tasks. Results showed that GA reached state-of-the-art performance, demonstrating accuracy of 90.65%, 95.48%, and 89.32% on Cora, PubMed, and PrimeKG datasets, respectively. Compared to existing GNN and transformer models, GA offered advantages of explicit reasoning ability, free-of-training, easy adaption to various graph reasoning tasks

📄 PDF Abstract BibTeX arXiv:2310.16421

Code (0)

등록된 구현이 없습니다.

Tasks

Graph Embedding Knowledge Graphs Link Prediction Node Classification

Methods 이 논문이 사용한 방법론

GA Genetic Algorithms are search algorithms that mimic Darwinian biological evolution in order to select and propagate better solutions.

Scalable and Accurate Graph Reasoning with LLM-based Multi-Agents

2024-10-07 · Yuwei Hu, Runlin Lei, Xinyi Huang, Zhewei Wei 외

Recent research has explored the use of Large Language Models (LLMs) for tackling complex graph reasoning tasks. However, due to the intricacies of graph structures and the inherent limitations of LLMs in handling long t…

SMAGDi: Socratic Multi Agent Interaction Graph Distillation for Efficient High Accuracy Reasoning

2025-10-29 · Aayush Aluru, Myra Malik, Samarth Patankar, Spencer Kim 외 arxiv

Multi-agent systems (MAS) often achieve higher reasoning accuracy than single models, but their reliance on repeated debates across agents makes them computationally expensive. We introduce SMAGDi, a distillation framewo…

HypoAgent: An Agentic Framework for Interactive Abductive Hypothesis Generation over Knowledge Graphs

2026-05-29 · Yisen Gao, Yixi Cai, Tianshi Zheng, Jiaxin Bai 외 arxiv

Abductive reasoning over knowledge graphs aims to generate logical hypotheses that explain observed entities or facts. Existing controllable hypothesis generation methods allow users to guide this process with explicit c…

AdaSTORM: Scaling LLM Reasoning on Dynamic Graphs via Adaptive Spatio-Temporal Multi-Agent Collaboration

2026-06-15 · Bing Hao, Ruijie Wang, Haodong Qian, Yunlong Chu 외 arxiv

Large Language Models (LLMs) demonstrate remarkable potential in dynamic graph reasoning, but suffer from a scaling bottleneck: current models can only handle graphs with tens of nodes, constrained by exponential reasoni…

Deep Reinforcement Learning with Stacked Hierarchical Attention for Text-based Games

2020-10-22 · NeurIPS 2020 12 · Yunqiu Xu, Meng Fang, Ling Chen, Yali Du 외

We study reinforcement learning (RL) for text-based games, which are interactive simulations in the context of natural language. While different methods have been developed to represent the environment information and la…

Decision Making Deep Reinforcement Learning Knowledge Graphs reinforcement-learning+2