Mining the Design Space of Multi-Agent Workflows
Organizations: Dartmouth College · Allen Institute for AI
Abstract
Designing large language model (LLM) multi-agent systems (MAS) still relies on trial and error and informal "folk wisdom." Manual studies test only a few communication structures or topologies (e.g., sequential, parallel, shared-memory, or debate), while automated optimizers discard search trajectories after selecting a task-specific workflow. We present a two-phase pipeline for mining reproducible design principles from workflow code and execution traces. We repurpose AFlow's MCTS optimizer across six composable operators and 26 deterministically verified Enigmata tasks, retaining all intermediate rounds to build a corpus of 28,568 executable workflows. A sandboxed AutoResearch loop then mines orchestration code and prompt templates under an -penalized validation objective and tests candidate principles on held-out searches. Across 300 feature-mining trials, we identify effects that persist on held-out searches across three levels of workflow design: workflows beginning with independent solvers and one-shot aggregation (Star-first) perform worse (); persistent shared documents (SharedMemory) outperform debate (); and prompt specificity and placeholder-based context routing yield gains comparable to communication-structure selection (). More broadly, our pipeline and results show the feasibility of turning discarded search trajectories into a statistical testbed for discovering and validating multi-agent workflow design principles.
Figures & tables
| Train | Held-out test | Sign agreement | Test-verified | ||||||||||||
| Variant | med | med | |||||||||||||
| Principle 1 (RQ1, Entry-Point Topology): Star-first hurts performance (claim direction ) | |||||||||||||||
| Star 1st | 13 | 0 | 7 | .008 | 12 | 0 | 4 | .038 | 9/12 | .001 | 9/10 | .011 | |||
| Star compute | 13 | 0 | 7 | .008 | 12 | 0 | 3 | .038 | 9/12 | .001 | 9/10 | .011 | |||
| Principle 2 (RQ2, Communication State): SharedMemory boosts reasoning (claim direction ) | |||||||||||||||
| SM present | 13 | 10 | 0 | .002 | 10 | 6 | 0 | .011 | 9/10 | .001 | 9/10 | .011 | |||
Appendix figures & tables20 assets
Supplementary material from the paper’s appendix.
Appendix
| Challenge | Manifestation in MAS Evaluation | Pipeline Stage | Methodological Design |
|---|---|---|---|
| Design-space coverage & implementation variance | Manual studies test only a few fixed topologies; argmax search discards intermediate designs; naive random code generation produces broken prompts or syntax errors. | AFlow Search ( Sampling ; § IV-A ) | Retains all MCTS rounds across runs over 6 composable operators, sampling both failed and high-performing workflows under a consistent LLM optimizer policy (§ A ). |
| Domain & evaluation confounds | Downstream benchmarks conflate coordination topology with external tool APIs, domain knowledge, or noisy LLM-as-a-judge grading. | Enigmata Verification ( Sampling ; § IV-B ) | Tool-free evaluation on 26 parametric abstract-reasoning tasks with exact, deterministic rule-based verifiers and fixed 20-instance bundles per difficulty tier (§ C-D ). |
| High-dimensional feature overfitting & leakage | Workflow code ( graph.py ) and prompts ( prompt.py ) admit infinitely many features; manual selection is narrow, while unconstrained search overfits or leaks test data. | AutoResearch Mining ( Analysis ; § IV-C ) | Sandboxed AST/prompt feature mining with an -penalized validation objective on strict search-level splits; pre-specified directional verification on held-out test searches (§ D ). |
| Hyperparameters | Values |
|---|---|
| Models | |
| Optimizer | GPT-5.4 |
| Opt. Temperature ( ) | 0 |
| Worker | [GPT-5.4-mini, GPT-5.4-nano] |
| Worker temperature ( ) | 0 |
| Aggregator | [GPT-5.4-mini, GPT-5.4-nano] |
| Model name | Snapshot |
|---|---|
| GPT-5.4 | gpt-5.4-2026-03-05 |
| GPT-5.4-mini | gpt-5.4-mini-2026-03-17 |
| GPT-5.4-nano | gpt-5.4-nano-2026-03-17 |
| Star 1st | ||
| Puzzle | tr | te |
| Campsite | ||
| CarPainting | ||
| CryptoKKA | ||
| CryptoKPA | ||
| Game24 | ||
| SM present | ||
| Puzzle | tr | te |
| Campsite | ||
| CarPainting | ||
| CryptoKKA | ||
| CryptoKPA | ||
| Game24 | – | |
| mean chars | #placeh. | |||
| Puzzle | tr | te | tr | te |
| Campsite | ||||
| CarPainting | ||||
| CryptoKKA | ||||
| CryptoKPA | ||||
| Game24 | ||||
| Operator | Communication | Structure | Params | Calls |
|---|---|---|---|---|
| Sequential | single agent | linear pipeline | ||
| Star | isolated workers | fan-out agg | ||
| SharedMemory | shared doc | writes agg | ||
| Debate | all-to-all | exchange agg | ||
| StarW/Coordinator | coord workers | iterative hub-spoke | ||
| DebateW/Moderator | all-to-all + mod | debate + mod/round |
| Split | Count | Percentage |
|---|---|---|
| Total | 28,568 | 100.0% |
| Train | 19,822 | 69.4% |
| Validation | 4,278 | 15.0% |
| Test | 4,468 | 15.6% |
| Task | Easy ($) | Medium ($) | Hard ($) | Mean ($) |
|---|---|---|---|---|
| StarBattle | $0.0110 | $0.0096 | $0.0099 | $0.0102 |
| SumSkyscraper | $0.0108 | $0.0092 | $0.0102 | $0.0100 |
| Sudoku | $0.0096 | $0.0105 | $0.0090 | $0.0097 |
| ZebraLogic | $0.0062 | $0.0097 | $0.0116 | $0.0091 |
| Campsite | $0.0065 | $0.0104 | $0.0102 | $0.0091 |
| Kakurasu | $0.0094 | $0.0063 | $0.0113 | $0.0090 |
| Operator | # Workflows | Percentage | Score | Cost | ||
|---|---|---|---|---|---|---|
| w | w/o | w | w/o | |||
| Sequential | 13,473 | 47.16 | 0.14 | 0.19 | 0.14 | 0.15 |
| Star | 12,716 | 44.51 | 0.16 | 0.17 | 0.13 | 0.16 |
| Debate | 6,373 | 22.31 | 0.18 | 0.17 | 0.13 | 0.15 |
| SharedMemory | 5,948 | 20.82 | 0.23 | 0.15 | 0.25 | 0.12 |
| DebateWithModerator | 3,382 | 11.84 | 0.19 | 0.16 | 0.19 | 0.14 |
| Operator combination | # WFs | Percentage | Score | Cost | ||
|---|---|---|---|---|---|---|
| w | w/o | w | w/o | |||
| Star Seq | 4,564 | 15.98 | 0.14 | 0.17 | 0.12 | 0.15 |
| Star | 4,125 | 14.44 | 0.15 | 0.17 | 0.07 | 0.16 |
| Debate | 2,346 | 8.21 | 0.17 | 0.17 | 0.09 | 0.15 |
| SharedMemory Seq | 2,158 | 7.55 | 0.18 | 0.17 | 0.23 | 0.14 |
| Seq | 2,078 | 7.27 | 0.09 | 0.17 | 0.05 | 0.16 |
| Puzzle | # WFs | Mean | Std | Min | 25% | 50% | 75% | Max | Skew | Kurt. |
|---|---|---|---|---|---|---|---|---|---|---|
| Graph | ||||||||||
| HamilCycle | 1,164 | 0.073 | 0.101 | 0.00 | 0.00 | 0.00 | 0.10 | 0.40 | 1.40 | 1.10 |
| HamilPath | 1,147 | 0.150 | 0.158 | 0.00 | 0.00 | 0.10 | 0.25 | 0.70 | 0.96 | -0.05 |
| Maze | 1,075 | 0.479 | 0.221 | 0.00 | 0.35 | 0.50 | 0.65 | 1.00 | -0.21 | -0.29 |
| NLNavigate | 1,120 | 0.561 | 0.322 | 0.00 | 0.30 | 0.65 | 0.85 | 1.00 | -0.36 | -1.18 |
| Logic | ||||||||||
| Category | Puzzle | GPT-5.4 | GPT-5.4-mini | GPT-5.4-nano | USD($)@max | ||
|---|---|---|---|---|---|---|---|
| Arithmetic | Countdown | 0.033 | 0.017 | 0.017 | 0.173 | 0.700 | 0.228 |
| Game24 | 0.150 | 0.083 | 0.050 | 0.288 | 0.700 | 0.220 | |
| Crypto | CryptoKKA | 0.267 | 0.067 | 0.000 | 0.412 | 1.000 | 0.081 |
| CryptoKPA | 0.050 | 0.050 | 0.000 | 0.139 | 0.650 | 0.238 | |
| Graph | HamilCycle | 0.133 | 0.017 | 0.000 | 0.228 | 0.400 | 0.080 |
| HamilPath | 0.300 | 0.100 | 0.017 | 0.363 | 0.700 | 0.233 |
| Granularity | Prior Rule? | Representative Mined Principle | |
|---|---|---|---|
| RQ1 | Entry-Point Topology | ✓ | Star as primary operator lowers score |
| RQ2 | Communication State | ✗ | SharedMemory outperforms dialogue |
| RQ3 | Sub-Topological Prompts | ✗ | Prompt specificity (length, #placeh. ) helps |
Multi-Agent Orchestration
Multi-agent orchestration coordinates specialized AI agents, tools, and workflows to solve complex tasks efficiently and reliably.
See all 207 papers