arXiv AI
Agent-UCT: Upper Confidence Bounds Applied to Trees for Cost-Aware Agentic Workflow Optimization
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv AI
Jul 28
Agent-UCT: Upper Confidence Bounds Applied to Trees for Agentic Workflow Optimization with Cost-Awareness
arXiv:2607. 24162v1 Announce Type: new Abstract: Optimizing agentic workflows, such as retrieval-augmented generation (RAG) pipelines, requires navigating a combinatorial space of discrete component choices under tight evaluation budgets.
Hugging Face Trending Papers
Jul 27
Agent-UCT: Upper Confidence Bounds Applied to Trees for Agentic Workflow Optimization with Cost-Awareness
Optimizing agentic workflows, such as retrieval-augmented generation (RAG) pipelines, requires navigating a combinatorial space of discrete component choices under tight evaluation budgets. Existing approaches - heuristic search, black-box optimization, and standard tree search methods - do not explicitly exploit the compositional structure of these workflows, leading to redundant computation and inefficient budget allocation.
arXiv AI
Sep 25
Canopy: Exploiting Piecewise Smooth Tree Priors for Multi-Fidelity Bandits
CANOPY is a multi‑fidelity tree bandit algorithm that learns where a piecewise‑smooth prior holds instead of assuming global smoothness. It uses cheap random‑path probes to certify local aggregation bias and then focuses expensive leaf evaluations on cells where smoothness is violated. The method achieves provable fixed‑budget and regret guarantees that scale with the number of discontinuities, matching smooth‑tree rates when no violations exist and approaching structure‑blind search when violations are dense.
arXiv Computation and Language
Oct 1
OPTS-TTPO: Enhancing Finite-Sample Policy-Gradient Learning with Tree Search
arXiv:2609.40035v1 Announce Type: new Abstract: The policy-gradient theorem gives the exact gradient under the current policy, but finite on-policy samples may miss rare high-return trajectories. We...
arXiv AI
Oct 12
Do More Agents Help? Evaluating Accuracy and Cost in LLM Multi-Agent Workflows
The paper introduces BenchAgent, a framework for evaluating multi‑agent large language model (LLM) workflows against a single‑agent baseline, BenchAgent Core. Using GPT‑4.1 across ten reasoning, coding, and tool‑use benchmarks, the study compares six multi‑agent configurations, finding that EvoAgent achieves the highest mean pooled accuracy (79.70%) while other agents lag by 1.71–8.76 percentage points. The analysis also highlights trade‑offs in token consumption and accuracy, offering guidance for selecting and optimizing LLM multi‑agent workflows.
arXiv AI
Jul 16
MASPRM: Multi-Agent System Process Reward Model
arXiv:2510. 24803v3 Announce Type: replace-cross Abstract: Inference-time search over multi-agent systems (MAS) wastes compute when it cannot identify which agent's intermediate message advanced progress.