VineLM: Trie-Based Fine-Grained Control for Agentic Workflows

• URL: http://arxiv.org/abs/2605.23914v1
• Date: Thu, 09 Apr 2026 15:31:22 GMT
• Title: VineLM: Trie-Based Fine-Grained Control for Agentic Workflows
• Abstract summary: VineLM represents feasible executions as an annotated trie of model-choice prefixes.<n>VineLM represents feasible executions as an annotated trie of model-choice prefixes.
• Score: 4.984467399543813
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Agentic workflows interleave configurable LLM stages with tool stages and often include retries or refinement loops. Existing workflow managers profile full workflow configurations offline and assign each request a static workflow-level plan that binds each configurable LLM stage to a single model, reuses that model across repeated loop iterations, and does not revisit those choices at runtime. We present VineLM, a workflow manager that enables fine-grained control by choosing the model for each stage invocation as execution unfolds under request-level objectives such as maximizing accuracy under cost or latency budgets. VineLM represents feasible executions as an annotated trie of model-choice prefixes and uses checkpointing and cascade profiling to estimate path accuracy, cost, and latency without exhaustively profiling every request on every path. At runtime, VineLM re-roots the trie after each stage invocation and replans over the remaining subtrie using the realized execution prefix and remaining latency budget. On NL2SQL and math reasoning workflows, VineLM improves the cost-latency-accuracy frontier over coarse workflow-level baselines, achieving up to 18% higher accuracy at the same per-request budget with its sparse profiling reducing offline profiling cost by 98-99.8% when compared to exhaustive profiling.

Related papers

• ProgRouter: Online Progress-Guided Orchestration for Multi-Agent LLM Workflows under Quality-Cost Tradeoffs [20.369237729934664]
  Multi-agent large language model (LLM) have emerged as a powerful paradigm for solving complex, open-ended tasks.<n>Existing cascade routing methods make one-shot, state-dependent decisions and cannot adapt to the dynamic, state-dependent nature of multi-step query-level decisions.<n>We present Prog, an online progress-guided routing framework that adaptively selects LLM agents across workflow steps to preserve task-solving quality while adhering to time and cost budgets.
  arXiv  Detail & Related papers  (2026-08-26T16:42:02Z)
• Task-to-Model Optimization for Enterprise LLM Coding Assistants: A Data-Driven Framework for Cost-Optimal Routing [5.00725149774706]
  Enterprise AI coding assistants incur substantial inference spend, and naive token-cost minimization often fails to reduce end-to-end cost once retries, escalations, and developer wait time are included.<n>We present Task-to-Model Optimization (T2MO), a data-driven methodology for optimizing model selection in production coding.<n>We treat each developer session as a task that can be discovered, classified, graded for difficulty, benchmarked in a production-like harness, and routed to the cheapest model able to complete it within quality and latency constraints.
  arXiv  Detail & Related papers  (2026-08-09T06:57:53Z)
• On Time, Within Budget: Constraint-Driven Online Resource Allocation for Agentic Workflows [37.22092976146466]
  Agentic systems increasingly solve complex user requests by executing orchestrated executables, where subtasks are assigned to specialized models or tools and coordinated according to their dependencies.<n>Real deployments often impose concrete requirements: a workflow must be completed within a specified budget and before a specified deadline.<n>This shifts the goal from average efficiency optimization to maximizing the probability that the entire workflow completes successfully under explicit budget and deadline constraints.
  arXiv  Detail & Related papers  (2026-05-07T12:24:21Z)
• Why Search When You Can Transfer? Amortized Agentic Workflow Design from Structural Priors [51.95306551061392]
  Automated agentic workflow design currently relies on per-task iterative search.<n>We present SWIFT, a framework that amortizes workflow design into reusable structural priors.<n> SWIFT outperforms the state-of-the-art search-based method on five benchmarks.
  arXiv  Detail & Related papers  (2026-04-27T21:25:00Z)
• Chimera: Latency- and Performance-Aware Multi-agent Serving for Heterogeneous LLMs [62.17306142810532]
  We present Chimera, a predictive scheduling system for multi-agent workflow serving on heterogeneous LLM clusters.<n>Chime traces the best latency, reducing end-to-end latency by 1.2--2.4$times$ and improving task performance by 8.0-9.5 percentage points on average over competitive baselines.
  arXiv  Detail & Related papers  (2026-03-23T17:01:42Z)
• $π$-StepNFT: Wider Space Needs Finer Steps in Online RL for Flow-based VLAs [64.60188746073904]
  Flow-based vision-language-action models excel in embodied control but suffer from intractable likelihoods during multi-step sampling.<n>We propose textbftextit$boldsymbol$-StepNFT (Step-wise Negative-aware Fine-Tuning), a critic-and-likelihood-free framework that requires only a single forward pass per optimization step.
  arXiv  Detail & Related papers  (2026-03-02T17:04:49Z)
• Do We Always Need Query-Level Workflows? Rethinking Agentic Workflow Generation for Multi-Agent Systems [72.3575737073235]
  Multi-Agent Systems (MAS) solve complex tasks by coordinating multiple agents through.<n>Existing approaches generates either at task level or query level, but their relative costs and benefits remain unclear.<n>We show that query-level workflow generation is not always necessary, since a small set of top-K best task-level together already covers equivalent or even more queries.
  arXiv  Detail & Related papers  (2026-01-16T10:05:51Z)
• Towards Efficient Automatic Self-Pruning of Large Language Models [55.90119819642064]
  Post-training structured pruning is a promising solution that prunes Large Language Models without the need for retraining.<n>We argue that the key to mitigating this issue lies in accurately determining the pruning rate for each layer.<n>We introduce $textbfSelf-Pruner$ an end-to-end automatic self-pruning framework for LLMs, which efficiently search layer-wise pruning rates.
  arXiv  Detail & Related papers  (2025-02-20T09:59:50Z)
• 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.