Skip to content

MOAE: Multi-Objective Agent Evolution with Pareto-Preserving Search

Sep 2026 · 0 citations · 25 references
Computer Science

TL;DR

Multi-Objective Agent Evolution (MOAE) is introduced, which organizes iterative in-context refinement as a Pareto-preserving evolutionary search over complete agent rollouts and consistently improves task performance and trajectory quality while maintaining strong safety under matched rollout budgets.

Abstract

As LLM-based agents continue to advance, their evaluation has become increasingly multifaceted: a capable agent must not only achieve high task completion accuracy but also perform well in interaction quality, safety, and efficiency, raising a central question: can these objectives be optimized simultaneously? Existing methods have considered multiple objectives, but many collapse heterogeneous measurements into a fixed scalar score. Such scalarization depends on metric normalization and preference weights and may discard candidates that represent useful deployment trade-offs. We introduce Multi-Objective Agent Evolution (MOAE), which organizes iterative in-context refinement as a Pareto-preserving evolutionary search over complete agent rollouts. Given a limited rollout budget, MOAE maintains an empirical archive of non-dominated candidates, uses objective-specific diagnostics to guide offspring generation, and applies constraint-aware selection only at deployment. This separates candidate preservation during search from the preference used to return a final solution. The procedure requires no parameter updates and allows each objective to be replaced by any measurable property, which we instantiate as task performance, trajectory quality, and safety. Experiments on TravelPlanner and AgentDojo show that MOAE consistently improves task performance and trajectory quality while maintaining strong safety under matched rollout budgets. Search-behavior analysis further shows that Pareto preservation expands the attainable objective region and increases the frequency of joint improvement. These results demonstrate the potential of Pareto-preserving in-context evolution for optimizing multiple agent properties without committing to a fixed scalarization during search.

View source

Similar papers

Preprint Aug 2026

Entropy-Augmented Multi-Objective Policy Optimization in Multiagent Systems

This work introduces an entropy-augmented policy evaluation strategy that incorporates an entropy bonus into agent fitness scores, discouraging behavioral homogeneity across the evolving population.

Jamie Santos, Ayhan Alp Aydeniz, Raghav Thakar et al. · 0 citations
Preprint Aug 2026

OptiMAS: Automatically Optimize Multi-Agent System

This work presents OptiMAS, a task-agnostic agentic optimizer that leverages textual interaction trajectories and task feedback as loss signals for end-to-end MAS evolution and sustains performance improvement over extended optimization horizons.

Yuxin Cheng, Chang Liu, Hanxin Yu et al. · 0 citations
#artificial intelligence Preprint Sep 2026

MoFlow: Multi-Objective Agentic Workflow Generation

MoFlow formulates workflow generation as a multi-objective Markov decision process and solves it by leveraging Convex-Hull Monte Carlo Tree Search with optimistic set-valued backups, where every node stores a set of reachable trade-offs rather than one weighted score.

Yining Lu, Aurélie C. Lozano, Xi Yang et al. · 0 citations
Conference Open access Jul 2026

An Unbounded Archive-Based Transfer Strategy for Dynamic Multi-Objective Optimization with a Changing Number of Objectives

Dynamic multi-objective optimization with a variable number of objectives is difficult because objectivedimensional variations may significantly change the Pareto front and degrade algorithm adaptability. This paper proposes an unbounded archive-based transfer strategy (UATS), which maintains an unbounded archive of of...

Zhi-Yun Xiao, Ke Shang, Ya-Jun Liu et al. · 0 citations
Preprint Aug 2026

Exploit More, Explore Smarter for Budget-Constrained Agentic Search

This work introduces ExTS, a tree-search policy that treats expansion itself as a value-of-information decision, and introduces pilot-run diagnostics that characterize what makes budget-constrained agentic search problems structurally different from one another, providing both understanding of the problem space and pra...

Haoyang Fang, Bernie Wang · 2 citations
Preprint Aug 2026

Loreley: Repository-Scale Program Evolution with Quality-Diversity Search

This work compares configured Loreley QD, sequential champion editing, and independent root proposals in a matched Zstandard experiment and finds that Sequential had the highest observed 48-job mean and median and established a QD advantage.

Mo Chen · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.