arXiv AI By Liang Qu, Jianxin Li, Hua Wang

Multi-Agent Agentic Graph Learning via Structural Signatures

Read the original on arXiv AI →

The paper introduces Multi-Agent Agentic Graph Learning (MAAGL), a framework that partitions a graph into communities and assigns a dedicated agent to each community for specialized reasoning. MAAGL addresses two key challenges in existing agentic graph learning: it preserves permutation invariance by summarizing structural evidence with a dynamic structural signature, and it controls context size by filtering semantic evidence to the top‑k relevant nodes. Experiments on four benchmark datasets demonstrate that MAAGL outperforms state‑of‑the‑art agentic graph learning methods.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Jun 16

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

arXiv:2606. 16328v1 Announce Type: new Abstract: 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 reasoning overhead and finite context windows.

By Bing Hao, Ruijie Wang, Haodong Qian, Yunlong Chu, Yuhang Liu, Yumeng Lin, Minglai Shao, Jianxin Li
arXiv AI
Aug 28

GRAIN: Bridging Name and Narrative Shifts in Real-World Graph Reasoning through Invariance-Rewarded Agentic RL

GRAIN is a single-agent reinforcement learning framework that improves large language models’ robustness to real‑world shifts in node identifiers and task formulations by treating reasoning as a semantic parsing and tool‑execution pipeline. It introduces a Structure Invariance Reward that validates intermediate graphs against ground‑truth topologies, encouraging the model to learn genuine text‑to‑structure mappings instead of overfitting to surface patterns. On the new GRIT benchmark, GRAIN surpasses multi‑agent baselines by 16.45% in accuracy, reduces latency by about 24%, and halves the out‑of‑distribution gap of fine‑tuned models while remaining robust on large‑scale graphs beyond the training distribution.

By Zike Yuan, Han Zhang, Jianzhi Yan, Le Liu, Cai Ke, Huozhi Zhou, Jian Xie, Jiran Yin, Yukun Cao, Yue Yu, Hui Wang, Ming Liu, Bing Qin