Skip to content
Preprint

The Optimizer Is the Agent: Reasoning-Driven Search across Prompts, Programs, and ML Workflows

Aug 2026 · 1 citation · 124 references
Computer Science

TL;DR

ReASearch is presented, a unified framework for reasoning-driven optimization in which the agent autonomously decides what to evaluate, how to diagnose failures, which edits to make, and when to verify or restart.

Abstract

Recent systems for optimizing prompts, programs, and ML workflows typically rely on explicit outer-loop controllers such as evolutionary search, bandits, or textual-gradient methods. We ask a fundamentally different question: how much of this search policy can be internalized by a single tool-using agent? We present ReASearch, a unified framework for reasoning-driven optimization in which the agent autonomously decides what to evaluate, how to diagnose failures, which edits to make, and when to verify or restart. Rather than serving only as a proposal generator guided by hand-designed heuristics, the agent actively analyzes outcomes, allocates budget, and refines its strategy over long horizons through persistent memory. With a shared agent loop and domain-specific tools, ReASearch instantiates the exact same scaffold to optimize prompts, programs, and ML workflows. Across 14 diverse tasks, it is competitive with and mostly better than specialized optimization systems, achieving gains of 2% to 40% over strong domain-specific baselines, and in some cases discovering solutions that improve on prior human best-known results. Crucially, we observe that complex search behaviors, which are typically implemented by explicit controllers, emerge naturally from the agent's reasoning process.

View source

Similar papers

Preprint Aug 2026

RLMOpt: Adaptive Prompt Optimization via Recursive Language Models

RLMOpt is introduced, a prompt optimizer that makes the search policy itself language-model-driven through a recursive language model (RLM), which operates over a tool-based environment, inspecting task information, analyzing failures, generating candidates, allocating evaluation budget, and deciding when to stop.

Subhash Bangalore Satheesha, Nirvik Pande, Deepthi Duddempudi et al. · 1 citation
Preprint Aug 2026

Recursive Agentic Reasoning

Analysis shows that BRANCH's advantage arises not only from exploring multiple reasoning paths, but also from recovering from truncation: its gains strongly correlate with the baseline rate of empty, budget-exhausted outputs, weakening the hypothesis that different problems require routing among test-time reasoning ope...

Sheng Zhang, Xiao-Min Wu, Xi-Yang Wu et al. · 0 citations
Preprint Jul 2026

Learning Compositional Meta-Routing for Agentic Workflows: An Executable Benchmark

This work introduces an executable benchmark and a budget-aware meta-router that composes heterogeneous operations from raw task text that establishes a reproducible testbed and a bounded proof of concept, not evidence of live-LLM performance.

Natan Vidra, Alina Kapanova, Arun Kanhai et al. · 0 citations

Toward Self-Evolving Data Agents for Autonomous Data Analysis

Comparisons against stronger model and coding-agent competitors further indicate that both domain-specific agent runtime structure and foundation-model strength matter for autonomous data analysis.

Junhao Zhu, Lu Chen · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.