What Makes Good Agentic Data? an ACE Lens on Data Generation for LLM Agents

Xingshan Zeng, Zishan Xu, Boju Zhang, Yuzhou Wu, Lingzhi Wang, Jianghao Lin, Liangyou Li, Yasheng Wang, Lifeng Shang, Xin Jiang, Weinan Zhang, Yong Yu, Qun Liu, Weiwen Liu

A unified framework for agentic data generation using the Accuracy–Complexity–Diversity (ACE) lens.

What are the essential properties of high-quality data for training LLM agents, and how can we systematically evaluate or generate such data?

Agentic data generation is currently fragmented, with domain-specific methods conflating how data is constructed with how it is verified and allocated. This makes it difficult to compare pipelines across tool-use, software engineering, and embodied domains. The authors introduce a factorized data object $(E, q, \tau, v)$—representing environment, task, interaction, and verifier—and organize generation pipelines by their dependency structure. They propose the Accuracy–Complexity–Diversity (ACE) lens to formalize generation as a constrained distribution-design objective. This framework reveals a shift toward execution-grounded accuracy, learner-relative complexity, and behavioral diversity, providing a common language to evaluate and scale agentic experience.

Paper Primer

The paper defines agentic data as a four-factor object: an environment specification ($E$), a task signal ($q$), an interaction realization ($\tau$), and an optional verifier ($v$). This factorization separates the components of an interactive problem from the specific training paradigm, allowing for a unified taxonomy of generation pipelines.

Generation pipelines are categorized by their primary anchor and dependency structure: forward pipelines ground tasks in existing environments, reverse pipelines derive tasks from observed trajectories, and structure-first pipelines use intermediate blueprints to coordinate factors. The ACE lens acts as a gatekeeper: accuracy establishes the feasible support of valid data, while complexity and diversity shape the distribution of useful learning mass within that support.

Accuracy is a non-negotiable admission condition for agentic data.

The authors define accuracy as a conjunctive validity decision $A(d) = V_E(E) \land V_q(q \mid E) \land V_\tau(\tau \mid E, q) \land V_v(v \mid E, q, \tau)$, where invalid data cannot be compensated for by increased complexity or diversity. The framework mandates that if no candidate passes the accuracy gate, the utility of the generation process is zero.

Why is the ACE framework necessary when existing domains already have their own evaluation metrics?

Existing domain-specific metrics conflate generation mechanisms with application domains, making it impossible to compare, for example, a GUI agent's data pipeline with a scientific discovery agent's pipeline. ACE provides a cross-domain analytical lens that separates the construction of data from the objectives used to evaluate its utility.

How does the paper define "complexity" in a way that is useful for training?

Complexity is defined as the difficulty induced by a grounded task for a specific learner configuration, measured by the verified failure probability. Useful data is not simply "hard," but occupies a learnable band near the model's current capability frontier.

Researchers should shift from domain-specific data generation to a factorized approach, using the ACE lens to explicitly separate the validity of the environment and task from the learner-relative difficulty of the interaction.

The ACE Lens for Agentic Data

We define the ACE framework that structures agentic data generation beyond simple instruction synthesis.

Agentic data generation must keep environment, task, interaction, and verifier signals mutually consistent, unlike ordinary instruction synthesis which only cares about surface text.

ACE organizes the three core requirements—Accuracy, Complexity, Diversity—so that generated agentic data is valid, appropriately challenging, and non‑redundant.

How does ACE differ from typical data‑quality checklists used in instruction‑tuning datasets?

Typical checklists focus on surface properties such as grammar or token‑level correctness. ACE, by contrast, requires four‑way consistency (environment, task, interaction, verifier), a learner‑relative difficulty curve, and explicit non‑redundancy across the full tuple $(E, q, \tau, v)$. This makes the data useful for training agents that must act in the world, not just generate text.

**Figure 1.** The ACE framework for Agentic Data, comprising Accuracy, Complexity, and Diversity, which are influenced by the Environment, Task, Interactions, and Verifier components.

**Figure 1.** The ACE lens views agentic data generation as constrained distribution design: Accuracy defines valid support, while learner-relative Complexity and Diversity shape useful, non-redundant experience over $(E, q, \tau, v)$.

Agentic data differs from instruction‑tuning data because it must be simultaneously valid, appropriately challenging, and uniquely diverse for the learner.

Defining the Agentic Data Object

Formulating agentic data as (E, q, $\tau$, v) unifies environment, task, interaction, and verification across domains.

Representing agentic data as a single object (E, q, $\tau$, v) captures the full ACE factors and enables systematic cross‑domain analysis.

We model tool‑augmented multi‑turn interaction as a partially observable Markov decision process (POMDP) — a standard formalism for sequential decision making under uncertainty. The tuple $M = (U, S, A, O, P, R)$ defines user intent, latent state, actions (including language and tool calls), observations, transition dynamics, and optional reward. At turn $t$, the agent selects $a_t$ based on the observable history $h_t$, and the environment returns the next state and observation.

It bundles the environment specification, task description, interaction trace, and an optional verifier into a single record that fully describes an agentic episode.

How does this data object differ from a plain trajectory log?

A plain log records only the sequence of actions and observations ($\tau$). The Agentic Data Object adds the explicit environment spec ($E$), the task signal ($q$), and an optional verifier ($v$), which together make the record self‑contained and evaluable across the ACE dimensions.

Environment parameterization captures everything needed to instantiate a concrete world for data generation. We define $e = (D, F, P_{\text{rule}}, \Omega, v)$, where $D$ is a state carrier (e.g., a repository), $F$ the available tool set, $P_{\text{rule}}$ the policy and permission constraints, $\Omega$ the observable subset of the latent state, and $v$ an optional success interface.

From interaction to agentic data we isolate three core factors: the environment specification ($E$), the task signal ($q$), and the interaction realization ($\tau$). Their sum constitutes the agentic data object, as expressed by $\text{Agentic Data} = E + q + \tau$ (Equation 5). This decomposition is conceptual, not a serialization requirement.

For the remainder of the survey we adopt the common data object $d = (E, q, \tau, v)$ (Equation 6). The optional verifier $v$ records how consistency or outcome is evaluated—via schema checks, executable tests, or learned judges—allowing the same notation to cover supervised fine‑tuning, reinforcement learning, and online generation pipelines.

Generation Paradigms

We map generation pipelines into forward and reverse paradigms, exposing their trade‑offs.

Forward pipelines dominate by grounding tasks in concrete environments, but they inherit any environment brittleness. Reverse pipelines flip control, enabling task‑centric design at the cost of extra feasibility checks.

Forward generation builds an environment first, then derives tasks conditioned on that environment, and finally obtains interaction trajectories. Sources of environments fall into three overlapping categories: (1) real or curated specifications harvested from APIs, repositories, and applications; (2) LLM‑synthesized tool and rule descriptions that expand beyond collected resources; and (3) programmatic constructions that implement databases, simulators, and stateful arenas. This ordering yields strong grounding because later factors are conditioned on an existing environment, but it also creates a cascading dependence where any brittleness in the environment propagates to tasks and trajectories. Recent pipelines mitigate this risk by inserting verification checks at each stage—environment sanity, task feasibility, and trajectory validity.

Reverse generation departs from the $E\!\to\!q\!\to\!\tau$ order and anchors the pipeline on a different artifact. Task‑first methods start from a target capability or instruction pattern and then synthesize compatible tools, environments, and interactions. Trajectory‑first approaches explore or mine existing workflows before formulating the user‑facing task, ensuring executability but limiting the distribution to discovered behaviors. Structure‑first pipelines first generate an intermediate scaffold—such as a tool graph, dialogue skeleton, or blueprint—and then flesh out environments, tasks, and trajectories. Adaptive and self‑evolving extensions close the loop by continuously revising generation strategies based on verification outcomes and model performance.

**Figure 3.** Generation Paradigms: Forward Generation vs Reverse Generation.

**Table 1.** Representative works in forward agentic data generation. All methods follow the dependency $E arrow q arrow \tau$. Methods are grouped according to the dominant source of environment construction: real or curated environments, LLM-synthesized environments, and programmatic or executable environments. **Resource** links to public GitHub repositories or Hugging Face websites when available.

**Table 2.** Representative works in reverse agentic data generation. Methods are grouped into task-first, trajectory-first, and structure-first generation, followed by adaptive and self-evolving approaches as a cross-cutting extension. **Domain** indicates the primary application setting, while **Resource** links to public repositories when available.

Accuracy: The Prerequisite

Fluency alone does not guarantee correctness; all four ACE factors must be satisfied.

Fluency does not imply accuracy in agentic settings because a sample can be well‑formed yet violate environment consistency, task feasibility, interaction causality, or verifier correctness.

This camp composes inexpensive deterministic tests, learned model judgments, and selective human review to filter out structural, behavioral, and semantic failures. Early rule‑based checks prune obvious errors; model‑based critics evaluate semantic coherence; human auditors intervene on ambiguous or safety‑critical cases.

Methods in this camp restrict generation to syntactically and semantically valid structures before any rollout. Blueprint verification, tool‑graph constraints, and stateful environment generators ensure that tasks, actions, and success conditions are mutually consistent from the outset.

This direction grounds accuracy in actual execution outcomes. Generated actions are run against real tools or simulators, and resulting states, tests, or formal proofs are inspected to confirm that observations follow from actions and that the verifier recognises the intended terminal condition.

Rather than discarding failed samples outright, pipelines use verification feedback to iteratively repair or regenerate components. Early‑stage failures trigger localized reconstruction, while successful seeds seed later generations, creating a self‑improving data creation loop.

The community still disagrees on the optimal trade‑off between verification cost and granularity: cheap rule‑based checks miss subtle semantic errors, while full execution‑based verification is expensive for long‑horizon tasks.

**Figure 4** Four complementary factors of accuracy: environment, task, interaction, and verifier/outcome accuracy.

**Figure 5.** Four major research directions and emerging trends in accuracy assurance for agentic data generation.

Complexity: Informative Learning Signals

Mapping the landscape of complexity methods and their trade‑offs.

Complexity methods converge on shaping task difficulty around the learner’s capability frontier, yet they differ in which factor they manipulate and how they calibrate difficulty.

Complexity is defined as the verified failure probability $C_n(d)=1-\Pr[v(d,\tau)=1\mid d,z]$, which varies with the execution configuration $z$. The ACE objective favours a moving band of tasks that are neither trivially solved nor universally unsolvable, formalised by $p_{z_0}(d)<\rho\le p_{z_A}(d)$ where $p_z(d)=\Pr[v(d,\tau)=1\mid d,z]$. Structural attributes such as horizon, dependency depth, and partial observability serve as controllable explanatory variables rather than absolute difficulty scores.

Agentic complexity decomposes into four jointly interpreted factors: environment, task‑signal, interaction‑realization, and verifier‑conditioned completion. Environment complexity stems from state‑action structure and uncertainties, while task‑signal complexity arises from compositional goals and hidden constraints beyond linguistic obscurity. Interaction‑realization complexity captures the minimal serial and parallel dependencies required, and verifier‑conditioned completion complexity reflects the strictness of success criteria.

Methods that pre‑define a dependency graph or subgoal plan before natural‑language realization, then instantiate tasks that require traversing the specified structure. By fixing depth, width, joins, and conditional edges, these approaches directly control the minimal interaction required to solve the task.

Approaches that manipulate what must be achieved (task‑side) or what information is initially available (information‑side). Withholding information creates clarification and state‑tracking burdens, while adding compositional goals or interacting constraints raises the reasoning load.

Techniques that alter the decision process by changing tool dependencies, shared state, observation protocols, or policy boundaries. These changes affect the transition dynamics and the set of actions that meaningfully influence the task.

Methods that redefine success criteria or provide richer feedback signals. By tightening verifier conditions or introducing step‑level rewards, these approaches increase the decision burden while preserving learnability.

Pipelines that start from valid seeds and progressively modify them—removing cues, strengthening goals, or extending workflows. This preserves a grounded core while allowing controlled escalation of difficulty.

Approaches that estimate verified success under a target model, scaffold, and budget, then retain candidates near a target success band. This aligns generated difficulty with the learner’s current capability.

Mechanisms that both add burden to overly easy tasks and simplify overly hard ones, often by inserting intermediate goals, procedural hints, or auxiliary agents. The execution configuration $z$ is altered while keeping the underlying instance fixed.

Complexity evaluation should pair a structural description of the manipulated factors with a behavioural calibration that reports verified success rates under a specified model, scaffold, and budget. Structural reports list goal constraints, information exposure, dependency topology, state design, horizon, branching, and verifier semantics to support controlled ablations. Behavioural reports stratify success by domain, skill, and structural band, and compare matched instances before and after interventions.

Increasing dependencies or stricter verifier conditions raises both failure risk and verification burden, making long trajectories fragile. Focusing on model‑aware difficulty can narrow diversity, while overly realistic but routine scenarios may add little useful signal. Balancing cheap structural proxies with costly model‑based calibration is essential to avoid over‑ or under‑estimating useful complexity.

**Figure 6** Learner-relative task complexity. Learning utility is maximized within a learnable band between tasks that are too easy and too difficult. This band can also shift with learner capability.

**Figure 7.** Factor-level complexity in agentic data across environments, tasks, interactions, and completion criteria.

Diversity: Breadth of Experience

Surface-level variation alone fails to yield meaningful agentic diversity; true diversity requires behaviorally distinct coverage.

Surface-level variation alone fails to yield meaningful agentic diversity; true diversity requires behaviorally distinct environment‑task‑interaction coverage.

The survey organizes the literature into five major camps, each emphasizing different mechanisms for expanding the three ACE diversity factors.

This camp expands the environment‑specification factor by adding executable APIs, tool‑state effects, and multi‑turn information flows. Pipelines increase coverage of tool families, state regimes, and policy variations, showing that richer tool pools improve out‑of‑distribution performance more efficiently than merely increasing sample counts.

This camp targets interaction‑realization diversity by varying application layouts, operating‑system modalities, and cross‑application workflows. By recombining existing UI components and injecting state changes (e.g., permissions), pipelines expose distinct interaction topologies that are not captured by mere screenshot counts.

This camp expands task‑signal diversity through repositories, build systems, and issue‑type variations. Pipelines generate multilingual code snippets, dependency graphs, and test‑driven tasks, thereby widening the set of executable software behaviors an agent must learn.

This camp enriches environment‑specification diversity by varying scenes, objects, physics, sensors, and partner policies. It also adds interaction‑realization diversity through alternative action sequences and social communication protocols, yielding richer behavioral repertoires.

This camp focuses on generator and provenance diversity by exploring materials, proteins, hypotheses, and formal proofs. The pipelines couple candidate generation with property predictors, simulators, or theorem provers, ensuring that each new candidate is validated before being added to the dataset.

**Figure 8** Four complementary factors of diversity: environment, task, interaction, and generator/provenance.

**Figure 9** Domain-specific instantiations of diversity across diverse kinds of agents. Meaningful diversity should be characterized by domain-specific behavioral units rather than surface-level variation alone.

Discussion and Future Directions

Extending ACE to scaling, data sources, and evolving generation pipelines.

The ACE framework asserts that agentic data must be consistent across environment, task, interaction, and success signals. This refresher reminds us that ACE (Accuracy, Complexity, Diversity) organizes these requirements.

Scaling under the ACE objective changes the meaning of “more data”. Simply adding raw trajectories no longer guarantees progress because each new sample contributes unevenly to accuracy, complexity, and diversity. Recent agentic studies show that targeting diversity can yield better performance than increasing sheer quantity, even with smaller budgets.

From the ACE perspective, the useful scaling variable is “effective support” rather than raw dataset size. Effective support grows by producing more valid experiences, moving probability mass toward the learner’s complexity frontier, or expanding coverage over environments, tasks, and interaction structures. The strongest strategy often balances all three dimensions instead of maximizing any single one.

Because the learner’s capabilities evolve, static quantity scaling quickly loses value. As tasks saturate and the complexity frontier shifts, generation must adapt, using failures, success rates, and coverage gaps to decide what experience to create next. This dynamic scaling aligns with self‑evolving and difficulty‑aware systems.

Real and synthetic data differ in origin. Real data come from deployed environments and capture authentic interactions, but they may contain failures, hidden context, or privacy concerns. Synthetic data are generated by models or simulators, offering explicit states and verifiable supervision, yet their correctness hinges on generator fidelity.

Under ACE, real data excel at grounding and external auditing for accuracy, while synthetic data excel at providing controlled complexity and filling diversity gaps. Neither source uniformly dominates; a hybrid mix leverages the strengths of each depending on which ACE dimension is limiting.

Most current agentic data generation is post‑training, placing a heavy burden on a late, data‑limited stage. Shifting generation earlier—into pre‑training and mid‑training—exposes models to state transitions, tool composition, and long‑horizon information seeking, reducing reliance on expensive expert rollouts.

In this earlier regime, data units need not be full (E, q, $\tau$, v) records; fragments such as local transitions, inverse‑dynamics examples, or distilled policies become useful building blocks. ACE still requires accuracy for local correctness, complexity for informative fragments, and diversity for broad priors.

Self‑evolving agents turn data generation into a continual loop: the system observes capability gaps, generates or discovers relevant experience, and updates the agent. This loop can create targeted tasks from failures, adjust difficulty, extract reusable skills, or replay prior experience.

Within this loop, ACE remains dynamic: accuracy blocks erroneous feedback, complexity calibrates the difficulty of new experience, and diversity prevents the system from focusing only on recent failures. Stable evolution also requires fixed anchors—held‑out tasks or real environments—to avoid drift.

Questions & answers

What is the main contribution of this paper?

The paper introduces two interrelated contributions: a factorized agentic data object (E, q, τ, v) representing environment, task, interaction, and verifier, and the ACE (Accuracy–Complexity–Diversity) lens that formalizes data generation as a constrained distribution-design objective applicable across agent domains.

What problem does the ACE framework address?

Agentic data generation is currently fragmented, with domain-specific methods conflating how data is constructed with how it is verified and allocated, making it impossible to compare pipelines across domains such as tool-use, software engineering, and embodied agents. ACE provides a common analytical language to evaluate and scale agentic experience across these domains.

Why is a unified framework necessary when individual domains already have their own evaluation metrics?

Existing domain-specific metrics conflate generation mechanisms with application domains, making it impossible to compare, for example, a GUI agent's data pipeline with a scientific discovery agent's pipeline. ACE separates the construction of data from the objectives used to evaluate its utility, enabling cross-domain comparison.

What are the four components of the agentic data object?

The agentic data object is defined as d = (E, q, τ, v), where E is the environment specification, q is the task signal, τ is the interaction realization (the trajectory), and v is an optional verifier that records how consistency or outcome is evaluated.

How does the agentic data object differ from a plain trajectory log?

A plain trajectory log records only the sequence of actions and observations (τ), whereas the agentic data object adds the explicit environment specification (E), the task signal (q), and an optional verifier (v), making the record self-contained and evaluable across the ACE dimensions.

What does each component of the ACE lens mean?

Accuracy establishes the feasible support of valid data by requiring four-way consistency across environment, task, interaction, and verifier. Complexity is the learner-relative difficulty of a task, measured by the verified failure probability. Diversity requires behaviorally distinct coverage across environment–task–interaction tuples, not merely surface-level variation.

How does the paper define 'complexity' for training purposes?

Complexity is defined as the verified failure probability C_n(d) = 1 − Pr[v(d, τ) = 1 | d, z], which varies with the execution configuration z. Useful data occupies a learnable band near the model's current capability frontier—neither trivially solved nor universally unsolvable—formalized as p_{z_0}(d) < ρ ≤ p_{z_A}(d).

What are the three types of generation pipelines the paper identifies?

The paper categorizes generation pipelines into forward pipelines, which ground tasks in existing environments; reverse pipelines, which derive tasks from observed trajectories; and structure-first pipelines, which use intermediate blueprints to coordinate the factors. Forward pipelines dominate but inherit environment brittleness, while reverse pipelines enable task-centric design at the cost of extra feasibility checks.

Why does fluency not imply accuracy in agentic settings?

A sample can be well-formed and grammatically correct yet still violate environment consistency, task feasibility, interaction causality, or verifier correctness. Accuracy in the ACE framework requires four-way consistency across all components of the data object, not just surface-level text quality.

How does the paper characterize meaningful diversity in agentic data?

The paper states that surface-level variation alone fails to yield meaningful agentic diversity; true diversity requires behaviorally distinct environment–task–interaction coverage. The paper organizes the literature into five major camps, each emphasizing different mechanisms for expanding the three ACE diversity factors, though it does not enumerate all five camps in detail in the provided text.

What does the paper say about scaling agentic datasets?

The paper argues that the useful scaling variable is 'effective support' rather than raw dataset size, which grows by producing more valid experiences, moving probability mass toward the learner's complexity frontier, or expanding coverage. Recent agentic studies cited in the paper show that targeting diversity can yield better performance than increasing sheer quantity, even with smaller budgets.

How does the paper compare real versus synthetic data under the ACE lens?

Real data excel at grounding and external auditing for accuracy but may contain failures, hidden context, or privacy concerns. Synthetic data excel at providing controlled complexity and filling diversity gaps but their correctness depends on generator fidelity. The paper concludes that neither source uniformly dominates and recommends a hybrid mix depending on which ACE dimension is limiting.

What does the paper recommend about when in the training pipeline agentic data should be introduced?

The paper argues that most current agentic data generation is post-training, placing a heavy burden on a late, data-limited stage, and recommends shifting generation earlier into pre-training and mid-training. In this earlier regime, data units need not be full (E, q, τ, v) records; fragments such as local transitions, inverse-dynamics examples, or distilled policies can serve as useful building blocks.

What is a self-evolving agent in the context of this framework?

A self-evolving agent turns data generation into a continual loop in which the system observes capability gaps, generates or discovers relevant experience, and updates the agent. Within this loop, ACE remains dynamic: accuracy blocks erroneous feedback, complexity calibrates the difficulty of new experience, and diversity prevents the system from focusing only on recent failures.

What are the acknowledged limitations or open challenges of the ACE framework?

The paper notes that the community still disagrees on the optimal trade-off between verification cost and granularity, since cheap rule-based checks miss subtle semantic errors while full execution-based verification is expensive for long-horizon tasks. Additionally, focusing on model-aware difficulty can narrow diversity, and balancing cheap structural proxies with costly model-based calibration is described as an essential but unsolved challenge.

How does ACE differ from typical data-quality checklists used in instruction-tuning datasets?

Typical checklists focus on surface properties such as grammar or token-level correctness, whereas ACE requires four-way consistency across environment, task, interaction, and verifier, a learner-relative difficulty curve, and explicit non-redundancy across the full tuple (E, q, τ, v). This makes ACE-compliant data useful for training agents that must act in the world, not just generate text.

What underlying formal model does the paper use to represent agentic interaction?

The paper models tool-augmented multi-turn interaction as a partially observable Markov decision process (POMDP), defined by the tuple M = (U, S, A, O, P, R) representing user intent, latent state, actions (including language and tool calls), observations, transition dynamics, and optional reward.

What venue, authors, and date are associated with this paper?

The paper does not specify author names, publication venue, or a precise publication date in the provided text; it is available on arXiv at the identifier referenced in the source URL.

Key terms

ACE lens
A three-dimensional analytical framework (Accuracy, Complexity, Diversity) proposed by the paper to evaluate and design agentic data generation pipelines across domains.
Agentic Data Object
A four-component data record d = (E, q, τ, v) that captures the environment specification, task signal, interaction trajectory, and optional verifier needed to fully describe a training example for an LLM agent.
Environment specification (E)
A parameterized description of the world in which an agent operates, including the state carrier, available tools, policy constraints, observable state subset, and success interface.
Task signal (q)
The goal or instruction given to an agent that defines what it must accomplish within a specified environment.
Interaction realization (τ)
The concrete sequence of actions and observations produced by an agent while attempting to complete a task in an environment.
Verifier (v)
An optional component of the agentic data object that specifies how the correctness or success of an interaction is evaluated, using methods such as schema checks, executable tests, or learned judges.
Verified failure probability
The probability that a specific learner configuration fails to complete a given task as judged by the verifier, used as the paper's formal measure of task complexity.
Forward pipeline
A data generation approach that grounds task creation in existing environments, deriving tasks from the available environment structure.
Reverse pipeline
A data generation approach that derives tasks from observed trajectories, enabling task-centric design but requiring additional feasibility checks.
Structure-first pipeline
A data generation approach that uses intermediate blueprints or schemas to coordinate the environment, task, and interaction factors before generating concrete data.
POMDP (Partially Observable Markov Decision Process)
A mathematical framework for sequential decision-making in which an agent cannot directly observe the full state of the environment, used in this paper to formally model agentic interaction.
Effective support
The paper's proposed scaling variable for agentic datasets, defined as the breadth of valid, appropriately difficult, and behaviorally distinct experiences rather than raw data quantity.
Capability frontier
The boundary of tasks that a learner can sometimes but not always solve, representing the zone of maximum training utility in the paper's complexity framework.
Execution-grounded accuracy
A form of data validity that requires an agent's actions and outcomes to be consistent with what would actually happen when executed in the real or simulated environment, rather than merely being textually plausible.
Learner-relative complexity
A measure of task difficulty defined with respect to a specific model's current capabilities, so that the same task may be complex for one model and trivial for another.
Self-evolving agent
An agent system that continuously generates new training experience based on observed capability gaps, updating itself in a closed loop rather than relying on a fixed static dataset.

Read the original paper

Open the simplified reader on Paperglide

Browse all simplified papers