Three skill optimizers stall at zero on 4 of 6 tasks — Chebyshev scalarization unsticks them
Notes on MOCHA: Multi-Objective Chebyshev Annealing for Agent Skill Optimization (arXiv:2605.19330) — Mahmud Tanjim, Jayakumar Subramanian, Xiang Chen, B. Kveton, Subhojyoti Mukherjee, Anlan Zhang, Sungchul Kim, Somdeb Sarkhel, S. Choudhury · May 2026
Note published · written by SkillFed’s research pipeline from the paper above · how these notes are made
AI-assisted notes · reviewed by SkillFed Skill evolution Bridge: evolution × benchmarksAgent skills aren't single prompts — they're multi-field specs bound by hard platform limits: a description field truncated at 1,024 characters for routing, an instruction body capped at 5,000 characters and chopped down further via progressive disclosure, and a context budget shared with whatever other skills are co-resident. Optimizing a skill means hitting several of these targets at once, not just raising one accuracy score. Prior prompt optimizers dodge that reality — they either ignore the constraints outright or collapse performance and compliance into a single weighted number, which throws away any solution sitting in a non-convex fold of the trade-off surface. MOCHA replaces that weighted sum with Chebyshev scalarization: minimize the worst weighted gap to an ideal point, a formulation that reaches every point on the Pareto front, non-convex regions included. An exponential annealing schedule rides on top, letting the search roam broadly early and lock onto a specific trade-off direction as the budget runs out.
Across six skills — GPQA and TheoremQA for reasoning, HoVer, HotpotQA and FEVER for multi-hop QA and fact verification, and DebugBench for code debugging — three established optimizers (TextGrad, ProTeGi, GEPA) burned 1,000 rollouts each and handed back the untouched seed skill on 4 of the 6 tasks. Zero measurable progress. MOCHA improved every task: a mean correctness of .675 against .628 for the strongest baseline (ProTeGi), a 7.5% relative gain that reached 14.9% on FEVER and 10.4% over the runner-up on TheoremQA. It also surfaced roughly twice as many Pareto-optimal skill variants on average — 3.6 versus 1.6 — with a higher 3-D hypervolume, meaning it hands back more usable trade-off points, not just one better one.
Key numbers
| Tasks where baselines never moved off the seed skill | 4 of 6 |
| Mean correctness gain over strongest baseline | +7.5% relative |
| Best-case gain, FEVER (vs. seed) | +14.9% relative |
| Gain on TheoremQA over next-best optimizer | +10.4% relative |
| Pareto-optimal variants found, MOCHA vs. baselines | 3.6 vs. 1.6 (avg.) |
Skills related to this research
Related research
Related notes
- Skill pass rates jump from 33.6% to 88.0% — with zero gradient steps →
- 0 of 9 add-skill edits improved pass rate; cost fell up to 31.7% vs. static bundles →
- Text-based skill edits beat trained baselines by 6.7 points →
- Train the skill, not the model: frozen GPT-4o-mini jumps from 6% to 42% on GAIA →
- Skill folders, not weights: +12.1 points on noisy-retrieval QA →
- Splitting skill-writing into create, merge, and improve lifts a 27B agent up to 4.5 points -- merge drives generalization, improve drives specification, and neither alone gets you there →
- +8.9 percentage points, p=0.71: Skills stall out when the tool layer already talks back →
- 48% of the time, agents don't even read their own skill file →
- One in Four Model-Generated Skills Backfires on the Agent Using It →
References
- MOCHA: Multi-Objective Chebyshev Annealing for Agent Skill Optimization — Tanjim et al., 2026 (arXiv:2605.19330)
- TextGrad: Automatic Differentiation via Text — Yuksekgonul et al., 2024
- Automatic Prompt Optimization with "Gradient Descent" and Beam Search (ProTeGi) — Pryzant et al., 2023
- GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning — Agrawal et al., 2025