AIarXiv

Ranked by formulaVerdict: Notable

DynaFlow: Learning Free-Form Multi-Agent Orchestration

Multi-agent systems often rely on predefined collaboration structures, limiting their ability to adapt to diverse task requirements.

By Liu, Li, Wang +1

Score██████░░░░5.9

Key numbers

  • 88.08% overall accuracy in Forced

Caveats

  • Preprint; not yet peer reviewed.

VerdictWorth a reader's time today.

Read the originalPDFCode

Abstract

Multi-agent systems often rely on predefined collaboration structures, limiting their ability to adapt to diverse task requirements. We introduce DynaFlow, a framework that integrates free-form executable workflow synthesis into the action space of the main agent. The agent decides when collaboration is needed and generates task-specific programs that coordinate sub-agents through sequential or parallel execution, structured information exchange, and verification. Execution results and traces inform subsequent actions, enabling the agent to adapt collaboration as reasoning progresses. We train only the main agent through supervised fine-tuning on distilled trajectories, followed by refinement on examples filtered for unsupported premises, biased verification, and information-flow defects. All sub-agents remain fixed, separating orchestration learning from executor capability improvement. Across six benchmarks spanning mathematical reasoning, scientific question answering, and multi-hop retrieval, DynaFlow achieves 88.08% overall accuracy in Forced mode, outperforming the strongest evaluated baseline by 10.90 percentage points with the same Qwen3.5-27B backbone. Workflow analysis finds more explicit use, verification, and refinement of upstream outputs after training, highlighting cross-stage information flow as a key dimension of multi-agent orchestration.

Ruhao Liu, Qi Li, Shizun Wang, Xinchao Wang

The editor's rubric

Heuristic review

Leverage4 / 5
A general-purpose tool used across several fields (Adam, ResNet, LoRA, next-generation sequencing).
24% of this desk’s rubric
Magnitude3 / 5
Large gain: roughly 2x, or a clear new state of the art on a hard, unsaturated problem.
18% of this desk’s rubric
Evidence3 / 5
Solid: multiple benchmarks or cohorts, ablations, fair baselines, released code or data.
14% of this desk’s rubric
Novelty2 / 5
A new combination of known ideas.
16% of this desk’s rubric
Trajectory2 / 5
Some room to improve with obvious engineering.
18% of this desk’s rubric
Stakes2 / 5
Benefits a professional community (practitioners, clinicians, engineers).
10% of this desk’s rubric

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we propose); breadth (many tasks); gains (outperforms); verification (multiple benchmarks); stakes (general AI).

How the score was computed

rank-2026-10-18

Score██████░░░░5.9

Score = 10 × (65% × adjusted merit / 10 + 25% × attention + 10% × freshness)

Desks place stronger verdicts first, then use this score to order work within the same verdict.

Merit
5.6 / 10
Weighted rubric, evidence-gated.
Adjusted merit
4.6 / 10
Shrunk toward the desk prior by editor confidence (40%).
Attention
90%
Citations, upvotes, points, mentions.
Freshness
60%
Half-life decay since publication.
  • Hugging Face upvotes168 (reference 25, via hf-daily, Oct 27, 2026, 13:49 UTC)
  • GitHub stars3 (reference 250, via hf-daily, Oct 27, 2026, 13:49 UTC)

The record

  • Reviewed by heuristic-v10 on Oct 27, 2026, 13:49 UTC. Paper type: method.
  • Categories: cs.MA
  • TOP, No.1 in the Artificial Intelligence edition of October 27, 2026.