Skip to content

Multi-Agent Agentic Graph Learning via Structural Signatures

Sep 2026 · 1 citation · 39 references
Computer Science

TL;DR

A multi-agent agentic graph learning framework that partitions the graph into communities and assigns an independent agent to each community for region-specific specialization and shows that MAAGL outperforms SOTA AGL methods.

Abstract

Agentic graph learning (AGL) has recently achieved promising results on graph reasoning tasks, where an agent powered by a large language model (LLM) sequentially samples the graph as evidence to support its final prediction. Existing methods either employ a single agent or orchestrate multiple role-based agents to reason and learn over the entire graph, but both essentially rely on a shared reasoning policy across different graph regions, which can be suboptimal for graphs with heterogeneous structural and semantic patterns. Inspired by the progress of multi-agent collaboration on complex reasoning tasks, a natural remedy is to let multiple agents own different memory and collaborate; however, applying this paradigm to graphs directly faces two challenges. First, existing AGL methods typically verbalize graph structures into natural-language descriptions for LLM agents, making the reasoning process sensitive to the ordering of structural information and thereby breaking the permutation-invariant nature of graphs. Second, incorporating increasingly large sampled neighborhoods leads to rapidly growing contexts. To address these challenges, this paper introduces a multi-agent agentic graph learning (i.e., MAAGL) framework. MAAGL partitions the graph into communities and assigns an independent agent to each community for region-specific specialization. MAAGL represents structural and semantic evidence separately. Structural evidence is summarized by a dynamically updated structural signature that is permutation-invariant and fixed in size, while semantic evidence is filtered to the top-k nodes ranked by relevance. Based on historical trajectories with similar signatures, agents estimate their confidence and trigger debate-style collaboration when needed. Extensive experiments on four benchmark datasets show that MAAGL outperforms SOTA AGL methods.

View source

Similar papers

GraphMAS: A Systematic Benchmark of Multi-Agent Coordination for Graph Learning

LLM-based multi-agent systems coordinate specialized reasoning through aggregation, interaction, and adaptive control, yet their potential for graph learning remains unexplored. Graph learning is a natural setting for such systems because useful evidence may arise from heterogeneous local, long-range, global structural...

Jia-Yi Yang, Yi-Fang Chen, Yuan-Fu Sun et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Inference-Time Graph Engineering for Multi-Agent LLM Workflows

This work synthesizes a task-conditioned temporal workflow graph that jointly specifies agent connectivity and edge-level communication semantics, and introduces ReActNet, a training-free framework that compiles a query and a set of role-specialized agents into a sequence of directed communication graphs.

Katherine Tieu, Dong-Qi Fu, Ying-Long Xia et al. · 1 citation · ⚡1
#artificial intelligence Preprint Sep 2026

GraMRAG: Orchestrating Multi-Agent Multi-Step Reasoning via Graph Memory with Reinforcement Learning

GraMRAG is proposed, a graph memory-guided multi-agent RAG framework that integrates a dynamic multimodal memory graph to enable stable, multi-step multimodal reasoning and introduces a vision-text bridged reasoning paradigm that unifies multi-scale entity cropping with a ReAct-style visual toolchain, enhancing the lon...

Zhong-Yu Wang · 0 citations
Open access Aug 2026

GEMA: Graph Embeddings for Multi‐Agent Coordination

Many cooperative multi‐agent tasks are naturally defined by graph‐structured objectives, where agents must collectively reach, for example, a desired relational configuration or satisfy a set of constraints. These objectives often encode spatial arrangements, inter‐agent relations, or constraints that can be formal...

Alessandro Amato, Raffaele Galliera, K. Venable et al. · 0 citations
#artificial intelligence Preprint Sep 2026

GTA: Graph Theory Agent and Benchmark for Algorithmic Graph Reasoning with LLMs

The Graph Theory Agent (GTA), which pairs a preference-trained representation selector with plan-and-decompose scaffolding around a frozen executor LLM, is proposed, which lifts Phi-4 from 53.5% to 69.1% on the benchmark's easy split and from 33.0% to 41.5% on its hard split.

Zi-Xiang Xu, Yan-Bo Wang, Chenxi Wang et al. · 4 citations · ⚡1
#artificial intelligence Preprint Sep 2026

GraphCert: Bootstrap Agentic Graph Reasoning with Certified Evidence Rubrics

Graph agents extend large language models (LLMs) with the ability to actively explore and reason over knowledge graphs through multi-step interactions with graph tools. However, training capable graph agents typically requires large collections of question-answer pairs and reasoning trajectories, whose manual construct...

Wei Jiang, Yu-Chen Ying, Rui Wang et al. · 0 citations

Related blog posts

Hugging Face Blog Nov 10, 2026

Decision Models in Hugging Face

We’re on a journey to advance and democratize artificial intelligence through open source and open science.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.