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.
hub Canonical reference
G-designer: Architecting multi-agent communication topologies via graph neural networks
Canonical reference. 80% of citing Pith papers cite this work as background.
14
Pith papers citing it
Background
80% of classified citations
hub tools
citation-role summary
background 4
baseline 1
citation-polarity summary
representative citing papers
TaskWeave enables LLM agents to sustain coherent long-horizon organizational dynamics in a simulated year-long IT company via structured memory and planning cycles.
PEAR is a permutation-equivariant adaptive routing protocol for multi-agent LLM debate that reconfigures sparse topologies each round to improve accuracy over fixed debate baselines.
LEMON trains an LLM orchestrator with counterfactual-augmented GRPO to produce deployable multi-agent specifications that reach state-of-the-art results on six reasoning and coding benchmarks.
EvoMAS trains a workflow adapter with policy gradients to dynamically instantiate stage-specific multi-agent workflows from a fixed agent pool, using explicit task-state construction and terminal success signals, and outperforms static baselines on GAIA, HLE, and DeepResearcher.
AgentCollabBench shows that multi-agent reliability is limited by communication topology, with converging-DAG nodes causing synthesis bottlenecks that discard constraints and explain 7-40% of information loss variance.
An ensemble-based information-theoretic active learning method using ensemble Kalman inversion selects valuable tasks to optimize communication structures in LLM multi-agent systems more reliably than random sampling under limited training budgets.
Translating historical governance into LLM multi-agent systems shows institutional topology drives collective performance gaps over 57 points, with optimal forms shifting by model capability and task.
SkillGraph jointly evolves agent skills and collaboration topologies in multi-agent vision-language systems using a multimodal graph transformer and a skill designer, yielding consistent performance gains on benchmarks.
Complete cyclic subtask graphs offer a lens to measure when multi-agent revisitation aids recovery and exploration versus when it increases costs or is dominated by other bottlenecks in LLM agent workflows.
SGH replaces implicit agent loops with explicit static DAGs, immutable execution plans, layered planning/recovery, and strict escalation protocols to improve controllability in LLM agents.
Evo-Memory is a new streaming benchmark and evaluation framework for self-evolving memory in LLM agents, unifying over ten memory modules and introducing the ReMem pipeline for continual improvement on multi-turn and reasoning datasets.
Graphs can help LLMs reduce hallucinations, boost reasoning via prompting techniques, and better process structured data.
citing papers explorer
-
\textsc{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.
-
Can LLM Agents Sustain Long-Horizon Organizational Dynamics?
TaskWeave enables LLM agents to sustain coherent long-horizon organizational dynamics in a simulated year-long IT company via structured memory and planning cycles.
-
PEAR: Permutation-Equivariant Adaptive Routing Multi-Agent Debate
PEAR is a permutation-equivariant adaptive routing protocol for multi-agent LLM debate that reconfigures sparse topologies each round to improve accuracy over fixed debate baselines.
-
LEMON: Learning Executable Multi-Agent Orchestration via Counterfactual Reinforcement Learning
LEMON trains an LLM orchestrator with counterfactual-augmented GRPO to produce deployable multi-agent specifications that reach state-of-the-art results on six reasoning and coding benchmarks.
-
EvoMAS: Learning Execution-Time Workflows for Multi-Agent Systems
EvoMAS trains a workflow adapter with policy gradients to dynamically instantiate stage-specific multi-agent workflows from a fixed agent pool, using explicit task-state construction and terminal success signals, and outperforms static baselines on GAIA, HLE, and DeepResearcher.
-
AgentCollabBench: Diagnosing When Good Agents Make Bad Collaborators
AgentCollabBench shows that multi-agent reliability is limited by communication topology, with converging-DAG nodes causing synthesis bottlenecks that discard constraints and explain 7-40% of information loss variance.
-
Active Learning for Communication Structure Optimization in LLM-Based Multi-Agent Systems
An ensemble-based information-theoretic active learning method using ensemble Kalman inversion selects valuable tasks to optimize communication structures in LLM multi-agent systems more reliably than random sampling under limited training budgets.
-
When Agents Evolve, Institutions Follow
Translating historical governance into LLM multi-agent systems shows institutional topology drives collective performance gaps over 57 points, with optimal forms shifting by model capability and task.
-
SkillGraph: Self-Evolving Multi-Agent Collaboration with Multimodal Graph Topology
SkillGraph jointly evolves agent skills and collaboration topologies in multi-agent vision-language systems using a multimodal graph transformer and a skill designer, yielding consistent performance gains on benchmarks.
-
Complete Cyclic Subtask Graphs for Tool-Using LLM Agents: Flexibility, Cost, and Bottlenecks in Multi-Agent Workflows
Complete cyclic subtask graphs offer a lens to measure when multi-agent revisitation aids recovery and exploration versus when it increases costs or is dominated by other bottlenecks in LLM agent workflows.
-
From Agent Loops to Structured Graphs:A Scheduler-Theoretic Framework for LLM Agent Execution
SGH replaces implicit agent loops with explicit static DAGs, immutable execution plans, layered planning/recovery, and strict escalation protocols to improve controllability in LLM agents.
-
Position: How can Graphs Help Large Language Models?
Graphs can help LLMs reduce hallucinations, boost reasoning via prompting techniques, and better process structured data.
- SP-GCRL: Influence Maximization on Incomplete Social Graphs