- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper formulates agentic data synthesis as feedback-controlled experience acquisition through ANDES (Agent-Native Data Evolving Synthesis). Given a trainer-specified capability deficit, ANDES uses an evolving World Tree of topics, themes, and scenarios to select contexts for refined supervision. The paper validates ANDES on PostTrainBench across multiple post-training base models and tasks, demonstrating that ANDES improves the automated post-training capability of GLM-4.7, achieving performance on PostTrainBench comparable to that of GPT-5.5 xHigh with Codex-based automated post-training and Claude Opus-4.8 Max with Claude Code-based automated post-training.
Critical strengths
Strength 1: Organizing data synthesis as a process that continually adapts to feedback has clear methodological value. ANDES connects task requirements, data generation, quality revision, and diagnostic feedback, allowing the training agent to adjust subsequent synthesis goals based on shortcomings in the existing data. This addresses a key need in automated post-training: deciding not only how to generate data, but also what data to generate next.
Strength 2: The world tree offers a concrete way to balance task relevance and data diversity. The Topic–Theme–Scenario hierarchy links broad task requirements to specific settings. Combined with task-aware routing and subtree expansion, it allows the method to focus on target capabilities while exploring varied contexts. Although its advantages over other organizational structures remain to be tested, it provides a clear and practical way to control the coverage of synthetic data.
Strength 3: The comparison under the same training scaffold provides direct evidence of effectiveness. With the same custom training scaffold, adding ANDES raises the overall PostTrainBench score from 21.56% to 34.40%. This comparison is more informative than a comparison with the OpenCode baseline alone, as it suggests that the gains do not simply come from improvements to the training framework. Ablations of the world tree and interactive feedback further support the contributions of these components.
Strength 4: The evaluation covers multiple target models and tasks. The paper evaluates four target base models on tasks including mathematical reasoning, code generation, and tool use, and reports results from repeated runs.
Overall, in the context of the current research trend toward recursive self-improvement, I find the core idea of this paper meaningful. Its essential contribution lies in progressively expanding the model's learning boundary according to its current capability level, enabling the model to acquire knowledge of previously unseen topics and tasks. This direction carries meaningful implications for the advancement of RSI research.
Critical weaknesses
My main concerns are as follows.
1. Unclear construction and generalization of the world tree.
The paper reports the size of the initial world tree, but does not explain how it was constructed, the extent of model or human involvement, or the associated costs. Moreover, subsequent evolution only expands Themes and Scenarios without updating top-level Topics, which may limit adaptability to new domains and cross-domain tasks. Given the apparent complexity of the world tree, would transferring the method to a new domain (such as finance) require rebuilding it from scratch?
2. Insufficient justification for using a tree structure.
The paper does not adequately explain why a tree structure is chosen to manage data evolution. Since different Topics and Scenarios may overlap, could this structure limit the representation of cross-domain tasks? What advantages does it offer over alternatives such as graph structures?
3. Unclear model capability boundaries and data filtering criteria.
The paper does not clearly define how the post-trained model's capability boundary is determined or how challenging but valuable samples are distinguished from invalid ones. Could the current filtering mechanism discard difficult samples that are essential for expanding the model's capabilities, thereby limiting further improvement? I suggest further justifying the filtering criteria and providing relevant ablation studies.
4. Insufficient separation between the benefits of external strong models and the method itself.
ANDES uses GPT-4o for routing, generation, revision, and evolving, while GLM-4.7 handles training decisions, whereas some baselines mainly rely on a single model. This comparison does not adequately control for the additional resources provided by external models, making it difficult to determine whether the gains come from ANDES itself or the capabilities of these stronger models. I suggest conducting fair comparisons under matched model resources and compute budgets, along with relevant ablation studies.
5. Insufficient comparisons with stronger baselines and Agent Harnesses.
The paper uses OpenCode as the primary baseline agent harness but lacks comparisons with newer frameworks, such as Claude Code and Codex, using the same underlying model. Moreover, the experiments do not adequately cover the latest generation of advanced models. I suggest comparing GLM-4.7 with Claude Code and Codex, evaluating ANDES with models such as GLM-5.2, GPT-6 Astra, and Claude Opus 5.5, and comparing the results against systems such as GPT-6 Astra with Codex and Claude Opus 5.5 with Claude Code. These experiments would help establish whether ANDES still provides meaningful gains with stronger models and Harnesses. In addition, recent work such as RSIBench-Data has proposed more general data evolution methods, as discussed in the survey Data-centric recursive improvement for foundation models: A survey. Furthermore, the models used for post-training in their experiments are relatively small-scale (1.7B-8B), and it remains uncertain whether the proposed approach generalizes effectively to larger-scale LLMs. The paper lacks systematic comparisons with these approaches, and I encourage the authors to add relevant experiments.
Questions for authors
See weakness.
7 comments
Response to Reviewer p9S8 (Part 2/4)
W2: Why a Tree Rather Than a Graph, and How Overlap Supports Cross-Domain Tasks
Graph-based synthesis provides a relevant alternative for organizing training-data generation. GraphGen [2] builds a knowledge graph from source text and uses neighborhood sampling to generate atomic, aggregated, and multi-hop QA pairs. CGMIS [3] traverses a concept graph to construct reasoning paths and synthesize verifiable multi-hop instructions. In these methods, graph relations and paths guide the content and reasoning dependencies of generated examples.
ANDES instead uses the World Tree to organize synthesis contexts and allocate the acquisition budget. The Topic-Theme-Scenario hierarchy directly matches its sampling and update rules: suitability routing adjusts Topic-level sampling weights, Themes and Scenarios are then sampled within the selected Topic, and dynamic node evolution updates the subtree of a repeatedly sampled Topic. The task description specifies the required capability, while the sampled scenario supplies the context.
This correspondence motivates the tree design: each acquisition follows an explicit path, budget allocation operates at the Topic level, and scenario updates remain local to the selected subtree. A graph-based acquisition design could additionally use cross-domain relations, with corresponding rules for sampling and updating connected nodes. The hierarchy provides the operations needed by the current acquisition loop; Condor [4] and WIST [5] likewise use hierarchical structures for data acquisition.
Semantic overlap between branches allows the same context to support different capabilities rather than requiring mutually exclusive domains. A financial scenario can involve probability, constrained optimization, or code implementation; a medical scenario can involve scientific reasoning, numerical analysis, or dialogue. During generation, the task description specifies the reasoning requirement and the scenario supplies its context. Their combination supports cross-domain supervision.
Tree paths therefore provide controllable acquisition entry points, while capability requirements combined with scenario contexts express cross-domain tasks. We will emphasize that the hierarchy does not require domains to be mutually exclusive.
References
[2] Zihong Chen et al. GraphGen: Enhancing Supervised Fine-Tuning for LLMs with Knowledge-Driven Synthetic Data Generation. 2025. arXiv:2505.20416.
[3] Zechen Sun et al. CGMIS: Concept-Graph Based Multi-Hop Instructions Synthesis for Enhancing Long-Context Reasoning. AAAI, 2026. DOI:10.1609/aaai.v40i39.40599.
[4] Maosong Cao et al. Condor: Enhance LLM Alignment with Knowledge-Driven Data Synthesis and Refinement. 2025. arXiv:2501.12273.
[5] Fangyuan Li et al. WIST: Web-Grounded Iterative Self-Play Tree for Domain-Targeted Reasoning Improvement. 2026. arXiv:2603.22352.
Response to Reviewer p9S8 (Part 3/4)
W3: Filtering Criterion and Difficulty Coverage
The filtering criterion concerns answer quality and repairability, not question difficulty or whether the student currently solves the question. The Refiner assigns an effort score from 1 to 5 and removes samples with before rewriting: these answers require complete replacement rather than a usable revision. Difficult questions with reliable or repairable answers remain eligible.
Difficulty diversity is handled during generation. For each sampled Theme, the prompt requests one Easy, one Medium, and one Hard question with distinct reasoning requirements. This encourages coverage across difficulty levels rather than restricting acquisition to questions that the student already solves.
To isolate screening, we disable only removal while retaining refinement, suitability routing, and report-driven updates, with the generation backend, retained-data budget, training configuration, and evaluation protocol matched.
| Method | AIME 2025 | ArenaHard-Writing | BFCL | GPQA Main | GSM8K | HealthBench | HumanEval | Weighted AVG |
|---|---|---|---|---|---|---|---|---|
| GPT-6.1 Sol + ANDES/DS | 6.67 2.72 | 42.54 0.93 | 93.25 0.76 | 32.59 1.68 | 87.33 0.39 | 34.99 0.72 | 74.59 1.12 | 42.16 0.75 |
| w/o high-effort sample filtering | 6.67 2.21 | 42.10 0.88 | 93.50 0.95 | 32.38 1.36 | 86.96 0.46 | 34.81 0.81 | 74.39 1.21 | 42.00 0.67 |
This control tests the effect of retaining answers that require complete replacement, separately from the effect of rewriting repairable answers. The screening mechanism targets unreliable supervision, while generation promotes difficulty diversity.
W4: Dependence on Internal Models and Use by Moderate-Capability Trainers
We distinguish the model roles: the trainer issues acquisition requests and executes training, while the internal backend performs routing, generation, refinement, evolution, and diagnostics. The original GLM-4.7 trainer and GPT-4o backend were chosen to examine whether an earlier-generation, moderate-capability combination could obtain competitive results through better data acquisition. The supplementary experiments use GPT-6.1 Sol with a DS backend to examine the same workflow with a stronger trainer.
We replace all internal modules from GPT-4o with Gemini-3.1-Flash on Qwen3-1.7B while keeping the trainer and training configuration fixed.
| Internal Backend | AIME 2025 | ArenaHard-Writing | BFCL | GPQA Main | GSM8K | HealthBench | HumanEval | Weighted Average |
|---|---|---|---|---|---|---|---|---|
| GPT-4o | 0.00 | 14.22 | 90.16 | 28.48 | 63.19 | 27.08 | 57.51 | 31.41 |
| Gemini-3.1-Flash | 0.00 | 13.84 | 92.00 | 24.37 | 64.37 | 27.67 | 57.83 | 30.84 |
The weighted average changes by 0.57 points. BFCL, GSM8K, HealthBench, and HumanEval retain strong performance, showing that the acquisition workflow can operate with different internal backends.
In the original paper, GLM-4.7 + ANDES achieves an average weighted score of 34.40 across four student models, compared with 34.29 for GLM-5.2 (Max) and 34.08 for Opus-4.8 (Max). This shows that an earlier-generation trainer can obtain competitive performance through more effective acquisition. The backend substitution further demonstrates compatibility with different internal models.
Response to Reviewer p9S8 (Part 1/4)
Thank you for recognizing the design and experimental value of ANDES for autonomous post-training. We clarify the World Tree's structure, reuse, and extensibility, and explain the roles of refinement and different model combinations.
W1: World Tree Construction and Adaptation with Fixed Topics
The initial World Tree is constructed through LLM-assisted top-down domain decomposition: Topics are subdivided into Themes and then into Scenarios for question generation. It is provided as a reusable label resource in the codebase and contains 72 Topics, 394 Themes, and 1,182 Scenarios. During synthesis, sampling weights are adjusted to the target, and scenario support is updated under repeatedly sampled Topics.
Topics provide a stable domain index, while the trainer's task description specifies the capability requirements and Themes/Scenarios supply finer-grained contexts. The initial tree is constructed once and reused across tasks. New tasks within existing domains can update lower-level contexts; a new top-level domain can be added as a Topic in the label configuration without rebuilding unrelated branches. We will distinguish initialization from online updates in the method description.
We compare the initial tree with the 36 named fields of the OECD FOS classification [1], using GPT-6.1 Sol to assess whether existing labels explicitly support each field or a constituent subfield.
The initial tree has direct label support in all six broad fields and covers 83.33% of the named fields, providing a broad contextual basis for synthesis.
We further test whether new domain content can be introduced by expanding Themes and Scenarios without changing Topics. The Evolver expands 11 fields; GPT assessment finds target-relevant scenarios for 9 (81.82%), while 2 remain closer to neighboring fields. All updates preserve the top-level Topics and unrelated branches. This shows that domain content can be extended locally without rebuilding the entire tree.
References
[1] OECD. Revised Field of Science and Technology (FOS) Classification in the Frascati Manual. 2007. DSTI/EAS/STP/NESTI(2006)19/FINAL, Annex 1. Official OECD document.