arXiv:2607. 03451v1 Announce Type: cross Abstract: While skill optimization for autonomous agents has gained traction, existing methods rely on complex pipelines.
arXiv:2607. 20468v1 Announce Type: new Abstract: AI agents are increasingly used to automate research and development tasks, yet existing benchmarks typically evaluate them on prescribed workflows or narrow action spaces.
arXiv:2605.28360v3 Announce Type: replace Abstract: Automatic prompt optimization (APO) has driven significant gains in LLM-based agentic workflows. However, most existing methods treat each task's p...
arXiv:2606. 04465v1 Announce Type: cross Abstract: System prompt optimization improves agent behavior without modifying the underlying model, yielding human-readable, model-agnostic instructions.
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.
SkillLens introduces a hierarchical skill-evolution framework that organizes skills into a four-layer graph of policies, strategies, procedures, and primitives, allowing retrieval at mixed granularity. The system first retrieves semantically relevant skill seeds, expands them via a degree‑corrected random walk, and uses a verifier to decide whether to accept, decompose, rewrite, or skip each visited unit. This approach enables agents to reuse compatible subskills while locally adapting mismatched components, and theoretical analysis shows sublinear cost under sparse mismatch assumptions, with empirical results on MuLocbench and ALFWorld demonstrating consistent improvements over strong baselines.
arXiv:2608. 09168v1 Announce Type: new Abstract: Agent skills are increasingly used to equip large language model (LLM) agents with reusable procedural knowledge.
arXiv:2607. 05297v1 Announce Type: new Abstract: Recent LLM agents tackle increasingly long-horizon, open-ended tasks, and external skills, reusable procedural knowledge supplied to the agent, further extend this capability.
arXiv:2607. 09375v1 Announce Type: new Abstract: We present Mach-Mind-4-Flash, a 35B-parameter Mixture-of-Experts (MoE) agentic model with 3B activated parameters.
arXiv:2608. 06714v1 Announce Type: new 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.
arXiv:2609. 37968v1 Announce Type: new Abstract: Advances in the coding capabilities of LLM agents allow them to inspect and modify their own instructions, tools, and execution procedures.
The paper introduces AgenticBBO-Bench, a cross‑domain benchmark for evaluating large language model agents on black‑box optimization tasks such as synthetic functions, hyperparameter tuning, database tuning, chip design, and molecular design. Experiments show that agentic BBO outperforms direct LLM‑based methods in all five domains and beats the best numerical optimizers in four. The study also analyzes the impact of optimization tools, task semantics, prior knowledge, and the LLM’s role, finding that numerical tools are not consistently helpful, task semantics are broadly useful, and numerical optimizers can capitalize on agent‑generated search trajectories.