Skip to content

DataFoundry: Evolving Data Preparators via Recursive Self-Improvement

Aug 2026 · 2 citations · 31 references
Computer Science

TL;DR

The DataFoundry is introduced, a framework for evolving data preparators through recursive self-improvement before large-scale data production, and it is found that recursively evolved preparators produce training data with higher downstream utility than baselines.

Abstract

Domain adaptation of large language models increasingly depends on constructing high-quality training data, yet existing data-preparation pipelines typically address quality only after generation through post-hoc filtering. This creates a fundamental mismatch: data-quality issues often originate from the construction process itself, while quality control is applied only to its outputs. We introduce \textsc{DataFoundry}, a framework for \textbf{evolving data preparators through recursive self-improvement} before large-scale data production. \textsc{DataFoundry} represents a data preparator as an evolvable runtime specification and instantiates its evolution with a \textsc{Skills-as-Modules} architecture, in which a central \textsc{Controller} orchestrates modular skills to compile executable runtimes, diagnose deficiencies on small pilot sets using domain-appropriate criteria, and translate diagnostic feedback into adapters that revise individual preparation components while preserving stable interfaces. We evaluate \textsc{DataFoundry} on DataPrep-Bench across mathematics, finance, law, and medicine, and find that recursively evolved preparators produce training data with higher downstream utility than baselines. Experiments across different backbones further demonstrate that these improvements are not tied to a particular model, while analyses and case studies further reveal the framework's optimization dynamics and illustrate how its evolution unfolds in practice.

View source

Similar papers

Preprint Aug 2026

Agentic Instruction Data Selection: Let DataMaster Interpret Your Intent

Extensive experiments show that DataMaster outperforms static baselines in most settings and surpasses full-pool training in a substantial number of cases, and simplifies data curation and removes the burden of manual strategy design.

Fanqi Zhou, Qiaosheng Chen, Zixian Huang et al. · 0 citations
Conference Aug 2026

An LLM-Driven Intelligent Agent for Adaptive Data Preparation with Strategy Memory

Data preparation, including source profiling, quality diagnosis, and cleaning, remains a labor-intensive bottleneck in data-driven applications. Traditional approaches require manual rule design for each data source and lack adaptability to heterogeneous formats. This paper proposes an LLM-driven intelligent agent for...

Chen-Tian Ju, Guo-Bin Zhao, Yun-Tong Chen · 0 citations
#artificial intelligence Preprint Sep 2026

Failure-Guided Co-Evolution of Prompts and Training Data

ForGE is introduced, a failure-guided framework that co-evolves prompts and training data and establishes failures as a shared interface between prompt optimization and data synthesis, and shows the benefit of jointly adapting what a model is instructed to do and what it learns from

Tian-Yu Yuan, Zhu-Zhong Qian · 0 citations
#artificial intelligence Preprint Sep 2026

LIMIT: Less Is More for Instruction Tuning in Text-to-SQL

LIMIT(Less Is More for Instruction Tuning in Text-to-SQL), a data-centric framework that demonstrates strong database reasoning can emerge from an extremely compact training set when examples are strategically selected, is proposed, suggesting that careful data curation, rather than scale, is the key to efficient Text-...

Hao-Yuan Ma, Heng-Wei Liu, Linjuan Wu et al. · 0 citations
Review Aug 2026

DynaContext: Self-Improving Dynamic Contextualization of Optimized Prompts for Heterogeneous Parameter Extraction

DynaContext is introduced, a framework that combines an offline-optimized extraction core, learned with GEPA or SkillOpt, with inference-time contextual adaptation and validation-gated self-improvement, with inference-time contextual adaptation and validation-gated self-improvement.

Joe Yu, Shibin Thomas Stanley Paul, Sven Mayer · 0 citations
Preprint Aug 2026

Iteration Without Elaboration: A Simple ReAct Architecture Suffices for Text-to-SQL Generation

A simple yet effective zero-shot ReAct-style framework built solely on iterative reasoning and a constrained action space defined by a typed Domain-Specific Language (DSL) of 15 relational operations, rather than free-form SQL generation.

Jian Lu, Haiwei Yu, Raymond M. Xiong et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

MIT News · Artificial Intelligence Sep 24, 2026

Estimating suicide risk from text

A new language-processing tool could help identify the highest-risk individuals from natural language, enabling swifter interventions.

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