MILO is a framework for automatically discovering better harnesses for agentic systems. It uses a meta-evolutionary approach: an inner loop evolves harnesses while an outer loop evolves the search strategy itself, leveraging hierarchical lineage memory, per-island mutator agents, and an orchestrator that adapts the search when progress stalls.
Across Terminal-Bench 2.1, PaperBench, and DeepSWE, MILO-discovered harnesses outperform eight state-of-the-art harnesses and six search methods. On Terminal-Bench 2.1 it achieves 86.1±2.0%, surpassing the official leaderboard top entry (83.8±2.3%) while using 26% fewer tokens than its initial harness. It also improves best-known bounds on EinsteinArena open problems.
This is interesting because harness design is a combinatorial space typically tuned manually and re‑done as models change. MILO automates this search and adapts the search strategy itself, avoiding the narrow exploration of prior automated methods.