arXiv AI
Jul 24
From Agent Failures to Text Policies: What Works and What Breaks
arXiv:2607. 20668v1 Announce Type: cross Abstract: TextGrad improves language-model systems by revising text from feedback.
GEPA-Curator: Curated Learning for Self Improving Agents
GEPA-Curator is a framework that enhances prompt optimization for large language model agents by selecting which agent experiences should inform the optimizer. It includes task curation to filter out noisy or unreliable tasks and prior success retrieval to provide successful trajectories as context. Experiments on GoBrowse, ALFWorld, AppWorld, and τ‑bench show that GEPA-Curator matches or surpasses baseline performance, achieving up to 20.7% improvement over GEPA and 21.2% over ACE.
Related stories
arXiv AI
Jun 30
Pushing Forward Pareto Frontiers of Proactive Agents with Behavioral Agentic Optimization
arXiv:2602. 11351v2 Announce Type: replace Abstract: Proactive large language model (LLM) agents aim to actively plan, query, and interact over multiple turns, enabling efficient task completion beyond passive instruction following and making them essential for real-world, user-centric applications.
arXiv AI
Sep 28
Combee: Scaling Prompt Learning for Self-Improving Language Model Agents
Combee is a new framework that scales prompt learning for self‑improving language model agents by enabling many agents to run in parallel while learning from their combined traces. It uses parallel scans, an augmented shuffle mechanism, and a dynamic batch size controller to maintain quality and reduce delay. Experiments on AppWorld, Terminal‑Bench, Formula, and FiNER show up to 17× speedup over prior methods with comparable or better accuracy at similar cost.
arXiv AI
Aug 28
Naive Prompt Optimization: Rethinking the Need for Complex Prompt Search
Naive Prompt Optimization (NPO) is a lightweight, single‑lineage method that iteratively refines prompts using a teacher model’s rollout feedback. It matches or surpasses the performance of more complex optimizers like GEPA while requiring fewer rollouts, and its advantage grows with stronger teacher models. In interactive games, NPO remains competitive, and prompts optimized by NPO transfer well to other student models within the same family.
arXiv AI
Aug 18
Evo-Harness: Context-to-Harness Skill Compilation for Self-Evolving Agents
arXiv:2608. 15071v1 Announce Type: new Abstract: Learning from experience is critical for developing capable, self-improving large language model (LLM) agents.
Hugging Face Trending Papers
Aug 10
From Relevance to Execution Utility: Reward-Aware Dynamic Execution Gating for Skill-Based LLM Agents
Agent skills are increasingly used to equip large language model (LLM) agents with reusable procedural knowledge. Although recent work has substantially improved skill retrieval due to the increasing skill libraries, retrieving a plausible skill bundle does not guarantee that executing it is worthwhile.
arXiv Computation and Language
Oct 12
Proactive Agentic Orchestration
The paper introduces POrchestra, a proactive agentic orchestration framework that lets sub‑agents request harness adjustments during execution, enhancing adaptability to dynamic environments. It also proposes On‑Policy Orchestration Distillation (OPOD), which uses hindsight feedback from sub‑agents’ requests to provide targeted improvement signals for training the orchestration policy. Experiments on three long‑horizon benchmarks show that POrchestra boosts task success by about 9.1% over the best baseline, and with OPOD the improvement rises to 10.0%, while also improving cost‑performance trade‑offs.
arXiv Machine Learning
Sep 22
Strategy Accumulation and Guided Execution for Automated LLM Fine-Tuning
The paper introduces Strategy Accumulation and Guided Execution (SAGE), a two-stage framework that makes automated fine-tuning of large language models cumulative. In the first stage, a multi-agent pipeline uses Monte Carlo Tree Search to explore training strategies while a Distillation Agent records task-specific insights and cross-task confidence scores into a structured repository. In the second stage, SAGE retrieves relevant experience from this repository to guide training on new tasks, achieving a 12.4‑percentage‑point improvement over a baseline pipeline without accumulated experience on nine unseen tasks.
arXiv AI
Aug 11
From Relevance to Execution Utility: Reward-Aware Dynamic Execution Gating for Skill-Based LLM Agents
arXiv:2608. 09168v1 Announce Type: new Abstract: Agent skills are increasingly used to equip large language model (LLM) agents with reusable procedural knowledge.
arXiv AI
Jul 13
Improving Language Agents through BREW: Bootstrapping expeRientially-learned Environmental knoWledge
arXiv:2511. 20297v2 Announce Type: replace Abstract: Large Language Model (LLM)-based agents are increasingly capable of complex, multi-step tasks such as GUI automation, tool use, and data manipulation, yet they cannot learn from experience: each new session rediscovers solutions from scratch.
arXiv AI
Aug 12
RLMOpt: Adaptive Prompt Optimization via Recursive Language Models
arXiv:2608. 10471v1 Announce Type: new Abstract: Prompt optimizers automate the search for prompts that improve language-model performance, but existing methods rely on a predefined optimization procedure: the algorithm determines which candidates to explore and how the search progresses, while the language model generates or refines prompt proposals.
arXiv AI
Oct 28
When the Critic Falls Behind: Co-Evolving Rubrics and Harnesses for Continual Agent Self-Improvement
The paper introduces RuHarness, a framework that co‑evolves rubrics and harnesses to enable continual self‑improvement of autonomous agents that rely on large language models. RuHarness automatically discovers and reassesses behavioral criteria from execution trajectories, prioritizes unresolved weaknesses, and uses these insights to guide targeted harness updates while keeping the task objective unchanged. Experiments across varied agent tasks and backbone models demonstrate that RuHarness outperforms existing harness‑evolution baselines, especially on unseen held‑out tasks, and that its adaptive rubric prioritization supports sustained improvement and stable generalization over successive evolution rounds.