REVIEW 17 cited by
G-Designer: Architecting Multi-agent Communication Topologies via Graph Neural Networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Recent advancements in large language model (LLM)-based agents have demonstrated that collective intelligence can significantly surpass the capabilities of individual agents, primarily due to well-crafted inter-agent communication topologies. Despite the diverse and high-performing designs available, practitioners often face confusion when selecting the most effective pipeline for their specific task: \textit{Which topology is the best choice for my task, avoiding unnecessary communication token overhead while ensuring high-quality solution?} In response to this dilemma, we introduce G-Designer, an adaptive, efficient, and robust solution for multi-agent deployment, which dynamically designs task-aware, customized communication topologies. Specifically, G-Designer models the multi-agent system as a multi-agent network, leveraging a variational graph auto-encoder to encode both the nodes (agents) and a task-specific virtual node, and decodes a task-adaptive and high-performing communication topology. Extensive experiments on six benchmarks showcase that G-Designer is: \textbf{(1) high-performing}, achieving superior results on MMLU with accuracy at $84.50\%$ and on HumanEval with pass@1 at $89.90\%$; \textbf{(2) task-adaptive}, architecting communication protocols tailored to task difficulty, reducing token consumption by up to $95.33\%$ on HumanEval; and \textbf{(3) adversarially robust}, defending against agent adversarial attacks with merely $0.3\%$ accuracy drop.
Forward citations
Cited by 17 Pith papers
-
MasFACT: Continual Multi-Agent Topology Learning via Geometry-Aware Posterior Transfer
MasFACT transfers historical topology priors across tasks via Fused Gromov-Wasserstein optimal transport and PAC-Bayes conservative adaptation to reduce topology forgetting in continual multi-agent settings.
-
Optimal-Agent-Selection: State-Aware Routing Framework for Efficient Multi-Agent Collaboration
A state-aware contrastive router that selects the most relevant agent at each step improves multi-agent LLM accuracy by up to 23.8% while using a fraction of the tokens of fixed-pipeline baselines.
-
MASPRM: Multi-Agent System Process Reward Model
MASPRM trains a per-agent, per-message value head from outcome-only MCTS rollouts and uses it to guide step-level beam search and MCTS, improving exact match on GSM8K by up to +30.7 points over a greedy multi-agent pass.
-
SafeMobile: Chain-level Jailbreak Detection and Automated Evaluation for Multimodal Mobile Agents
A history-aware guard model with an LLM judge is reported to cut jailbreak success on mobile agent tasks from 86.1% to 8.4% while keeping task completion unchanged at 77.8%.
-
MasHost Builds It All: Autonomous Multi-Agent System Directed by Reinforcement Learning
MasHost uses reinforcement learning to autonomously construct query-adaptive multi-agent graphs, and its authors report the best average accuracy across six LLM benchmarks.
-
G-Memory: Tracing Hierarchical Memory for Multi-Agent Systems
G-Memory stores past multi-agent teamwork in a three-tier graph and retrieves it to boost performance on five benchmarks.
-
Adaptive Graph Pruning for Multi-Agent Communication
AGP trains a graph neural network to jointly decide which agents to keep and how strongly they should communicate, and reports state-of-the-art average accuracy across six LLM benchmarks with large token savings.
-
Transition from Statistical to Hardware-Limited Scaling in Photonic Quantum State Reconstruction
Classical shadow tomography on integrated photonics shows a sharp transition from statistical O(M^{-1/2}) error scaling to a hardware-limited floor set by unitary spectral distortions.
-
Cost and Accuracy of Long-Term Memory in Distributed Multi-Agent Systems Based on Large Language Models
A two-framework testbed comparison claims mem0 is Pareto-optimal over Graphiti for distributed LLM agents because its lower cost is paired with accuracy that is not significantly different.
-
Graphs Meet AI Agents: Taxonomy, Progress, and Future Opportunities
A survey that groups graph-empowered AI agent research into planning, execution, memory, and multi-agent coordination, plus agents-for-graphs and applications.
-
We Should Identify and Mitigate Third-Party Safety Risks in MCP-Powered Agent Systems
MCP-powered LLM agents are vulnerable to prompt injection from third-party services, and simple detection or filtering defenses do not reliably stop these attacks.
-
MermaidFlow: Redefining Agentic Workflow Generation via Safety-Constrained Evolutionary Programming
Encoding LLM agent workflows as statically checked Mermaid graphs and evolving them with constrained mutations improves solve rates on GSM8K, MATH, HumanEval, and MBPP.
-
CAFES: A Collaborative Multi-Agent Framework for Multi-Granular Multimodal Essay Scoring
A student-teacher multi-agent pipeline with positive-only feedback improves QWK agreement with human essay scores by 21% on a multimodal benchmark, with gains concentrated in traits where baselines were weakest.
-
ScoreFlow: Mastering LLM Agent Workflows via Score-based Preference Optimization
ScoreFlow uses a score-weighted variant of direct preference optimization to automatically generate and refine per-task LLM agent workflows, reporting an average 8.2% improvement over baselines on six benchmarks.
-
Self-Evolving Coding Agents
A systematic survey that defines self-evolving coding agents, organizes systems into a five-category object-centered taxonomy, and analyzes when and on what evidence these agents evolve.
-
GEMMAS: Graph-based Evaluation Metrics for Multi Agent Systems
GEMMAS proposes two graph-based metrics for multi-agent LLM collaboration, but its redundancy metric is defined using ground-truth answer correctness rather than actual information redundancy.
-
Mathematical methods of reinforcement learning
A survey unifying the operator-theoretic, probabilistic, and optimization-based mathematical structures underlying modern reinforcement learning algorithms.
Discussion (0). Continue with ORCID to comment.