arXiv Machine Learning
MOCHA: Multi-Objective Chebyshev Annealing for Agent Skill Optimization
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv AI
Jul 7
SkillOpt-Lite: Better and Faster Agent Self-evolution via One Line of Vibe
arXiv:2607. 03451v1 Announce Type: cross Abstract: While skill optimization for autonomous agents has gained traction, existing methods rely on complex pipelines.
arXiv AI
Jul 24
InferenceBench: A Benchmark for Open-Ended LLM Inference Optimization by AI Agents
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 AI
1d ago
Prompt Codebooks: Discrete Compositional Optimization for Language Model Instruction Refinement
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 AI
Jun 4
SePO: Self-Evolving Prompt Agent for System Prompt Optimization
arXiv:2606. 04465v1 Announce Type: cross Abstract: System prompt optimization improves agent behavior without modifying the underlying model, yielding human-readable, model-agnostic instructions.
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
Oct 2
SkillLens: Adaptive Multi-Granularity Skill Reuse for Cost-Efficient LLM Agents
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.