arXiv AI By Prithwish Jana, Mononito Goswami, Hao Liu, Xinyu Li, Langlin Huang, Zhehui Huang, Zhishen Huang, Patrick Bl\"obaum, Anoop Deoras, Purak Jain, Nikos Kanakaris, Sahika Genc

MILO: Automated Harness Discovery via Orchestrated Multi-Agent Evolution

Read the original on arXiv AI →

The Flow has not summarised this story yet — read it at arXiv AI.

arXiv Machine Learning
Sep 25

EvoTreeNAD: Genealogy-Guided Evolution for LLM-Driven Neural Architecture Discovery

EvoTreeNAD is a genealogy‑guided evolutionary algorithm that autonomously discovers neural architectures without a predefined seed or search space. Starting from an empty root, it builds a persistent genealogy where each node represents a complete architecture; top‑percentile values from nodes and descendants steer lineage selection. The method combines an Idea Agent that proposes variants and a Code Agent that implements them, with theoretical analysis showing stationary variation regimes and empirical results demonstrating superior performance on CIFAR‑10/100 and MedMNIST‑v2 tasks.

By Lishan Yu, Derek Jiu, Qizhen Lan, Xiaoqian Jiang
arXiv AI
3d ago

Self-Evolving Harness on Multiple Tasks with the Agent as Its Own Optimizer

The paper introduces a self‑evolving harness framework where a frozen language‑model agent first solves tasks and then edits its own harness based on run records. Using a 49‑line seed harness, the evolved harness improves average scores on in‑distribution benchmarks by 4.48 points and on out‑of‑distribution benchmarks by 12.64 points, surpassing Codex on the former and matching it on the latter. Continued evolution on a specific out‑of‑distribution benchmark further raises performance, and the study analyzes emergent mechanisms such as output truncation and history compaction.

By Qiankai Xu
arXiv AI
Aug 20

Eureka: Task-Conditioned Meta-Agent Orchestration for Scientific Discovery

Eureka is a task‑conditioned Meta‑Agent architecture that transforms long‑horizon scientific tasks into dynamic obligation graphs with explicit acceptance semantics. During execution it constructs Macro‑Agents equipped with specialized state, memory, operators, tools, verifiers, and local topology, using receding‑horizon planning, architecture promotion, and minimal‑sufficient compilation. The system demonstrates strong empirical performance, completing all 170 recursive tasks, generating 3,948 certificates without false acceptances, and achieving significant reductions in input size, recomputation, and consistent serialization across 16,000 concurrent executions.

By Alizer Wong, Heng Cui, Yi Tan, Xiongchao Zhan, Liang Lin, Yuxiang Guo, Zhaorong Dai, Zixin Zeng, Wenyuan Li