Skip to main content
Search

# LLM-Driven Evolutionary Search

3 related articles

Subscribe to updates
  1. arXiv

    Geospatial algorithms start rewriting their own code: seeded with Two-stage K-Models, an evolved version beats its seed across 150 simulated grids

    Geospatial algorithm improvement has long relied on researchers hand-crafting each structural fix; an LLM-driven multi-agent framework now delegates candidate generation, evaluation and selection to automated search while the researcher defines the problem and the evaluation. Seeded with Two-stage K-Models and using the Rand Index against the ground-truth partition as fitness, the evolved algorithm was frozen and applied unchanged to 11 real datasets, reaching the lowest cross-dataset mean RMSE and the highest SSR Reduction across climate, health, hydrology and politics.

  2. arXiv

    Evolved LLM features lift credit-risk classification from chance to 69.0% and expose zero-shot single-class bias

    The authors propose an evolutionary framework in which an LLM iteratively generates and refines natural-language binary features (rubrics), an LLM scores each sample against them, and the resulting vectors train a transparent classifier such as logistic regression; across AG News, GoEmotions, and HELOC, evolved features beat single-shot rubrics by +2.9 pp on average and outperform zero-shot LLM classification on two of three tasks, with the zero-shot LLM reaching only 50.7% on HELOC (near chance with a strong single-class bias) while evolved features reach 69.0% with balanced, auditable predictions.

  3. arXiv

    MILO co-evolves agent harnesses and their search strategy, reaching 86.1% on Terminal-Bench 2.1 above the official leaderboard top and tightening three mathematical bounds

    MILO (Meta-evolutionary Island Orchestration) co-evolves an agent harness together with the strategy that discovers it: a hierarchical island-based lineage memory treats rejected mutations as negative evidence, per-island mutator agents rewrite complete harnesses, and an orchestrator adapts the search through lineage grafting, speciation, mutator reassignment, and curriculum revision; across Terminal-Bench 2.1, PaperBench, and DeepSWE it improves resolution over its initial harness by 12.0%, 28.3%, and 10.3% with Opus 4.8 (versus best prior-search gains of 4.5%, 18.3%, and 0%), reaches 86.1±2.0% on Terminal-Bench 2.1 (official leaderboard top 83.8±2.

You’re all caught up