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

arXiv:2609.39777 · cs.LG · Submitted 2026-09-30 · Read on arXiv

cs.LG

Submitted: 2026-09-30

Updated: 2026-09-30

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Benchmark — 1× in this paper · explained in 2 episodes

Sources

• Scaling Graph Chain-of-Thought Reasoning: A Multi-Agent Framework with Efficient LLM Serving
• GraphSearch: Agentic Search-Augmented Reasoning for Zero-Shot Graph Learning
• Multi-Agent Agentic Graph Learning via Structural Signatures
• Proximal Policy Optimization Algorithms
• Multi-Agent Collaboration Mechanisms: A Survey of LLMs
• Qwen2.5 Technical Report

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks