mlsanityData to 7 Oct 2026

OFA-MAS: One-for-All Multi-Agent System Topology Design based on Mixture-of-Experts Graph Generative Models

arXiv 2601.12996 ↗First posted 19 Jan 2026cs.MA cs.LGcited by 12

On the map: LLM agents and tool use → General LLM agent frameworks and benchmarks

also in 1 more
Abstract (arXiv)

Multi-Agent Systems (MAS) offer a powerful paradigm for solving complex problems, yet their performance is critically dependent on the design of their underlying collaboration topology. As MAS become increasingly deployed in web services (e.g., search engines), designing adaptive topologies for diverse cross-domain user queries becomes essential. Current graph learning-based design methodologies often adhere to a "one-for-one" paradigm, where a specialized model is trained for each specific task domain. This approach suffers from poor generalization to unseen domains and fails to leverage shared structural knowledge across different tasks. To address this, we propose OFA-TAD, a one-for-all framework that generates adaptive collaboration graphs for any task described in natural language through a single universal model. Our approach integrates a Task-Aware Graph State Encoder (TAGSE) that filters task-relevant node information via sparse gating, and a Mixture-of-Experts (MoE) architecture that dynamically selects specialized sub-networks to drive node and edge prediction. We employ a three-stage training strategy: unconditional pre-training on canonical topologies for structural priors, large-scale conditional pre-training on LLM-generated datasets for task-topology mappings, and supervised fine-tuning on empirically validated graphs. Experiments across six diverse benchmarks show that OFA-TAD significantly outperforms specialized one-for-one models, generating highly adaptive MAS topologies. Code: https://github.com/Shiy-Li/OFA-MAS.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Placed in General LLM agent frameworks and benchmarks, one of 16 directions in LLM agents and tool use. Builds on 26 of its 42 references that are in the map. First posted on arXiv 19 Jan 2026.

Builds on

26 of 42 references.

Closest ancestors · 2

Same direction, newest first

  1. 2025Assemble Your Crew: Automatic Multi-agent Communication Topology Design via Autoregressive Graph Generation24 Jul
  2. 2025Multi-agent Architecture Search via Agentic Supernet6 Feb

Other references · 24

  1. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  2. 2022ReAct: Synergizing Reasoning and Acting in Language Modelscited by 8,355
  3. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  4. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  5. 2023Reflexion: Language Agents with Verbal Reinforcement Learningcited by 4,064
  6. 2023AutoGen: Enabling Next-Gen LLM Applications via Multi-Agent Conversationcited by 1,906
  7. 2023GAIA: a benchmark for General AI Assistantscited by 1,084
  8. 2023Graph of Thoughts: Solving Elaborate Problems with Large Language Modelscited by 873
  9. 2021Are NLP Models really able to Solve Simple Math Word Problems?cited by 861
  10. 2017Program Induction by Rationale Generation : Learning to Solve and Explain Algebraic Word Problemscited by 642
  11. 2016Solving General Arithmetic Word Problemscited by 353
  12. 2024Debating with More Persuasive LLMs Leads to More Truthful Answerscited by 255
12 more
  1. 2019Efficient Graph Generation with Graph Recurrent Attention Networkscited by 231
  2. 2022A Survey of Multi-Agent Deep Reinforcement Learning with Communicationcited by 103
  3. 2024Self-Evolving Multi-Agent Collaboration Networks for Software Developmentcited by 73
  4. 2024ARC: A Generalist Graph Anomaly Detector with In-Context Learningcited by 46
  5. 2024Pard: Permutation-Invariant Autoregressive Diffusion for Graph Generationcited by 25
  6. 2025A Label-Free Heterophily-Guided Approach for Unsupervised Graph Fraud Detectioncited by 24
  7. 2025Uncertainty-Aware Graph Neural Networks: A Multi-Hop Evidence Fusion Approachcited by 14
  8. 2025A Survey of Generalization of Graph Anomaly Detection: From Transfer Learning to Foundation Modelscited by 13
  9. 2025Correcting False Alarms from Unseen: Adapting Graph Anomaly Detectors at Test Timecited by 12
  10. 2024Noise-Resilient Unsupervised Graph Representation Learning via Multi-Hop Feature Quality Estimationcited by 11
  11. 2025FreeGAD: A Training-Free yet Effective Approach for Graph Anomaly Detectioncited by 10
  12. 2024Overcoming Order in Autoregressive Graph Generationcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 12.

12 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Adaptive Graph Pruning for Multi-Agent Communication
  2. 2025AMAS: Adaptively Determining Communication Topology for LLM-based Multi-Agent System
  3. 2026Graph-of-Agents: A Graph-based Framework for Multi-Agent LLM Collaboration
  4. 2026Rethinking Multi-Agent Collaboration: When More Is Less
  5. 2024G-Designer: Architecting Multi-agent Communication Topologies via Graph Neural Networks
  6. 2026SkillGraph: Self-Evolving Multi-Agent Collaboration with Multimodal Graph Topology
  7. 2026Learning Transferable Topology Priors for Multi-Agent LLM Collaboration Across Domains
  8. 2026GraphMAS: A Systematic Benchmark of Multi-Agent Coordination for Graph Learning