{"slug": "designing-agentic-ai-workflow-portfolios-under-imperfect-selection-and-compute", "title": "Designing Agentic AI Workflow Portfolios under Imperfect Selection and Compute Cost", "summary": "A new arXiv paper (2609.18126v1) formulates agentic AI deployment as a workflow portfolio problem in which a firm jointly chooses run size and allocation across workflow types, reporting that portfolio optimization improved held-out selector accuracy over the best standalone workflow by 3.1, 7.5, and 0.9 percentage points on the ABCD, Schema-Guided Dialogue, and HotpotQA datasets respectively. Dual-guided workflow generation added 3.5 points on ABCD and 24.1 on HotpotQA, with no additional gain on Schema-Guided Dialogue. The authors derive sharp bounds on the value of workflow variety, summarize selector quality through an odds-lift index, and develop exact formulations, linear programming relaxations, randomized rounding, and an ellipsoid method with a pricing oracle for large implicit workflow classes.", "body_md": "arXiv:2609.18126v1 Announce Type: new \nAbstract: Agentic AI systems often approach the same task through multiple workflows that differ in reasoning strategy, verification structure, and compute cost. A natural deployment policy is to use the workflow with the highest average performance, but this can be suboptimal because different workflows may succeed on different instances. We study a portfolio-and-selector paradigm in which a firm runs multiple workflow executions and selects the final answer after observing their outputs. Additional executions may uncover correct answers that the best standalone workflow misses, but they consume compute and introduce plausible distractors that complicate final selection. We formulate this as a workflow portfolio problem in which the firm jointly chooses run size and allocation across workflow types. We summarize selector quality through an odds-lift index and derive sharp bounds on the value of workflow variety. For finite workflow pools, we develop exact formulations, linear programming relaxations, randomized rounding procedures, and computable performance certificates. For large implicit workflow classes, we derive a finite-dimensional dual and an ellipsoid method using a pricing oracle to identify workflows with high weighted accuracy net of recurring compute cost. Under a weak condition, the method obtains a near-optimal solution to the relaxation with polynomially many oracle calls. We evaluate the framework on three datasets: ABCD, Schema-Guided Dialogue, and HotpotQA. Relative to the best standalone workflow, portfolio optimization improves held-out selector accuracy by 3.1, 7.5, and 0.9 percentage points, respectively. Dual-guided workflow generation adds 3.5 points on ABCD and 24.1 on HotpotQA, with no additional gain on Schema-Guided Dialogue.", "url": "https://wpnews.pro/news/designing-agentic-ai-workflow-portfolios-under-imperfect-selection-and-compute", "canonical_source": "https://www.machinebrief.com/news/designing-agentic-ai-workflow-portfolios-under-imperfect-sel-7bgk", "published_at": "2026-09-17 04:00:00+00:00", "updated_at": "2026-09-17 04:55:05.813823+00:00", "lang": "en", "topics": ["ai-agents", "artificial-intelligence", "ai-research", "machine-learning"], "entities": ["arXiv", "ABCD", "Schema-Guided Dialogue", "HotpotQA"], "alternates": {"html": "https://wpnews.pro/news/designing-agentic-ai-workflow-portfolios-under-imperfect-selection-and-compute", "markdown": "https://wpnews.pro/news/designing-agentic-ai-workflow-portfolios-under-imperfect-selection-and-compute.md", "text": "https://wpnews.pro/news/designing-agentic-ai-workflow-portfolios-under-imperfect-selection-and-compute.txt", "jsonld": "https://wpnews.pro/news/designing-agentic-ai-workflow-portfolios-under-imperfect-selection-and-compute.jsonld"}}