Retrieval-Conditioned Topology Selection with Provable Budget Conservation for Multi-Agent Code Generation

• URL: http://arxiv.org/abs/2605.05657v1
• Date: Thu, 07 May 2026 04:18:53 GMT
• Title: Retrieval-Conditioned Topology Selection with Provable Budget Conservation for Multi-Agent Code Generation
• Abstract summary: We present Retrieval-Guided Adaptive Orchestration (RGAO), an architecture that closes the loop by extracting a structural complexity vector from a hierarchical code index.<n>RGAO operates within Code-Agent, a multi-agent framework whose sub-agents are governed by formal contracts with six-dimensional budget vectors.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Multi-agent LLM systems for code generation face a fundamental routing problem: the optimal orchestration topology depends on the structural complexity of the code under modification, yet existing systems select topologies without consulting the codebase. We present Retrieval-Guided Adaptive Orchestration (RGAO), an architecture that closes this loop by extracting a structural complexity vector from a hierarchical code index before selecting the orchestration topology. RGAO operates within Code-Agent, a multi-agent framework whose sub-agents are governed by formal contracts with six-dimensional budget vectors. Our headline contribution is the composition of two previously separate lines of work -- complexity-conditioned LLM routing and formal resource algebras -- yielding a property neither admits alone: provable budget conservation under retrieval-conditioned dynamic topology selection. Concretely we contribute: (1) a complexity-conditioned topology router that reduces proxy-measured misrouting from 30.1% to 8.2%; (2) a budget algebra with a structural-induction conservation theorem; and (3) a hierarchical code retrieval engine. Empirical evaluation demonstrates sub-millisecond DAG construction and linear tree-index scalability.

Related papers

• PRIMA: Operational Patterns for Resilient Multi-Agent Research with Verifiable Identity and Convergent Feedback [0.0]
  PRIMA operates as coordinated multi-agent research systems over multi-hour runs.<n>Main contributions are three operational patterns for surviving failure modes.<n>A Graph Isomorphism case study grounds the architectural claims in a generated artifact.
  arXiv  Detail & Related papers  (2026-05-23T23:27:46Z)
• Learning Transferable Topology Priors for Multi-Agent LLM Collaboration Across Domains [49.97473730863181]
  TopoPrior is a framework for learning transferable topology priors for multi-agent LLM collaboration across domains.<n>We show that TopoPrior consistently improves several heterogeneous topology-evolution backbones while reducing online inference-time token usage.
  arXiv  Detail & Related papers  (2026-05-17T09:55:18Z)
• ASTRA: Adaptive Semantic Tree Reasoning Architecture for Complex Table Question Answering [55.55968342644846]
  Table serialization remains a critical bottleneck for Large Language Models (LLMs) in complex table question answering.<n>Existing serialization methods fail to capture explicit hierarchies and lack schema flexibility.<n>We propose ASTRA (Adaptive Semantic Tree Reasoning Architecture) including two main modules, AdaSTR and DuTR.<n> Experiments on complex table benchmarks demonstrate that our method achieves state-of-the-art (SOTA) performance.
  arXiv  Detail & Related papers  (2026-04-10T06:09:41Z)
• OrgAgent: Organize Your Multi-Agent System like a Company [75.47076168155817]
  We introduce OrgAgent, a company-style hierarchical multi-agent framework.<n>We find that multi-agent systems organized in a company-style hierarchy generally outperform other organizational structures.
  arXiv  Detail & Related papers  (2026-04-01T15:21:14Z)
• HCAG: Hierarchical Abstraction and Retrieval-Augmented Generation on Theoretical Repositories with LLMs [12.68443002994035]
  Hierarchical Code/Architecture-guided Agent Generation (HCAG) is a framework that reformulates repository-level code generation as a structured, planning-oriented process over hierarchical knowledge.<n> HCAG substantially outperforms representative repository-level methods in code quality, architectural coherence, and requirement pass rate.<n>Although demonstrated in AGT, HCAG paradigm also offers a general blueprint for mining, reusing, and generating complex systems from structured aligneds in other domains.
  arXiv  Detail & Related papers  (2026-03-19T07:41:52Z)
• TopoChunker: Topology-Aware Agentic Document Chunking Framework [5.304983617085637]
  TopoChunker is an agentic framework that maps heterogeneous documents onto a Structured Intermediate Representation (SIR)<n>To balance structural fidelity with computational cost, TopoChunker employs a dual-agent architecture.<n>It outperforms the strongest LLM-based baseline by 8.0% in absolute generation accuracy and achieves an 83.26% Recall@3, while simultaneously reducing token overhead by 23.5%.
  arXiv  Detail & Related papers  (2026-03-19T02:15:10Z)
• AdaptOrch: Task-Adaptive Multi-Agent Orchestration in the Era of LLM Performance Convergence [0.0]
  AdaptOrch is a formal framework for task-adaptive multi-agent orchestration.<n>Topology-aware orchestration achieves 12-23% improvement over static single-topology baselines.
  arXiv  Detail & Related papers  (2026-02-18T21:00:05Z)
• DDL2PropBank Agent: Benchmarking Multi-Agent Frameworks' Developer Experience Through a Novel Relational Schema Mapping Task [9.51787137194505]
  DDL2PropBank is a novel benchmark task that maps relational database schemas to PropBank rolesets.<n>We implement identical agent logic across 10 frameworks and evaluate along two dimensions: (i) code complexity via static analysis, and (ii) AI-assistability.<n>Our results reveal a threefold complexity spectrum, with Pydantic AI and Agno requiring the least implementation overhead.
  arXiv  Detail & Related papers  (2026-02-03T01:10:59Z)
• Designing Domain-Specific Agents via Hierarchical Task Abstraction Mechanism [61.01709143437043]
  We introduce a novel agent design framework centered on a Hierarchical Task Abstraction Mechanism (HTAM)<n>Specifically, HTAM moves beyond emulating social roles, instead structuring multi-agent systems into a logical hierarchy that mirrors the intrinsic task-dependency graph of a given domain.<n>We instantiate this framework as EarthAgent, a multi-agent system tailored for complex geospatial analysis.
  arXiv  Detail & Related papers  (2025-11-21T12:25:47Z)
• LLM$\times$MapReduce-V3: Enabling Interactive In-Depth Survey Generation through a MCP-Driven Hierarchically Modular Agent System [55.33058620876928]
  LLM x MapReduce-V3 is a hierarchically modular agent system for long-form survey generation.<n>System captures research perspectives to generate a comprehensive skeleton, which is then developed into an in-depth survey.<n>Human evaluations demonstrate that our system surpasses representative baselines in both content depth and length.
  arXiv  Detail & Related papers  (2025-10-13T01:38:37Z)
• Assemble Your Crew: Automatic Multi-agent Communication Topology Design via Autoregressive Graph Generation [91.17994756436259]
  Multi-agent systems (MAS) based on large language models (LLMs) have emerged as a powerful solution for dealing with complex problems across diverse domains.<n>Existing approaches are fundamentally constrained by their reliance on a template graph modification paradigm with a predefined set of agents and hard-coded interaction structures.<n>We propose ARG-Designer, a novel autoregressive model that operationalizes this paradigm by constructing the collaboration graph from scratch.
  arXiv  Detail & Related papers  (2025-07-24T09:17:41Z)
• HM-RAG: Hierarchical Multi-Agent Multimodal Retrieval Augmented Generation [11.53083922927901]
  HM-RAG is a novel Hierarchical Multi-agent Multimodal RAG framework.<n>It pioneers collaborative intelligence for dynamic knowledge synthesis across structured, unstructured, and graph-based data.
  arXiv  Detail & Related papers  (2025-04-13T06:55:33Z)

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.