- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes MoFlow, a multi-objective framework for automatic agentic workflow generation. It formulates workflow construction as a multi-objective MDP and combines Convex-Hull MCTS, contextual zooming, and GNN-based value estimation to optimize multiple objectives within a single search. Experiments on six benchmarks demonstrate improvements over existing workflow generation methods in terms of hypervolume.
Critical strengths
- The paper addresses a practical and important problem by jointly optimizing accuracy, cost, latency, robustness, and consistency in agentic workflow generation.
- The experimental evaluation is comprehensive, covering six benchmarks and multiple LLM backbones. The results demonstrate consistent improvements over existing workflow generation baselines.
Critical weaknesses
- Insufficient comparison with multi-objective optimization methods. Although the paper compares against several workflow generation baselines, it lacks comparisons with established multi-objective optimization algorithms, making it difficult to assess the effectiveness of the proposed approach specifically for Pareto optimization.
Questions for authors
How sensitive is MoFlow’s performance to the number and distribution of preference vectors sampled during search, particularly when the number of objectives increases?
3 comments
Dear Reviewer gfnL,
Thank you again for your valuable comments. We understand this is a busy time, and we would greatly appreciate it if you could let us know whether our rebuttal has addressed your concerns. If there are any unsolved concerns, we will be very willing to continue the discussion.
Best Regards,
Authors
Thank you for your rebuttal and clarifications. Taking into account your response and my overall assessment of the paper, I believe my initial rating remains appropriate and will therefore keep it unchanged.
Rebuttal
Thank you for the positive and constructive review. We are glad you found the problem important and the evaluation comprehensive. We respond to the two points below.
W1. Comparison with established multi-objective optimization (MOO) algorithms
Our comparison protocol follows published workflow generation papers such as AFlow (ICLR 2025) and MaAS (ICML 2025), and all six baselines are strong workflow optimizers. As noted in the paper (Sec. 4, lines 394–395), the protocol deliberately favors the baselines. They are rerun separately for each of the 11 test preferences, so each run targets the exact weights it is scored at, whereas MoFlow serves all 11 preferences from a single search that never sees them, and it still attains the highest mean hypervolume. Our ablation study (Table 4, lines 456–467) further compares MoFlow with three established multi-objective MCTS algorithms, Pareto-UCB (Chen & Liu, 2019), Hypervolume-UCB (Perez et al., 2015) and Chebyshev (Xu & Li, 2017), by swapping in their action-selection rules, and MoFlow again attains the highest hypervolume with the fewest tokens. Taken together, we consider the comparison already comprehensive, as you also noted in the strengths.
Most generic MOO algorithms are not readily applicable to workflow generation, but if there is any specific work you think we should compare ours against, please let us know and we would be happy to perform comparison.
Q1. Sensitivity to the number and distribution of sampled preferences
MoFlow needs only a few dozen sampled preferences, even with all five objectives. Across the six online searches, hypervolume reaches 90% of its final value after 15 to 40 preferences, and Figure 4 shows one such curve. As for the distribution, we sample preferences uniformly by design. Users' preferences are unknown at search time, so the search should not favor any region of the preference space. The sampling distribution only steers which actions the search explores, while the set-valued backups and serving by lookup never use it. We therefore treat a sensitivity analysis over other sampling distributions as orthogonal to validating MoFlow's design, and we would be glad to pursue it in future work.