Pith. sign in

REVIEW 18 cited by

AgentSquare: Automatic LLM Agent Search in Modular Design Space

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.06153 v3 pith:RBMC2FGV submitted 2024-10-08 cs.CL

AgentSquare: Automatic LLM Agent Search in Modular Design Space

classification cs.CL
keywords designagentsquareagentsearchdesignsspacemodularperformance
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Recent advancements in Large Language Models (LLMs) have led to a rapid growth of agentic systems capable of handling a wide range of complex tasks. However, current research largely relies on manual, task-specific design, limiting their adaptability to novel tasks. In this paper, we introduce a new research problem: Modularized LLM Agent Search (MoLAS). We propose a modular design space that abstracts existing LLM agent designs into four fundamental modules with uniform IO interface: Planning, Reasoning, Tool Use, and Memory. Building on this design space, we present a novel LLM agent search framework called AgentSquare, which introduces two core mechanisms, i.e., module evolution and recombination, to efficiently search for optimized LLM agents. To further accelerate the process, we design a performance predictor that uses in-context surrogate models to skip unpromising agent designs. Extensive experiments across six benchmarks, covering the diverse scenarios of web, embodied, tool use and game applications, show that AgentSquare substantially outperforms hand-crafted agents, achieving an average performance gain of 17.2% against best-known human designs. Moreover, AgentSquare can generate interpretable design insights, enabling a deeper understanding of agentic architecture and its impact on task performance. We believe that the modular design space and AgentSquare search framework offer a platform for fully exploiting the potential of prior successful designs and consolidating the collective efforts of research community. Code repo is available at https://github.com/tsinghua-fib-lab/AgentSquare.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 18 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. MobiBench: Multi-Branch, Modular Benchmark for Mobile GUI Agents

    cs.AI 2025-12 accept novelty 8.0

    MobiBench is the first modular multi-path offline benchmark for mobile GUI agents, achieving 94.72% agreement with human evaluators while allowing component-level analysis.

  2. TacoMAS: Test-Time Co-Evolution of Topology and Capability in LLM-based Multi-Agent Systems

    cs.CL 2026-05 unverdicted novelty 7.0

    TacoMAS performs test-time co-evolution of agent capabilities and communication topology in LLM multi-agent systems via fast capability updates and slow meta-LLM topology edits, delivering 13.3% average gains over str...

  3. Tools as Continuous Flow for Evolving Agentic Reasoning

    cs.AI 2026-05 unverdicted novelty 7.0

    FlowAgent models tool chaining as continuous latent trajectory generation with conditional flow matching to deliver global planning, formal utility bounds, and better robustness on long-horizon tasks, plus a new plan-...

  4. AutoSOTA: An End-to-End Automated Research System for State-of-the-Art AI Model Discovery

    cs.CL 2026-04 unverdicted novelty 7.0

    AutoSOTA uses eight specialized agents to replicate and optimize models from recent AI papers, producing 105 new SOTA results in about five hours per paper on average.

  5. Global Optimization and Inference-Time Region Grafting for Agentic Workflows

    cs.CL 2026-08 conditional novelty 6.0

    A training-free method that locally replaces failing regions of an offline-optimized agent workflow at inference time, improving average benchmark performance over prior workflow-optimization baselines.

  6. Self-Modifying Lean Proof Agents with Verifier-Grounded Benchmark Coevolution

    cs.AI 2026-07 conditional novelty 6.0

    A verifier-grounded self-evolving Lean proof agent with a champion-driven, self-hardening benchmark reached 45.1% held-out miniF2F solve rate versus 32.0% for a fixed-benchmark baseline.

  7. LOGOS: A Living Logic for AI Agent Teams That Evolve With Humans

    cs.AI 2026-07 conditional novelty 6.0

    LOGOS makes multi-agent self-evolution governable by compiling inputs into versioned Agent Packs and promoting only candidates that pass held-out evidence, root policy, and human authorization.

  8. AgentCo-op: Retrieval-Based Synthesis of Interoperable Multi-Agent Workflows

    cs.AI 2026-05 unverdicted novelty 6.0

    AgentCo-op retrieves and assembles existing agents and tools into interoperable workflows for open-world scientific tasks, showing effectiveness in genomics case studies and competitive benchmark results with lower costs.

  9. Harnesses for Inference-Time Alignment over Execution Trajectories

    cs.LG 2026-05 unverdicted novelty 6.0

    Partial harnesses for LLM agents, specifying only initial execution steps, achieve higher pass rates than fully decomposed workflows, as analyzed through trajectory alignment and validated in synthetic and terminal be...

  10. Training LLM Agents for Spontaneous, Reward-Free Self-Evolution via World Knowledge Exploration

    cs.AI 2026-04 unverdicted novelty 6.0

    LLM agents trained with a task-success reward on self-generated knowledge can spontaneously explore and adapt to new environments without any rewards or instructions at inference, yielding 20% gains on web tasks and a...

  11. AgentGA: Evolving Code Solutions in Agent-Seed Space

    cs.AI 2026-04 unverdicted novelty 6.0

    AgentGA optimizes agent seeds with genetic algorithms and parent-archive inheritance to improve autonomous code generation, beating a baseline on 15 of 16 Kaggle competitions.

  12. AgentGA: Evolving Code Solutions in Agent-Seed Space

    cs.AI 2026-04 unverdicted novelty 6.0

    AgentGA uses a genetic algorithm to evolve agent seeds and achieves 74.52% human-exceeding performance on tabular AutoML tasks versus 54.15% for the AIDE baseline.

  13. AutoSOTA: An End-to-End Automated Research System for State-of-the-Art AI Model Discovery

    cs.CL 2026-04 conditional novelty 6.0

    A eight-agent system automatically reproduces and improves SOTA models from top AI papers, reporting 105 surpassing variants on a curated 125-paper set.

  14. MobiBench: Multi-Branch, Modular Benchmark for Mobile GUI Agents

    cs.AI 2025-12 conditional novelty 6.0

    MobiBench reaches near-human offline evaluation fidelity for mobile GUI agents by accepting any valid action at each step, and enables modular attribution of performance to agent components.

  15. Dynamic Generation of Multi-LLM Agents Communication Topologies with Graph Diffusion Models

    cs.CL 2025-10 unverdicted novelty 6.0

    GTD generates task-adaptive, sparse communication topologies for multi-LLM agents via guided iterative graph diffusion steered by a proxy model predicting accuracy, utility, and cost.

  16. Better Harnesses, Smaller Models: Building 90% Cheaper Agents via Automated Harness Adaptation

    cs.SE 2026-07 conditional novelty 5.0

    Automatically adapted agent harnesses let capable SLMs recover most frontier-LLM accuracy on repetitive business tasks at a few percent of the inference cost.

  17. SKILL-DISCO: Distilling and Compiling Agent Traces into Reusable Procedural Skills

    cs.AI 2026-06 unverdicted novelty 5.0

    SkillDisCo distills reusable PFSM subgraphs from successful agent traces and compiles them into callable procedural skills, improving success rates and reducing turns on ALFWorld and WebArena.

  18. Towards Large Reasoning Models: A Survey of Reinforced Reasoning with Large Language Models

    cs.AI 2025-01 unverdicted novelty 3.0

    The paper surveys reinforced reasoning techniques for LLMs, covering automated data construction, learning-to-reason methods, and test-time scaling as steps toward Large Reasoning Models.