arXiv Machine Learning

Node-as-Agent: Graph Agentic Network

arXiv:2508. 00429v5 Announce Type: replace-cross Abstract: Graph Neural Networks (GNNs) have achieved remarkable success in graph-based learning by propagating information among neighbor nodes via predefined aggregation mechanisms.

Hugging Face Trending Papers
Sep 17

Rethinking Multi-Agent Collaboration: When More Is Less

The paper examines when multi‑agent collaboration is truly beneficial as large language models grow more capable. It finds that multi‑agent systems yield systematic advantages mainly for long‑horizon tasks with sparse dependencies, while single‑agent approaches excel in tightly coupled, sequential workflows. The authors introduce SAIGE, a lightweight, graph‑based collaboration framework that balances context efficiency and performance, demonstrating that adding more agents or deeper recursion does not always improve outcomes.

arXiv AI
Sep 18

Rethinking Multi-Agent Collaboration: When More Is Less

The paper examines when multi‑agent collaboration is beneficial versus single‑agent approaches. It finds that collaboration yields systematic advantages mainly in long‑horizon tasks with sparse dependencies, while single agents perform better in tightly coupled, sequential workflows. The authors introduce SAIGE, a lightweight multi‑agent mechanism that models collaboration as a dynamically evolving graph, and show that it balances context efficiency and task performance without always improving outcomes as more agents are added.

By Yishuo Yuan, Yibo Wu, Yihan Zhang, Minyuan Sun, Shenliang Li, Xinkai Ma, Yifan Li, Jiaheng Liu
arXiv AI
Sep 11

Multi-Agent Agentic Graph Learning via Structural Signatures

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.

By Liang Qu, Jianxin Li, Hua Wang
arXiv AI
Aug 28

Rethinking Message Passing as Retrieval for Text-Attributed Graph Learning

The paper reinterprets graph neural networks (GNNs) as retrieval-augmented models, where each layer uses an MLP on a node representation and a permutation‑invariant summary of retrieved graph context instead of traditional message passing. It introduces RTA, a lightweight MLP‑based framework that replaces structural message passing with label‑aware retrieval and propagation, and provides theoretical links to softmax‑attention message passing and robustness to mis‑retrieved outliers. Experiments on text‑attributed graph benchmarks demonstrate that RTA matches or surpasses strong GNN and graph LLM baselines while improving efficiency and robustness.

By Jintang Li, Yuhong Chen, Ruofan Wu, Binli Luo, Jiayi Ji, Hui Li, Rongrong Ji
arXiv AI
Jun 6

A2RAG: Adaptive Agentic Graph Retrieval for Cost-Aware and Reliable Reasoning

arXiv:2601. 21162v2 Announce Type: replace-cross Abstract: Graph Retrieval-Augmented Generation (Graph-RAG) enhances multihop question answering by organizing corpora into knowledge graphs and routing evidence through relational structure.

By Jiate Liu, Zebin Chen, Shaobo Qiao, Mingchen Ju, Danting Zhang, Bocheng Han, Shuyue Yu, Xin Shu, Jinglin Wu, Dong Wen, Xin Cao, Guanfeng Liu, Zhengyi Yang