CurateEvo: Data-Curation Evolving for Agentic Post-Training

• URL: http://arxiv.org/abs/2607.06140v1
• Date: Tue, 07 Jul 2026 11:07:00 GMT
• Title: CurateEvo: Data-Curation Evolving for Agentic Post-Training
• Abstract summary: We propose CurateEvo, a failure-driven dynamic evolution framework for agentic post-training data curation.<n>CurateEvo represents the curation strategy as executable code and iteratively rewrites it using failed trajectories from a held-out development set.<n>At each epoch, the evolved strategy transforms a fixed raw corpus into supervised fine-tuning data, reinforcement learning data, and an inference-time memory bank.
• Score: 53.68149869349268
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Large language model (LLM) agents require post-training methods that can improve long-horizon decision making from environment feedback. However, existing agentic post-training pipelines often treat data curation as a fixed preprocessing step, focusing mainly on data augmentation while neglecting filtering, refinement, and adaptation to downstream failures. We propose CurateEvo, a failure-driven dynamic evolution framework for agentic post-training data curation. CurateEvo represents the curation strategy as executable code and iteratively rewrites it using failed trajectories from a held-out development set. At each epoch, the evolved strategy transforms a fixed raw corpus into supervised fine-tuning data, reinforcement learning data, and an inference-time memory bank. The evolution process first improves effectiveness by diagnosing recurring failure modes and augmenting, filtering, or refining data accordingly, and then improves efficiency by pruning redundant or low-utility training turns under a cost-aware objective. Experiments on ACEBench-Agent, BFCL-V4, and τ^2-Bench under both labeled and wild-data settings show that CurateEvo consistently outperforms prior curation methods, improving average scores by 3.2 and 2.7 points, respectively. Further analyses demonstrate that CurateEvo is compatible with different post-training recipes and substantially reduces curation overhead.

Related papers

• ADE: Agentic Data Evolution Framework for Human-Centered Objectives [27.381414874688318]
  Agentic Data Evolution (ADE) organizes synthetic supervision as evolving data snapshots.<n>ADE improves data snapshots through a closed-loop Observation-Variation-Selection (OVS) procedure.<n>Blind expert evaluation further confirms this, with a 66.11% preference for evolved answers.
  arXiv  Detail & Related papers  (2026-08-24T18:07:40Z)
• Self-Improving Large Language Models via Progressive Experience Evolution [52.03479747358687]
  We propose textbfSPEE (textbfSelf-textbfProgressive textbfExperience textbfEvolution), a unified post-training framework that sequentially performs explicit experience evolution followed by implicit policy optimization.<n> Experiments on five mathematical reasoning benchmarks demonstrate that SPEE consistently outperforms both test-time and training-time self-evolution baselines across three model scales.
  arXiv  Detail & Related papers  (2026-08-03T12:27:32Z)
• Self-evolving LLM agents with in-distribution Optimization [60.05867547965365]
  Large Language Models (LLMs) have recently emerged as powerful controllers for interactive agents in complex environments.<n>We propose Q-Evolve, a self-evolving framework for LLM agents that unifies automatic process-reward labeling and policy learning.<n>We evaluate our method on AlfWorld, WebShop, and ScienceWorld, showing Q-Evolve outperforms strong baselines in sample efficiency, robustness, and overall task performance.
  arXiv  Detail & Related papers  (2026-06-05T15:09:52Z)
• Rethinking Data Curation in LLM Training: Online Reweighting Offers Better Generalization than Offline Methods [30.96121293915128]
  ADAPT is a dynamic online framework that reweights training samples with adaptive per-sample learning rates guided by similarity-based quality signals.<n> ADAPT consistently outperforms offline selection/mixing and prior online methods, achieving stronger cross-benchmark generalization under equal FLOPs.
  arXiv  Detail & Related papers  (2026-04-19T14:23:23Z)
• Adaptive Data Dropout: Towards Self-Regulated Learning in Deep Neural Networks [10.269961654607108]
  Deep neural networks are typically trained by uniformly sampling large datasets across epochs.<n>Recent work shows that progressively reducing the amount of training data can improve efficiency and generalization.<n>We propose Adaptive Data Dropout, a framework that dynamically adjusts the subset of training data based on performance feedback.
  arXiv  Detail & Related papers  (2026-04-14T16:41:33Z)
• DIET: Learning to Distill Dataset Continually for Recommender Systems [69.68271683922536]
  Deep recommender models are trained under a continual learning paradigm, relying on massive and continuously growing streaming behavioral logs.<n>In large-scale platforms, retraining models on full historical data for architecture comparison or iteration is prohibitively expensive, severely slowing down model development.<n>We formulate this problem as emphstreaming dataset distillation for recommender systems and propose textbfDIET, a unified framework that maintains a compact distilled dataset which evolves alongside streaming data while preserving training-critical signals.
  arXiv  Detail & Related papers  (2026-03-26T02:50:13Z)
• Beyond Efficiency: Molecular Data Pruning for Enhanced Generalization [30.738229850748137]
  MolPeg is a Molecular data Pruning framework for enhanced Generalization. It focuses on the source-free data pruning scenario, where data pruning is applied with pretrained models. It consistently outperforms existing DP methods across four downstream tasks.
  arXiv  Detail & Related papers  (2024-09-02T09:06:04Z)
• PREM: A Simple Yet Effective Approach for Node-Level Graph Anomaly Detection [65.24854366973794]
  Node-level graph anomaly detection (GAD) plays a critical role in identifying anomalous nodes from graph-structured data in domains such as medicine, social networks, and e-commerce. We introduce a simple method termed PREprocessing and Matching (PREM for short) to improve the efficiency of GAD. Our approach streamlines GAD, reducing time and memory consumption while maintaining powerful anomaly detection capabilities.
  arXiv  Detail & Related papers  (2023-10-18T02:59:57Z)
• Distributionally Robust Cross Subject EEG Decoding [15.211091130230589]
  We propose a principled approach to perform dynamic evolution on the data for improvement of decoding robustness. We derived a general data evolution framework based on Wasserstein gradient flow (WGF) and provides two different forms of evolution within the framework. The proposed approach can be readily integrated with other data augmentation approaches for further improvements.
  arXiv  Detail & Related papers  (2023-08-19T11:31:33Z)
• Optimizing a Transformer-based network for a deep learning seismic processing workflow [0.0]
  StorSeismic is a recently introduced model based on the Transformer to adapt to various seismic processing tasks. We observe faster pretraining and competitive results on the fine-tuning tasks and, additionally, fewer parameters to train compared to the vanilla model.
  arXiv  Detail & Related papers  (2023-08-09T07:11:42Z)
• Confidence Attention and Generalization Enhanced Distillation for Continuous Video Domain Adaptation [62.458968086881555]
  Continuous Video Domain Adaptation (CVDA) is a scenario where a source model is required to adapt to a series of individually available changing target domains. We propose a Confidence-Attentive network with geneRalization enhanced self-knowledge disTillation (CART) to address the challenge in CVDA.
  arXiv  Detail & Related papers  (2023-03-18T16:40:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.