Coupled Hierarchical Search over Topology and Execution for Agentic Workflow Synthesis

• URL: http://arxiv.org/abs/2607.21609v1
• Date: Wed, 20 May 2026 01:56:11 GMT
• Title: Coupled Hierarchical Search over Topology and Execution for Agentic Workflow Synthesis
• Abstract summary: We introduce HierFlow, a training-free, test-time hierarchical search architecture that automates agentic workflow design.<n> HierFlow maximizes efficiency through an intelligent gating module that selectively triggers execution-level searches based on contextual necessity.<n> Comprehensive testing across question answering, mathematical reasoning, and code generation benchmarks confirms that HierFlow consistently outperforms strong baselines.
• Score: 64.2820121997882
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Although structured workflows empower Large Language Models (LLMs) to tackle complex problems, automating their creation is severely hindered by a vast combinatorial search space, frequently resulting in inflexible and resource-heavy offline training dependencies. To address this, we conceptualize workflow generation as an intertwined topology-and-execution search paradigm, where the broader topological layer dictates subtask boundaries and lower-level execution outcomes actively reshape the topology itself. Building on this foundation, we introduce HierFlow, a training-free, test-time hierarchical search architecture that automates agentic workflow design by merging feedback-guided topology adjustments with a fast, MCTS-inspired tree search for sub-workflow optimization. HierFlow maximizes efficiency through an intelligent gating module that selectively triggers execution-level searches based on contextual necessity, a mechanism we further support with an in-depth analysis detailing how varying degrees of cross-task coupling impact the effectiveness of hierarchical splitting. Comprehensive testing across question answering, mathematical reasoning, and code generation benchmarks confirms that HierFlow consistently outperforms strong baselines, delivering an optimal balance of high-quality results and computational efficiency without any additional training overhead.

Related papers

• A Unified Structured Query Understanding Framework for Industrial Semantic Search [9.913119853395205]
  Query understanding in large-scale industrial search systems is typically implemented as a cascade of disparate, task-specific components.<n>We propose and deploy a unified structured query understanding system that consolidates these heterogeneous functions into a single Small Language Model.<n>We validate this approach through extensive offline and online tests within LinkedIn's Job Search system.
  arXiv  Detail & Related papers  (2026-05-22T19:35:15Z)
• An Empirical Study of Multi-Agent Collaboration for Automated Research [41.906658558789545]
  We present a study investigating the comparative efficacy of distinct multi-agent structures for automated machine learning optimization.<n>We benchmark a single-agent baseline against two multi-agent paradigms: a subagent architecture and an agent team architecture.<n>Our findings reveal a fundamental trade-off between operational stability and theoretical deliberation.
  arXiv  Detail & Related papers  (2026-03-31T11:57:00Z)
• Workflow-R1: Group Sub-sequence Policy Optimization for Multi-turn Workflow Construction [25.928675237308074]
  We present gradient-R1, a framework that reformulates workflow construction as a multi-turn, natural language-based sequential decision-making process.<n>GSsPO functions as a structure-aware RL algorithm generalizable to a broad class of multi-turn agentic sequential decision-making tasks.
  arXiv  Detail & Related papers  (2026-02-01T12:44:59Z)
• Dynamic Generation of Multi-LLM Agents Communication Topologies with Graph Diffusion Models [99.85131798240808]
  We introduce a novel generative framework called textitGuided Topology Diffusion (GTD)<n>Inspired by conditional discrete graph diffusion models, GTD formulates topology synthesis as an iterative construction process.<n>At each step, the generation is steered by a lightweight proxy model that predicts multi-objective rewards.<n>Experiments show that GTD can generate highly task-adaptive, sparse, and efficient communication topologies.
  arXiv  Detail & Related papers  (2025-10-09T05:28:28Z)
• FlashResearch: Real-time Agent Orchestration for Efficient Deep Research [62.03819662340356]
  FlashResearch is a novel framework for efficient deep research.<n>It transforms sequential processing into parallel, runtime orchestration.<n>It can deliver up to a 5x speedup while maintaining comparable quality.
  arXiv  Detail & Related papers  (2025-10-02T00:15:39Z)
• DyFlow: Dynamic Workflow Framework for Agentic Reasoning [79.19799197382478]
  DyFlow is a dynamic workflow generation framework that adaptively constructs and adjusts reasoning procedures based on task requirements and real-time intermediate feedback.<n>We systematically evaluate DyFlow across diverse domains, including social reasoning, biomedical tasks, mathematical problem solving, and code generation.<n>Results demonstrate that DyFlow significantly outperforms existing baselines, achieving substantial Pass@k improvements and exhibiting robust generalization across diverse domains.
  arXiv  Detail & Related papers  (2025-09-30T10:36:23Z)
• Flash-Searcher: Fast and Effective Web Agents via DAG-Based Parallel Execution [48.7788770680643]
  Flash-Searcher is a novel parallel agent reasoning framework.<n>It decomposes complex tasks into subtasks with explicit dependencies, enabling concurrent execution of independent reasoning paths.<n>It achieves 67.7% accuracy on BrowseComp and 83% on xbench-DeepSearch, while reducing agent execution steps by up to 35% compared to current frameworks.
  arXiv  Detail & Related papers  (2025-09-29T17:39:30Z)
• Polymath: A Self-Optimizing Agent with Dynamic Hierarchical Workflow [6.636150750052998]
  Large language models (LLMs) excel at solving complex tasks by executing agentic composed of detailed instructions and structured operations.<n>Many researchers have sought to automate the generation and optimization of these through code-based representations.<n>Existing methods often rely on labeled datasets to train and optimize, making them ineffective and inflexible for solving real-world, dynamic problems.
  arXiv  Detail & Related papers  (2025-08-04T23:50:02Z)
• Layer-of-Thoughts Prompting (LoT): Leveraging LLM-Based Retrieval with Constraint Hierarchies [0.3946282433423277]
  Layer-of-Thoughts Prompting (LoT) uses constraint hierarchies to filter and refine candidate responses to a given query. LoT significantly improves the accuracy and comprehensibility of information retrieval tasks.
  arXiv  Detail & Related papers  (2024-10-16T01:20:44Z)
• Benchmarking Agentic Workflow Generation [80.74757493266057]
  We introduce WorfBench, a unified workflow generation benchmark with multi-faceted scenarios and intricate graph workflow structures.<n>We also present WorfEval, a systemic evaluation protocol utilizing subsequence and subgraph matching algorithms.<n>We observe that the generated can enhance downstream tasks, enabling them to achieve superior performance with less time during inference.
  arXiv  Detail & Related papers  (2024-10-10T12:41:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.