Mara Chain: Rethinking Failure as a Stepping Stone for AI System Auto-Evolution
cs.LG, cs.AI
Submitted: 2026-09-25
Updated: 2026-09-25
Code: https://github.com/ant-research/AntOmniEvo
License: http://creativecommons.org/licenses/by/4.0/
The gist: Optimizing deployed AI systems increasingly amounts to editing prompts, skills, harnesses, and code rather than model weights.
Abstract
Optimizing deployed AI systems increasingly amounts to editing prompts, skills, harnesses, and code rather than model weights. Existing approaches commonly optimize these artifacts through propose-evaluate-select procedures, where candidate configurations are evaluated and only those meeting an acceptance criterion are selected. Yet our analysis shows that discarded candidates often contain information critical for subsequent optimization. Discarding them causes later proposals to revisit the same failure modes. We introduce Mara Chain, a refinement procedure that turns rejected candidates into stepping stones. Rather than discarding a rejected candidate, Mara Chain retains and iteratively refines it using evidence accumulated across preceding attempts. The procedure limits each refinement chain to a fixed depth and applies Pareto-filtered Top-N selection to bound the candidate pool. Across AppWorld skill optimization, TerminalBench 2.1 harness optimization, and MuSiQue retrieval-pipeline optimization, Mara Chain delivers greater task-performance gains with fewer rollouts. It outperforms GEPA, ACE, and SkillOpt-Lite by up to 20.5% in relative performance on AppWorld, reaching the target score with 65.5% fewer rollouts than GEPA. It improves the pass rate by 20.2 and 22.5 percentage points over AHE and Meta-Harness on TerminalBench 2.1, respectively, and improves MuSiQue test nDCG@10 and Recall@10 by 0.104 and 0.131 over a hand-written retrieval pipeline.
Sources
- PromptWizard: Task-Aware Prompt Optimization Framework
- GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning
- SkillCAT: Contrastive, Assessment-Augmented and Topology-AwareSkill Self-Evolution for LLM Agents
- Trace is the Next AutoDiff: Generative Optimization with Rich Feedback, Execution Traces, and LLMs
- Promptbreeder: Self-Referential Self-Improvement Via Prompt Evolution
- Automated Design of Agentic Systems
- DSPy: Compiling Declarative Language Model Calls into Self-Improving Pipelines
- Meta-Harness: End-to-End Optimization of Model Harnesses
- Agentic Harness Engineering: Observability-Driven Automatic Evolution of Coding-Agent Harnesses
- AutoHarness: improving LLM agents by automatically synthesizing a code harness
- Terminal-Bench: Benchmarking Agents on Hard, Realistic Tasks in Command Line Interfaces
- Illuminating search spaces by mapping elites
- AlphaEvolve: A coding agent for scientific and algorithmic discovery
- Optimizing Instructions and Demonstrations for Multi-Stage Language Model Programs
- Automatic Prompt Optimization with "Gradient Descent" and Beam Search
- SkillOpt-Lite: Better and Faster Agent Self-evolution via One Line of Vibe
- MuSiQue: Multihop Questions via Single-hop Question Composition
- Voyager: An Open-Ended Embodied Agent with Large Language Models
- Agent Workflow Memory
- Optimas: Optimizing Compound AI Systems with Globally Aligned Local Rewards
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks