Task-Conditioned Synthetic Data Generation for Improving Machine Learning Performance in Agricultural Prediction Tasks

arXiv cs.AI Papers

Summary

Proposes a Task-Conditioned Synthetic Data Generation (TCSDG) algorithm combining a Bayesian Network generator with a transformer-based tabular foundation model to improve ML performance in agricultural prediction tasks, showing consistent improvements over benchmarks.

arXiv:2607.09751v1 Announce Type: new Abstract: Machine Learning (ML) algorithms have been widely used to estimate agricultural variables across diverse contexts. However, because the quantity and quality of training data strongly influence performance of ML algorithms, their use can be constrained by limited or incomplete reference data. Synthetic Data Generation (SDG) offers a practical approach to address this issue by producing artificial but realistic samples that preserve key characteristics of the original data. Building on teacher-student knowledge transfer and in-context learning for tabular data, this study proposes a Task-Conditioned SDG (TCSDG) algorithm that pairs a Bayesian Network generator with a transformer-based tabular foundation model (TabICL). The proposed algorithm was evaluated on two agricultural prediction tasks: crop yield prediction and crop type classification. Six benchmark SDG algorithms were also utilized to compare their performance with that of TCSDG. Across twelve study sites, two training-data fractions, four multiplication ratios, and three predictive ML algorithms, augmenting the original data with TCSDG-generated synthetic data improved ML performance in 89% of the crop type classification experiments and 74% of the crop yield prediction experiments. TCSDG also substantially outperformed benchmark SDG algorithms and was the only method to consistently improve ML performance across both tasks at the aggregate level. The study demonstrates that carefully designed and processed synthetic data can improve ML performance in precision-agriculture applications. TCSDG offers a practical and extensible framework for generating synthetic data that supports downstream ML agricultural prediction. The full implementation of TCSDG is publicly available as open source at https://github.com/HamidEbrahimy/TCSDG.
Original Article
View Cached Full Text

Cached at: 07/14/26, 04:17 AM

# Task-Conditioned Synthetic Data Generation for Improving Machine Learning Performance in Agricultural Prediction Tasks
Source: [https://arxiv.org/html/2607.09751](https://arxiv.org/html/2607.09751)
Hamid Ebrahimy1,2,\*Moritz Lucas1,2Martin Atzmueller1,3 1Osnabrück University, Joint Lab Artificial Intelligence and Data Science, Osnabrück, Germany 2Leibniz Institute for Agricultural Engineering and Bioeconomy \(ATB\), Potsdam, Germany 3German Research Center for Artificial Intelligence \(DFKI\), Research Department Cooperative and Autonomous Systems \(CAS\), Osnabrück, Germany \*Corresponding author:hamid\.ebrahimy@uni\-osnabrueck\.de

###### Abstract

Machine Learning \(ML\) algorithms have been widely used to estimate agricultural variables across diverse contexts\. However, because the quantity and quality of training data strongly influence performance of ML algorithms, their use can be constrained by limited or incomplete reference data\. Synthetic Data Generation \(SDG\) offers a practical approach to address this issue by producing artificial but realistic samples that preserve key characteristics of the original data\. Building on teacher–student knowledge transfer and in\-context learning for tabular data, this study proposes a Task\-Conditioned SDG \(TCSDG\) algorithm that pairs a Bayesian Network generator with a transformer\-based tabular foundation model \(TabICL\)\. The proposed algorithm was evaluated on two agricultural prediction tasks: crop yield prediction and crop type classification\. Six benchmark SDG algorithms were also utilized to compare their performance with that of TCSDG\. Across twelve study sites, two training\-data fractions, four multiplication ratios, and three predictive ML algorithms, augmenting the original data with TCSDG\-generated synthetic data improved ML performance in 89% of the crop type classification experiments and 74% of the crop yield prediction experiments\. TCSDG also substantially outperformed benchmark SDG algorithms and was the only method to consistently improve ML performance across both tasks at the aggregate level\. The study demonstrates that carefully designed and processed synthetic data can improve ML performance in precision\-agriculture applications\. TCSDG offers a practical and extensible framework for generating synthetic data that supports downstream ML agricultural prediction\. The full implementation of TCSDG is publicly available as open source at[https://github\.com/HamidEbrahimy/TCSDG](https://github.com/HamidEbrahimy/TCSDG)\.

## 1Introduction

Agricultural variables are critical indicators that have been used in various applications including food security assessment, agricultural optimization, economic planning, and climate change impact evaluation\(Bouguettayaet al\.,[2022](https://arxiv.org/html/2607.09751#bib.bib2); Gallegoet al\.,[2010](https://arxiv.org/html/2607.09751#bib.bib1); Van Klompenburget al\.,[2020](https://arxiv.org/html/2607.09751#bib.bib46)\)\. With the population growth and the increasing impact of climate change on agriculture, continuous monitoring and evaluations of agricultural variables is vital and remains critical for achieving long\-term agricultural sustainability and food security\(Becker\-Reshefet al\.,[2023](https://arxiv.org/html/2607.09751#bib.bib5); Challinoret al\.,[2014](https://arxiv.org/html/2607.09751#bib.bib3); Kanget al\.,[2009](https://arxiv.org/html/2607.09751#bib.bib4)\)\. Accordingly, in view of the importance of agricultural variables across a wide range of applications, substantial advances in data analytics, remote sensing technologies, and Machine Learning \(ML\) algorithms have been leveraged for their assessment\(Murugananthamet al\.,[2022](https://arxiv.org/html/2607.09751#bib.bib6); Pierre Pottet al\.,[2022](https://arxiv.org/html/2607.09751#bib.bib32)\)\.

ML algorithms are widely employed for the prediction of different agricultural variables\(Fenget al\.,[2019](https://arxiv.org/html/2607.09751#bib.bib9); Rashidet al\.,[2021](https://arxiv.org/html/2607.09751#bib.bib7); Tariqet al\.,[2023](https://arxiv.org/html/2607.09751#bib.bib8)\)\. These algorithms are able to process vast amounts of heterogeneous data, including meteorological variables, soil characteristics, crop health indicators, and remote sensing data\. In a broad sense, supervised ML models apply advanced computational strategies to analyze relationships between specific agricultural independent variables \(e\.g\., soil moisture, climate conditions, crop growth stages\) and specific agricultural dependent variable\(s\) such as crop yield and crop type\. These models then apply the learned relationships to provide agricultural variables in spatial or temporal contexts where direct measurements are absent\.

Supervised ML algorithms are inherently dependent on training data, as they learn patterns, relationships, and representations from examples, for developing a functional mapping between inputs and outputs\(Jordan and Mitchell,[2015](https://arxiv.org/html/2607.09751#bib.bib10)\)\. From a statistical learning perspective, having a larger training dataset helps the model approximate the underlying data distribution more accurately, which improves the model’s performance and its ability to generalize beyond the training set\(Caroet al\.,[2022](https://arxiv.org/html/2607.09751#bib.bib12); Cui and Gong,[2018](https://arxiv.org/html/2607.09751#bib.bib20); Raudys and Jain,[1991](https://arxiv.org/html/2607.09751#bib.bib11)\)\. However, it is important to note that data quantity alone does not guarantee optimal performance; the data fed to ML algorithms must also be of high quality and representative to ensure reliable outcomes\(Elmeset al\.,[2020](https://arxiv.org/html/2607.09751#bib.bib21); Foody and Mathur,[2004](https://arxiv.org/html/2607.09751#bib.bib22)\)\. Thus, both quantity and quality of training data play a significant role in determining the success of a given algorithm in terms of predictive performance and robustness\.

Despite technological advancements and the urgent need, the availability of agricultural reference data remains inadequate\(Condranet al\.,[2022](https://arxiv.org/html/2607.09751#bib.bib26); Khanalet al\.,[2020](https://arxiv.org/html/2607.09751#bib.bib24); Weisset al\.,[2020](https://arxiv.org/html/2607.09751#bib.bib25); Weitkamp and Karimi,[2023](https://arxiv.org/html/2607.09751#bib.bib23)\)\. The deficiencies in data quality, quantity, and spatial\-temporal coverage present significant obstacles that can hinder the development of state\-of\-the\-art predictive ML models\(Emmanuelet al\.,[2021](https://arxiv.org/html/2607.09751#bib.bib27); Hoffmannet al\.,[2019](https://arxiv.org/html/2607.09751#bib.bib29); Yanet al\.,[2016](https://arxiv.org/html/2607.09751#bib.bib28)\)\. In many real\-world agricultural applications, the available reference data also suffer from measurement inaccuracies, incomplete records, and limited representation\(Călinet al\.,[2023](https://arxiv.org/html/2607.09751#bib.bib31); Phalkeet al\.,[2020](https://arxiv.org/html/2607.09751#bib.bib33); Phamet al\.,[2022](https://arxiv.org/html/2607.09751#bib.bib30); Pierre Pottet al\.,[2022](https://arxiv.org/html/2607.09751#bib.bib32)\)\. Furthermore, inconsistencies in data collection methods and data characteristics hinder cross\-regional and long\-term comparative studies, mainly because agricultural variables differ substantially across regions and change over time in response to external factors such as changing climatic conditions and evolving agricultural systems\.

To address the challenges associated with insufficient reference data across diverse research domains, various methodologies have been developed and applied to bridge these data gaps\(Luet al\.,[2025](https://arxiv.org/html/2607.09751#bib.bib101); Pan and Yang,[2010](https://arxiv.org/html/2607.09751#bib.bib100)\)\. These approaches can be broadly categorized into two main primary groups: algorithmic\-centric and data\-centric methods\. Algorithmic\-centric techniques focus on optimizing the framework to extract maximum value from incomplete reference data through techniques such as meta\-learning and probabilistic modeling\. On the other hand, data\-centric methods focus on modifying, expanding, or refining reference data through techniques such as data augmentation, Synthetic Data Generation \(SDG\), and data integration from multiple sources\.

Data\-centric methodologies, especially SDG algorithms, offer advantages beyond enhancing ML models’ performance and generalization by directly addressing limitations in reference data\. They are generally aiming at generating synthetic data that maintains key structural characteristics of the original data, to supplement incomplete data, thereby reducing reliance on costly, time\-consuming, or sensitive data acquisition processes\(Luet al\.,[2025](https://arxiv.org/html/2607.09751#bib.bib101); Paulin and Ivasic‐Kos,[2023](https://arxiv.org/html/2607.09751#bib.bib34)\)\.

This process involves the application of mathematical and probabilistic models to replicate the underlying structure of the original data\. SDG algorithms enable the creation of realistic yet synthetic data that can be used for various purposes including but not limited to model training\-validation\-testing, and scenario simulation\(De Meloet al\.,[2022](https://arxiv.org/html/2607.09751#bib.bib35); Fonseca and Bacao,[2023](https://arxiv.org/html/2607.09751#bib.bib115)\)\. Furthermore, these algorithms help protect sensitive information by providing a mechanism for generating privacy\-preserving synthetic data that retain statistical properties of the original data\(Jordonet al\.,[2018](https://arxiv.org/html/2607.09751#bib.bib36); Pezoulaset al\.,[2024](https://arxiv.org/html/2607.09751#bib.bib37)\), facilitating data sharing and compliance with regulatory requirements\.

In recent years, a variety of SDG algorithms has been introduced and applied across multiple domains\(Gmet al\.,[2020](https://arxiv.org/html/2607.09751#bib.bib39); Hernandezet al\.,[2022](https://arxiv.org/html/2607.09751#bib.bib38); Luet al\.,[2025](https://arxiv.org/html/2607.09751#bib.bib101)\)\. Many commonly used SDG approaches are designed around one of the two objectives of local interpolation in feature space or global distributional fidelity\(Chawlaet al\.,[2002](https://arxiv.org/html/2607.09751#bib.bib104); Goodfellowet al\.,[2014](https://arxiv.org/html/2607.09751#bib.bib103); Van Breugelet al\.,[2023](https://arxiv.org/html/2607.09751#bib.bib102)\); however, neither objectives, by itself, guarantees that the generated synthetic data are useful for the downstream learning task\.

A synthetic sample is more likely to be beneficial to a downstream learner when it is plausible under the real data distribution, informative under a calibrated predictive model, and diverse or non\-redundant relative to the real data\(Achterberget al\.,[2025](https://arxiv.org/html/2607.09751#bib.bib111); Jamniket al\.,[2024](https://arxiv.org/html/2607.09751#bib.bib112); Xuet al\.,[2025](https://arxiv.org/html/2607.09751#bib.bib113)\)\. On this basis, tabular SDG\(Fonseca and Bacao,[2023](https://arxiv.org/html/2607.09751#bib.bib115)\)can be formulated as a supervised, task\-conditioned problem rather than as an unconditional data\-mimicking problem\. The central assumption is that useful synthetic samples must satisfy two requirements simultaneously: they should be statistically plausible under the original data distribution, and they should preserve the feature–target relationship required by the downstream classifier or regressor\.

To operationalize this assumption, and building on the theoretical grounding of teacher–student knowledge transfer\(Hintonet al\.,[2015](https://arxiv.org/html/2607.09751#bib.bib97)\)and in\-context learning for tabular data\(Hollmannet al\.,[2025](https://arxiv.org/html/2607.09751#bib.bib98)\), a Task\-Conditioned Synthetic Data Generation \(TCSDG\) framework was proposed, composed of a Bayesian Network \(BN\) candidate generator, a foundation\-model teacher acting as a task\-aware critic, and a coverage\-preserving selection mechanism\.

The task\-conditioning arises primarily from the teacher\-guided filtering, the target\-space budget allocation, and the coverage\-preserving selection, rather than from the candidate generator alone\. Concretely within the framework, BN algorithm\(Ankan and Panda,[2015](https://arxiv.org/html/2607.09751#bib.bib40); Qianet al\.,[2023](https://arxiv.org/html/2607.09751#bib.bib94)\)generates a large candidate pool of synthetic samples, from which candidate samples are then evaluated by TabICL \(Tabular Foundation Model for In\-Context Learning\) algorithm\(Quet al\.,[2025](https://arxiv.org/html/2607.09751#bib.bib41)\)as predictive teacher rather than accepted solely on the basis of generative likelihood or distributional similarity\. The use of a tabular in\-context learner as the teacher is motivated by recent evidence that tabular foundation models can perform strong supervised prediction by conditioning directly on labeled examples\(Quet al\.,[2025](https://arxiv.org/html/2607.09751#bib.bib41)\)\. Furthermore, a mini\-batch k\-means diversification step and a convex budget allocation scheme balancing empirical and inverse\-frequency priors ensure that minority classes and conditions receive proportionally enriched synthetic support without distorting the global marginal distribution\.

The contributions of this work are threefold\. First, this study introduces TCSDG, a task\-conditioned pipeline for supervised tabular learning that integrates target\-space budget allocation, teacher\-guided consistency filtering, coverage\-preserving selection, and quality\-aware sample weighting\. Second, TCSDG is benchmarked under identical experimental conditions against six established tabular SDG methods spanning the principal methodological families in the literature \(probabilistic\-graphical, adversarial, latent\-variable, and diffusion\-based\), providing a controlled, utility\-first comparison\. Third, this comparison is instantiated on twelve supervised agricultural prediction tasks: six crop type classification datasets and six crop yield prediction datasets covering maize and wheat, providing a systematic multi\-site, multi\-task evaluation of tabular SDG utility in precision agriculture\.

The multi\-site, multi\-task design is motivated by the well\-documented sensitivity of data\-driven agricultural models to environmental, soil, and climatic variability\(Alami Machichiet al\.,[2023](https://arxiv.org/html/2607.09751#bib.bib44); Ebrahimyet al\.,[2023](https://arxiv.org/html/2607.09751#bib.bib47); Van Klompenburget al\.,[2020](https://arxiv.org/html/2607.09751#bib.bib46); Wanget al\.,[2024](https://arxiv.org/html/2607.09751#bib.bib45)\)\. By conducting experiments across multiple study sites and settings, this research seeks to ensure that performance evaluations are not site\-specific but instead capture the variability inherent in different agricultural systems, thus improving the reliability and generalizability of the achieved conclusions regarding the impact of SDG algorithms\.

## 2Materials and Methods

### 2\.1TCSDG \(Task\-Conditioned Synthetic Data Generation\) Algorithm

TCSDG is a task\-conditioned synthetic data generation algorithm for supervised tabular learning\. Figure[1](https://arxiv.org/html/2607.09751#S2.F1)summarizes the complete TCSDG procedure as pseudocode\. Given a real training set and a user\-specified synthetic\-to\-real ratio r ¿0, TCSDG produces synthetic records that can be used either to replace the original training data and/or to augment it for a downstream supervised task\. The algorithm proceeds in five stages: budget allocation, teacher training and calibration, candidate generation, teacher\-guided and coverage\-preserving selection, and sample weighting\.

![Refer to caption](https://arxiv.org/html/2607.09751v1/Figure_1.png)Figure 1:Pseudocode of the TCSDG algorithm for tabular synthetic data generation\.#### 2\.1\.1Budget Allocation

The purpose of the budget allocation step is to control how the total synthetic budget is distributed across the target space, such that the main structure of the real data distribution is preserved while controlled reinforcement of underrepresented regions is still possible\.

For classification, letncn\_\{c\}denote the number of real training samples in classcc, wherec∈\{1,…,K\}c\\in\\\{1,\\dots,K\\\}\. The empirical class prior is defined as:

πcemp=ncn\\pi\_\{c\}^\{\\text\{emp\}\}=\\frac\{n\_\{c\}\}\{n\}\(1\)
To increase the representation of rare classes, an inverse\-frequency prior is also computed:

πcinv=1/nc∑k1/nk\\pi\_\{c\}^\{\\text\{inv\}\}=\\frac\{1/n\_\{c\}\}\{\\sum\_\{k\}1/n\_\{k\}\}\(2\)
The final class allocation prior is defined as:

πc=λ​πcemp\+\(1−λ\)​πcinv\\pi\_\{c\}=\\lambda\\pi\_\{c\}^\{\\text\{emp\}\}\+\(1\-\\lambda\)\\,\\pi\_\{c\}^\{\\text\{inv\}\}\(3\)
whereλ∈\[0,1\]\\lambda\\in\[0,1\]controls the trade\-off between preserving the observed class distribution and increasing minority\-class representation \(λ=0\.75\\lambda=0\.75by default\)\.

For regression, the target variable is partitioned intoBBequal\-frequency bins \(B=5B=5by default\) using quantile binning\. Letℬb\\mathcal\{B\}\_\{b\}denote the set of training samples whose target values fall in binbb\. The regression allocation follows the bin proportions:

πbreg=\|ℬb\|n,nbsyn=round⁡\(nsyn​πbreg\)\\pi\_\{b\}^\{\\text\{reg\}\}=\\frac\{\|\\mathcal\{B\}\_\{b\}\|\}\{n\},\\qquad n\_\{b\}^\{\\text\{syn\}\}=\\operatorname\{round\}\\\!\\left\(n\_\{\\text\{syn\}\}\\,\\pi\_\{b\}^\{\\text\{reg\}\}\\right\)\(4\)
Equal\-frequency binning was chosen because it spreads the synthetic budget uniformly across the response range without further parametric assumptions\.

#### 2\.1\.2Teacher Training and Calibration

TabICL\(Quet al\.,[2025](https://arxiv.org/html/2607.09751#bib.bib41)\)is used as the task\-aware teacher\.TabICL is an in\-context, tabular foundation model that requires no per\-task gradient\-based tuning, which makes it well suited to settings where real training data are limited\. In TCSDG, the teacher is fitted on the real training data and is then used only to evaluate candidate synthetic samples\. The teacher therefore functions as a task\-aware critic rather than a generator component\. For classification, the teacher returns class\-probability estimates:

T​\(x\)=\(T1​\(x\),…,TK​\(x\)\)T\(x\)=\\big\(T\_\{1\}\(x\),\\dots,T\_\{K\}\(x\)\\big\)\(5\)whereTc​\(x\)T\_\{c\}\(x\)denotes the predicted probability thatxxbelongs to classcc\. For a candidate generated with assigned classcc, three quantities are computed: the assigned\-class probability \(pc​\(x\)=Tc​\(x\)p\_\{c\}\(x\)=T\_\{c\}\(x\)\), the prediction margin \(m​\(x\)=T\(1\)​\(x\)−T\(2\)​\(x\)m\(x\)=T\_\{\(1\)\}\(x\)\-T\_\{\(2\)\}\(x\); whereT\(1\)​\(x\)T\_\{\(1\)\}\(x\)andT\(2\)​\(x\)T\_\{\(2\)\}\(x\)are the largest and second\-largest predicted class probabilities\), and the predictive entropy \(H​\(T​\(x\)\)=−∑k=1KTk​\(x\)​log⁡Tk​\(x\)H\(T\(x\)\)=\-\\sum\_\{k=1\}^\{K\}T\_\{k\}\(x\)\\,\\log T\_\{k\}\(x\)\)\.

A classification candidate is considered teacher\-consistent if it satisfies three criteria simultaneously: \(1\) its assigned\-class probability satisfiespc​\(x\)≥τcp\_\{c\}\(x\)\\geq\\tau\_\{c\}, where the per\-class threshold isτc=max⁡\(0\.50,Q0\.20​\{pc​\(xi\):real samples of class​c\}\)\\tau\_\{c\}=\\max\\\!\\big\(0\.50,\\,Q\_\{0\.20\}\\\{p\_\{c\}\(x\_\{i\}\):\\text\{real samples of class \}c\\\}\\big\); \(2\) its margin satisfiesm​\(x\)≥0\.05m\(x\)\\geq 0\.05; \(3\) its entropy lies within the class\-specific interval\[Q0\.20,Q0\.95\]\[Q\_\{0\.20\},Q\_\{0\.95\}\]of the entropy values observed for real samples in classcc\. This prevents the selection of candidates that are either highly uncertain or unrealistically low\-entropy relative to the real training data\.

For regression, the teacher provides predictive meanμT​\(x\)\\mu\_\{T\}\(x\)and predictive varianceσT2​\(x\)\\sigma\_\{T\}^\{2\}\(x\)\. For a generated candidate\(x~,y~\)\(\\tilde\{x\},\\tilde\{y\}\), the teacher residual is defined as:

d​\(x~,y~\)=\|μT​\(x\)−y~\|d\(\\tilde\{x\},\\tilde\{y\}\)=\|\\mu\_\{T\}\(x\)\-\\tilde\{y\}\|\(6\)
All teacher thresholds are calibrated using predictions on the real training data\. For classification, the calibration statistics are the per\-class probability thresholds and entropy intervals\. For regression, they are the residual thresholdδ=Q0\.80\{\|μT\(xi\)−yi\|:real training sample\}\\delta=Q\_\{0\.80\}\\\{\|\\mu\_\{T\}\(x\_\{i\}\)\-y\_\{i\}\|:\\text\{real training sample\}\\\}and the predictive\-variance interval\[Q0\.20,Q0\.80\]\[Q\_\{0\.20\},Q\_\{0\.80\}\]ofσT2​\(xi\)\\sigma\_\{T\}^\{2\}\(x\_\{i\}\)over the real training samples\.

#### 2\.1\.3Candidate Generation

The candidate generation stage constructs an oversized pool of synthetic samples\. The candidate pool is generated at least six times the required synthetic budget per class \(classification\) or in total \(regression\)\. The six times factor was chosen as a compromise between providing the teacher\-consistency and coverage\-selection stages with enough headroom to filter aggressively and keeping the computational cost manageable\.

For classification, class\-conditional BN generators are used\. LetDc=\{xi:\(xi,yi\)∈D,yi=c\}D\_\{c\}=\\\{x\_\{i\}:\(x\_\{i\},y\_\{i\}\)\\in D,\\ y\_\{i\}=c\\\}denote the set of feature vectors belonging to classcc\. A separate generatorGcG\_\{c\}is fitted to each class\-specific feature subsetDcD\_\{c\}, thereby approximatingp​\(x∣y=c\)p\(x\\mid y=c\)\. Synthetic classification candidates are generated as:

x~j\(c\)∼Gc,y~jc=c\\tilde\{x\}\_\{j\}^\{\(c\)\}\\sim G\_\{c\},\\qquad\\tilde\{y\}\_\{j\}^\{c\}=c\(7\)
For regression, a single BN generator \(GG\) is fitted to the combined feature\-target data\[X,y\]\[X,y\], and candidates are sampled as:

x~j,y~j∼G\\tilde\{x\}\_\{j\},\\tilde\{y\}\_\{j\}\\sim G\(8\)This joint formulation avoids fragmenting the training data into small target\-specific subsets and preserves local feature\-response structure before teacher\-based filtering is applied\.

#### 2\.1\.4Teacher\-Guided and Coverage\-Preserving Selection

The final synthetic dataset is selected from the candidate pool as the union of two disjoint subsets:

Dsyn=Dteacher∪DcoverageD\_\{\\text\{syn\}\}=D\_\{\\text\{teacher\}\}\\cup D\_\{\\text\{coverage\}\}\(9\)
The teacher\-consistent subsetDteacherD\_\{\\text\{teacher\}\}contains candidates satisfying the task\-specific teacher criteria described in Section[2\.1\.2](https://arxiv.org/html/2607.09751#S2.SS1.SSS2)\. This subset promotes predictive relevance by excluding candidates with implausible labels, weak class support, excessive uncertainty, or extreme feature–target disagreement\. The coverage subsetDcoverageD\_\{\\text\{coverage\}\}is selected from the remaining candidate pool with minimal teacher intervention, preserving distributional support and reducing dependence on the teacher model\.

Within each class for classification, or within each target bin for regression, a fraction of the local budget is allocated to teacher\-consistent samples; the remaining budget is filled by coverage samples\.

Teacher\-consistent candidates are first ranked by a task\-specific teacher score, and only the highest\-ranked subset is passed to representative selection\. Coverage samples are selected from the remaining candidate pool without enforcing the teacher\-consistency constraints\. In both cases, representative selection standardizes the candidate features, applies MiniBatchkk\-means with the required number of clusters, and returns the candidate closest to each centroid\. This procedure promotes diversity while keeping the computational cost manageable\.

For classification, the selected synthetic subset for classccsatisfies:

Dsyn\(c\)=Dteacher\(c\)∪Dcoverage\(c\),\|Dsyn\(c\)\|=ncsynD\_\{\\text\{syn\}\}^\{\(c\)\}=D\_\{\\text\{teacher\}\}^\{\(c\)\}\\cup D\_\{\\text\{coverage\}\}^\{\(c\)\},\\qquad\\big\|D\_\{\\text\{syn\}\}^\{\(c\)\}\\big\|=n\_\{c\}^\{\\text\{syn\}\}\(10\)
For regression, equal\-frequency target bins computed from the real training targets are used to allocate the synthetic budget\. Candidate samples are then organized by rank\-based target\-bin identifiers within the generated candidate pools, and the same teacher\-consistency and representative\-selection procedure is applied within each target binbbso that\|Dsyn\(b\)\|=nbsyn\\big\|D\_\{\\text\{syn\}\}^\{\(b\)\}\\big\|=n\_\{b\}^\{\\text\{syn\}\}\.

#### 2\.1\.5Sample Weighting

TCSDG provides a sample\-weighting mechanism for synthetic samples, which can be used to assign higher importance to the original data and preserve the relative contribution of real data in the downstream tasks\. For this purpose, letwsyn≤1w\_\{\\text\{syn\}\}\\leq 1denote the base synthetic weight that after some preliminary analyses set at0\.30\.3\. For each selected synthetic sample, a normalized teacher\-derived scores~j∈\[0,1\]\\tilde\{s\}\_\{j\}\\in\[0,1\]is computed within the corresponding class or target bin\. The final synthetic weight is defined as:

wj=wsyn​\(1\+α​s~j\)w\_\{j\}=w\_\{\\text\{syn\}\}\\left\(1\+\\alpha\\tilde\{s\}\_\{j\}\\right\)\(11\)
whereα≥0\\alpha\\geq 0controls the strength of the teacher\-based weight adjustment\. For classification,s~j\\tilde\{s\}\_\{j\}is derived from the assigned\-class probability, the margin, and the entropy deviation\. For regression, teacher\-consistent candidates are ranked using residual agreement and the predictive\-variance deviation, thens~j\\tilde\{s\}\_\{j\}is computed from a normalized residual agreement score, implemented as the negative teacher residual within each target bin\.

The weighted empirical objective for a downstream modelffis:

minf​∑\(xi,yi\)∈Dl​\(f​\(xi\),yi\)\+∑\(x~i,y~i\)∈Dsynwi​l​\(f​\(x~i\),y~i\)\\min\_\{f\}\\sum\_\{\(x\_\{i\},y\_\{i\}\)\\in D\}l\\big\(f\(x\_\{i\}\),y\_\{i\}\\big\)\+\\sum\_\{\(\\tilde\{x\}\_\{i\},\\tilde\{y\}\_\{i\}\)\\in D\_\{\\text\{syn\}\}\}w\_\{i\}\\,l\\big\(f\(\\tilde\{x\}\_\{i\}\),\\tilde\{y\}\_\{i\}\\big\)\(12\)
wherel​\(⋅,⋅\)l\(\\cdot,\\cdot\)denotes the task\-specific loss function\.

### 2\.2Overall Experimental Procedures

To evaluate the proposed TCSDG algorithm and to position it relative to existing tabular SDG methods, a controlled benchmarking procedure was designed with two complementary objectives: first, to quantify the practical utility of TCSDG\-generated synthetic data when used to augment training sets for downstream tasks; and second, to compare its utility, under identical conditions, against a set of established SDG algorithms\.

The evaluation was organized around five research questions: \(i\) Does augmenting real training data with TCSDG\-generated samples improve downstream predictive performance over training on real data alone? \(ii\) Can synthetic data generated by TCSDG, used in place of real training data, match or exceed the performance obtained with real training data? \(iii\) Does TCSDG outperform established tabular SDG baselines under the same experimental protocol? \(iv\) Is the utility of TCSDG stable across heterogeneous country\-level agricultural datasets, or is it driven by a few favourable cases? \(v\) How do the synthetic\-to\-real multiplication ratio, the size of the real training set, and the choice of downstream ML learner shape the utility of the generated data?

The benchmark comprised twelve independent supervised\-learning tasks; including six regression tasks targeting crop yield prediction \(maize in Argentina, Germany, and Zambia; wheat in India, France, and Italy\), and six classification tasks targeting crop type classification in Greece, Italy, Austria, Germany, Romania, and Bulgaria\. For every task, the original reference dataset was treated as the ground\-truth source and partitioned using a standardized random\-splitting strategy\. Each dataset was divided into a training partition \(70%\) and a validation partition \(30%\); for classification tasks the split was stratified by class label to preserve class proportions\. The validation partition was withheld entirely from both SDG and ML model training, and was used exclusively for the final performance assessment\. To account for sampling variability and to mitigate the effect of any single random partition, the 70/30 split, together with the full downstream pipeline that depends on it, was repeated ten times per task using ten fixed random seeds\. All reported results are therefore expressed as the mean and standard deviation over these ten repetitions\.

To examine performance under different levels of data availability, two training regimes were derived from training partition: a full regime \(TD70\), comprising the complete 70% training partition, and a reduced regime \(TD30\), comprising a random subsample equal to 30% of the full dataset\. Within each regime, synthetic samples were generated at four multiplication ratios, 1× \(singlet\), 2× \(doubled\), 4× \(quadrupled\), and 8× \(octupled\), defined relative to the number of real training samples\.

Synthetic data were produced by TCSDG and, for benchmarking, by six established tabular SDG algorithms drawn from the Synthcity python library\(Qianet al\.,[2023](https://arxiv.org/html/2607.09751#bib.bib94)\)\. The benchmark SDG algorithms were BN\(Ankan and Panda,[2015](https://arxiv.org/html/2607.09751#bib.bib40)\), Conditional Tabular Generative Adversarial Networks \(CTGAN\)\(Xuet al\.,[2019](https://arxiv.org/html/2607.09751#bib.bib90)\), Anonymization through Data Synthesis using Generative Adversarial Networks \(ADSGAN\)\(Yoonet al\.,[2020](https://arxiv.org/html/2607.09751#bib.bib91)\), Tabular Variational Autoencoders \(TVAE\)\(Xuet al\.,[2019](https://arxiv.org/html/2607.09751#bib.bib90)\), Robust TVAE \(RTVAE\)\(Akramiet al\.,[2022](https://arxiv.org/html/2607.09751#bib.bib92)\), and tabular Denoising Diffusion Probabilistic Model \(DDPM\)\(Kotelnikovet al\.,[2023](https://arxiv.org/html/2607.09751#bib.bib93)\)\.

These six SDG models were selected because they provide sufficiently representative coverage of the major methodological families in tabular SDG\. Specifically, the BN represents probabilistic graphical and dependency\-based synthesis; CTGAN and ADSGAN represent adversarial generation, with ADSGAN additionally incorporating a privacy\-aware synthesis objective; TVAE and RTVAE represent latent\-variable VAE\-based synthesis, including a robustness\-oriented variant; and DDPM represents the class of diffusion\-based generators for heterogeneous tabular data\.

Three ML algorithms were employed for both use cases: Random Forest \(RF\)\(Breiman,[2001](https://arxiv.org/html/2607.09751#bib.bib107)\), Multilayer Perceptron \(MLP\)\(Horniket al\.,[1989](https://arxiv.org/html/2607.09751#bib.bib106)\), and Support Vector Machine \(SVM\)\(Hearstet al\.,[1998](https://arxiv.org/html/2607.09751#bib.bib108)\)\. RF, SVM, and MLP were selected due to their theoretical significance and their ability to encapsulate a broad spectrum of ML algorithms\. RF represents an ensemble\-based approach that leverage decision trees, SVM provides a strong basis for margin\-based optimization and kernel methods, and MLP captures the essence of neural network architectures\.

To isolate the contribution of synthetic data, each downstream ML algorithm was trained under three configurations: \(1\) baseline, using the real training subsets \(TD30 and TD70\) without augmentation, which served as the baseline; \(2\) synthetic, using exclusively the generated synthetic samples at each regime and ratio; and \(3\) merged, using the combination of real and synthetic samples\.

This design yielded, per task and per SDG method, six bassline configurations \(3 ML learners × 2 training data regimes\), 24 synthetic configurations \(3 ML learners × 2 training data regimes × 4 multiplication ratios\), and 24 merged configurations \(3 ML learners × 2 training data regimes × 4 multiplication ratios\)\. In the merged configuration, real samples received unit weight, while, for TCSDG, synthetic samples additionally carried quality\-aware instance weights \(Section[2\.1\.5](https://arxiv.org/html/2607.09751#S2.SS1.SSS5)\) derived from the teacher model\. The weights are utilized only by downstream ML learners that support weighted training \(RF and SVM\)\.

### 2\.3Case studies

#### 2\.3\.1Crop Type Classification

European Land Use/Cover Area frame Survey \(LUCAS\) dataset 2022\(d’Andrimontet al\.,[2024](https://arxiv.org/html/2607.09751#bib.bib87)\)that provides a unique source of publicly available land cover survey data, was used for the crop type classification task\. LUCAS collects information on land cover and land use, agro\-environmental, and soil data every three years\. The collected in\-situ information is published and is accompanied by detailed metadata, such as the acquisition date and GPS location of the observer\(d’Andrimontet al\.,[2024](https://arxiv.org/html/2607.09751#bib.bib87)\)\. Although the main purpose of LUCAS is statistical estimation and it was not designed for mapping, the potential and thoroughness of it leads to its applications in several classification tasks\(Pflugmacheret al\.,[2019](https://arxiv.org/html/2607.09751#bib.bib88); Weigandet al\.,[2020](https://arxiv.org/html/2607.09751#bib.bib89)\)\.

The LUCAS 2022 dataset was specifically used, and the crop classes were selected from the provided hierarchical classification scheme\. The data were then stratified by country, as agricultural landscapes generally vary across regions in response to both biophysical conditions and human management decisions\(Andersen,[2017](https://arxiv.org/html/2607.09751#bib.bib109)\)\. Evaluating the crop type classification procedure separately for each country enabled us to account for this heterogeneity and reduced the risk that classification accuracy would be biased by dominant data sources or region\-specific farming practices\. In addition, crop classes represented by fewer than 50 samples were removed from each country\-specific dataset\.

Among the available countries, Greece, Italy, Austria, Germany, Romania, and Bulgaria were selected\. The crop classes, the number of samples per class, and the total sample size available for each selected country are presented in Figure[2](https://arxiv.org/html/2607.09751#S2.F2)\. The class distribution clearly indicates that crop type classification is a highly imbalanced classification problem\.

![Refer to caption](https://arxiv.org/html/2607.09751v1/Figure_2.png)Figure 2:Benchmark dataset overview\. \(a\) Study areas for the two tasks: crop yield prediction \(Germany, France, Italy, India, Zambia, and Argentina\) and crop type classification \(Germany, Austria, Romania, Bulgaria, Italy, and Greece\)\. Circle size is proportional to the number of samples \(n\) in each country\-level dataset\. \(b\) Per\-class sample counts for the crop type classification datasets that displayed on a logarithmic color scale\. White cells indicate the absence of a crop class in a given country\.To employ the LUCAS data for the crop type classification task, multi\-temporal Sentinel\-2 data were used as predictor variables\. Specifically, for each LUCAS sample, all Sentinel\-2 images from 2022 with cloud coverage below 20% were acquired\. From the Sentinel\-2 spectral bands, ten bands were extracted: Band 2 \(Blue\), Band 3 \(Green\), Band 4 \(Red\), Band 5 \(Red Edge 1\), Band 6 \(Red Edge 2\), Band 7 \(Red Edge 3\), Band 8 \(NIR\), Band 8A \(Red Edge 4\), Band 11 \(SWIR 1\), and Band 12 \(SWIR 2\)\. For each band, three temporal metrics \(minimum, median, and maximum\) were then calculated to generate a Sentinel\-2 composite\. Accordingly, 30 temporal metrics of Sentinel\-2 pixels corresponding to the locations of the LUCAS samples were extracted; these comprised the per\-pixel minimum, median, and maximum values for each of the ten spectral bands\.

#### 2\.3\.2Crop Yield Prediction

Crop yield prediction experiments were carried out using version 1\.4 of CY\-Bench dataset\(Paudelet al\.,[2024](https://arxiv.org/html/2607.09751#bib.bib48)\), which focuses on subnational, end\-of\-season yield data for maize and wheat\. It includes information from both major crop\-producing nations and underrepresented regions around the world\. The dataset integrates subnational crop yield data with relevant predictors including weather during the growing season, remote sensing data, evapotranspiration, soil moisture, and static soil characteristics\. CY\-Bench was specifically curated to support model comparison across varied global agricultural systems in a way that closely mirrors real\-world scenarios\(Paudelet al\.,[2025](https://arxiv.org/html/2607.09751#bib.bib86)\)\.

Among the country\-specific data available in the CY\-Bench dataset, data from Argentina, Germany, and Zambia were used for maize yield prediction, while for wheat yield prediction, data from India, France, and Italy were used \(Figure[2](https://arxiv.org/html/2607.09751#S2.F2)\)\. These country subsets were selected to span a broad range of sample sizes \(from 949 to 6,174 records\) and to represent distinct agricultural and climatic systems\.

For each country, the CY\-Bench dataset consists of static and multi\-temporal predictor variables, of which the available water capacity, bulk density, and drainage class are the static variables, while the time\-series variables include the fraction of absorbed photosynthetically active radiation, average temperature, maximum temperature, minimum temperature, precipitation, radiation, potential evapotranspiration, climatic water balance, normalized difference vegetation index, surface soil moisture, rootzone soil moisture\.

Considering the large number of predictor variables in the CY\-Bench dataset, data preprocessing was performed\. Specifically, time\-series variables outside the period between the start and end of the growing season were excluded\. Then, for each time\-series variable, the minimum, median, and maximum values were calculated across the growing season\. Moreover, the variable named “minimum precipitation” was removed because it was effectively zero in most cases\. The final set of predictor variables for each country consisted of 35 predictor variables\.

### 2\.4Performance Evaluation

The SDG algorithms were evaluated based on their ability in providing synthetic data that is capable to improve the predictive performance of the ML algorithms in crop yield prediction and crop type classification\. All performance assessment procedures were deployed on the held\-out validation partition which was unseen by both SDG and ML training procedures, and augmentation effectiveness was quantified by comparing ML model performance with and without synthetic data\.

In the case of the crop type classification task, considering the imbalanced nature of the crop classes in the utilized reference datasets, the Balanced Accuracy \(BAC\) score\(Velezet al\.,[2007](https://arxiv.org/html/2607.09751#bib.bib95)\)was considered for performance evaluation\. This metric is specifically designed to compensate for differences in sample sizes among classes\.

BAC=1K​∑k=1KTPkTPk\+FNk\\text\{BAC\}=\\frac\{1\}\{K\}\\sum\_\{k=1\}^\{K\}\\frac\{\\text\{TP\}\_\{k\}\}\{\\text\{TP\}\_\{k\}\+\\text\{FN\}\_\{k\}\}\(13\)
whereKKis the number of classes,TPk\\text\{TP\}\_\{k\}is the number of correctly classified samples of classkk, andFNk\\text\{FN\}\_\{k\}is the number of samples belonging to classkkbut classified as another class\.

On the other hand, for the crop yield prediction task, Root Mean Squared Error \(RMSE\) was utilized as the performance evaluation metric\.

RMSE=1n​∑i=1n\(y^i−yi\)2\\text\{RMSE\}=\\sqrt\{\\frac\{1\}\{n\}\\sum\_\{i=1\}^\{n\}\(\\hat\{y\}\_\{i\}\-y\_\{i\}\)^\{2\}\}\(14\)
wherey^i\\hat\{y\}\_\{i\}andyiy\_\{i\}denote the predicted and the observed value for observationii, respectively, andnnis the total number of observations\.

Moreover, to determine whether the differences between each SDG regime and the baseline were statistically meaningful, paired non\-parametric significance testing was conducted\. For each experimental setting, the regime under consideration was paired with the baseline on a per\-repetition basis, and differences were calculated using the task\-appropriate metric\. Specifically, the two\-sided Wilcoxon signed\-rank test was applied to evaluate the null hypothesis that the median paired difference was zero without relying on parametric assumptions\. To control the family\-wise error rate across the multiple methods evaluated within each task, raw p\-values were adjusted using the Holm step\-down procedure\. A comparison was considered significant only if its Holm\-adjusted p\-value was below 0\.05 and the mean difference indicated improved ML model performance for the task under consideration\.

## 3Results and Discussion

### 3\.1Overall Utility of TCSDG

TCSDG was the only SDG method that produced statistically reliable improvements over the no\-augmentation baseline for all the twelve crop type classification and crop yield prediction tasks \(Table[1](https://arxiv.org/html/2607.09751#S3.T1)\)\. In the merged regime, TCSDG outperformed the baseline in 89% of the classification comparisons and 74% of the regression comparisons\. Among the six benchmark generators, only BN achieved a significant improvement, and only for crop yield prediction in the merged regime\. The relative competitiveness of BN is also instructive, as TCSDG itself uses BN\-based candidate generation, but the plain BN benchmark was far weaker than TCSDG, especially for classification\. This indicates that TCSDG’s advantage cannot be attributed simply to the BN generator\. Rather, the main contribution lies in the task\-conditioned framework surrounding it\. On the other hand, CTGAN, ADSGAN, TVAE, RTVAE, and DDPM did not provide significant positive utility in either task\.

The synthetic regime provides a stricter test of whether the generated data independently preserved task\-relevant structure\. TCSDG again performed best compared to the other SDG methods\. For crop type classification, TCSDG synthetic\-only regime exceeded the baseline in 91% of paired comparisons and achieved a significant mean BAC gain of 0\.05\. This result indicates that TCSDG did not merely add volume to the training set; it generated samples that retained sufficient discriminative information to train effective classifiers without access to the original records\. In crop yield prediction, TCSDG synthetic\-only regime were less effective, winning 44% of comparisons and showing a small and non\-significant mean RMSE improvement\. However, this was still the strongest synthetic\-only result among all evaluated methods in crop yield prediction task, whereas all other non\-TCSDG generators failed almost completely in synthetic\-only regime\.

Table 1:Aggregated utility of TCSDG and six benchmark SDG methods, pooled across datasets, training fractions, multiplication ratios, downstream learners, and repetitions\. Values shown are for crop type classification with crop yield prediction in parentheses\. The Win Rate column shows the proportion of paired runs in which the regime outperformed the baseline\. The Win Margin column shows the mean paired difference relative to the baseline \(BAC for classification, with sign\-flipped RMSE for regression\)\. The bold values show the most accurate method, and the entries marked with \* indicate that the Holm\-corrected, two\-sided Wilcoxon signed\-rank test p\-value is below 0\.05 and the mean difference is in the direction of improvement\.MethodsWin Rate \(%\)Win MarginMergedSyntheticMergedSyntheticTCSDG89 \(74\)91 \(44\)\+0\.04∗\\mathbf\{\+0\.04^\{\*\}\}\(\+0\.02∗\\mathbf\{\+0\.02^\{\*\}\}\)\+0\.05∗\\mathbf\{\+0\.05^\{\*\}\}\(\+0\.01\\mathbf\{\+0\.01\}\)CTGAN12 \(14\)2 \(0\)−0\.02\-0\.02\(−0\.04\-0\.04\)−0\.08\-0\.08\(−0\.39\-0\.39\)ADSGAN12 \(15\)2 \(0\)−0\.02\-0\.02\(−0\.04\-0\.04\)−0\.08\-0\.08\(−0\.37\-0\.37\)DDPM6 \(11\)3 \(0\)−0\.04\-0\.04\(−0\.17\-0\.17\)−0\.08\-0\.08\(−2\.50\-2\.50\)BN26 \(68\)10 \(35\)−0\.02\-0\.02\(\+0\.01∗\+0\.01^\{\*\}\)−0\.05\-0\.05\(−0\.02\-0\.02\)TVAE17 \(21\)2 \(0\)−0\.02\-0\.02\(−0\.02\-0\.02\)−0\.06\-0\.06\(−0\.32\-0\.32\)RTVAE24 \(21\)0\.3 \(0\)−0\.01\-0\.01\(−0\.03\-0\.03\)−0\.08\-0\.08\(−0\.75\-0\.75\)These findings support the central premise of the proposed algorithm: synthetic data are useful only when they preserve the conditional structure required by the downstream task\. The six benchmark generators are primarily designed to approximate the joint distribution of a tabular data, whereas TCSDG adds task\-conditioned budget allocation, teacher\-guided filtering, coverage\-preserving selection, and quality\-aware weighting\. This distinction is critical for agricultural prediction, where utility depends not simply on realistic records but on preserving the relationships between predictors and crop labels or yield values\. This interpretation is consistent with the broader tabular SDG literature, which emphasizes that mixed feature types, heterogeneous value ranges, and inter\-feature correlations make tabular generation difficult\(Anshelevich and Katz,[2025](https://arxiv.org/html/2607.09751#bib.bib114); Fonseca and Bacao,[2023](https://arxiv.org/html/2607.09751#bib.bib115)\)\. It also agrees with evidence that conventional tabular SDG methods do not consistently improve downstream ML efficacy in practical augmentation settings\(Manousakas and Aydöre,[2023](https://arxiv.org/html/2607.09751#bib.bib116)\)\.

The results therefore argue for a utility\-first evaluation of agricultural SDG\. In this study, a generator was judged by whether it improved prediction on held\-out real validation data, not by intrinsic fidelity alone\. This is consistent with the ML\-efficiency paradigm used in tabular SDG, where synthetic data are evaluated by training discriminative models on generated records and testing them on real records\(Borisovet al\.,[2023](https://arxiv.org/html/2607.09751#bib.bib110)\)\. It is also consistent with agricultural synthetic\-data evidence showing that realism and utility are not equivalent; task\-discriminative information can matter more than photorealism or superficial fidelity\(Kleinet al\.,[2024](https://arxiv.org/html/2607.09751#bib.bib117)\)\. This task\-utility\-first framing is also adopted in recent work on fidelity\-agnostic SDG, which explicitly argues that high statistical fidelity is neither necessary nor sufficient for downstream task utility and may in some cases harm privacy without aiding prediction\(Achterberget al\.,[2025](https://arxiv.org/html/2607.09751#bib.bib111)\)\.

### 3\.2Effect of Synthetic Multiplication Ratio

Figure[3](https://arxiv.org/html/2607.09751#S3.F3)summarizes the impact of the multiplication ratio, defined as the relative size of the generated synthetic data, on downstream ML performance across tasks and training regimes\. In the merged regime, the multiplication ratio effectively determines the relative contribution of synthetic samples to the combined real–synthetic training set\. For all benchmark SDG methods, increasing this ratio was consistently detrimental\. In crop type classification, BAC declined as the synthetic fraction increased, whereas in crop yield prediction, RMSE increased with each successive ratio\. Thus, augmentation methods that were already below the real\-data baseline at a ratio of 1 degraded further as the synthetic component became more dominant\. This behavior indicates that, for these methods, additional synthetic samples diluted rather than enriched the real training distribution\.

TCSDG was the only exception to this trend\. In crop type classification, TCSDG remained above the baseline at all multiplication ratios in the merged regime\. Its performance increased from ratios 1 to 4 and then saturated between ratios 4 and 8, suggesting that most of the classification benefit was achieved with a moderate synthetic budget\. For crop yield prediction, TCSDG maintained stable RMSE values that remained below the baseline even as the multiplication ratio increased, indicating that additional synthetic samples were beneficial or, at worst, neutral\.

The synthetic\-only regime showed a different pattern\. When real samples were removed from the training set, additional synthetic data was weakly beneficial or neutral for several benchmark SDG methods\. However, their performance still plateaued well below the real\-data baseline, indicating that larger synthetic datasets alone were insufficient to recover the task\-relevant structure present in the original data\. DDPM remained particularly the most ineffective, with consistently low classification performance and high yield\-prediction error\. The GAN\- and VAE\-based models, including ADS\-GAN, CTGAN, TVAE, and RTVAE, as well as the BN, also clustered below the baseline, especially for crop type classification\. TCSDG showed a similar saturation pattern, but at a substantially higher performance level\. In crop type classification, peak BAC was reached by the doubled ratio, whereas in crop yield prediction, RMSE converged toward the real\-data baseline with same ratio\.

![Refer to caption](https://arxiv.org/html/2607.09751v1/Figure_3.png)Figure 3:Joint effect of the synthetic multiplication ratio and downstream regime on ML performance, separated by task \(classification: BAC, higher is better; regression: RMSE, lower is better\) and regime \(merged: synthetic \+ real; synthetic: synthetic only\)\. The dashed black line is the no\-augmentation baseline\. Shaded bands are ±1 SD across the ten repetitions, pooled across the six datasets per task\.These findings indicate that the multiplication ratio should not be treated as a neutral scaling parameter\. When synthetic samples are weakly aligned with the target task, increasing their number can amplify error rather than improve generalization\. The deterioration observed for CTGAN, ADSGAN, TVAE, RTVAE, BN, and DDPM at larger ratios suggests that their samples increasingly dominated the training mixture without providing equivalent task\-relevant information\. This downward trend with increased synthetic fraction has also been observed in recent tabular benchmarks where SDG models supply samples that are statistically realistic but task\-misaligned, producing net negative augmentation utility\(Jamniket al\.,[2024](https://arxiv.org/html/2607.09751#bib.bib112); Manousakas and Aydöre,[2023](https://arxiv.org/html/2607.09751#bib.bib116)\)\.

The robustness of TCSDG can be attributed to its constrained sample\-generation strategy\. Its final synthetic set was not drawn directly from an unconstrained generator\. Instead, candidate samples were first generated in excess, then filtered according to teacher consistency, and finally selected to preserve coverage across crop classes or target bins\. This procedure prevented performance collapse at larger ratios and produced controlled saturation rather than unlimited improvement\. From a practical perspective, this result suggests that moderate augmentation ratios may be sufficient to capture most of the benefit of TCSDG, whereas excessive synthetic expansion is unnecessary\.

### 3\.3Downstream Learner Response

To test whether the conclusions of the aggregate analysis hold across individual downstream ML learners, Table[2](https://arxiv.org/html/2607.09751#S3.T2)reports a per\-learner breakdown of generator utility\. These results confirm that the benefit of TCSDG was, in general, consistent in direction but that its magnitude depended on the learner it was paired with\.

Table 2:Per\-ML\-learner breakdown of generator utility, pooled across datasets, training fractions, multiplication ratios, and repetitions\. Win Rate \(%\) is the proportion of paired runs in which the generator\-and\-learner combination outperformed the no\-augmentation baseline\. Performance Gain is the mean signed difference from that baseline, expressed in the natural metric units, where positive values denote improvement \(BAC, for classification and sign\-flipped RMSE for regression\)\. The bold values show the most accurate method in each configuration, and the entries marked \* are those that are statistically significant\.MethodModeWin Rate \(%\)Performance GainMLPRFSVMMLPRFSVMCrop Type ClassificationTCSDGMerged6899100\+0\.011\*\+0\.037\*\+0\.069\*Synthetic7599100\+0\.018\*\+0\.048\*\+0\.090\*ADSGANMerged31914−\-0\.036−\-0\.010−\-0\.009Synthetic014−\-0\.131−\-0\.068−\-0\.049BNMerged82247−\-0\.044−\-0\.011\+0\.003\*Synthetic3622−\-0\.082−\-0\.040−\-0\.023CTGANMerged71613−\-0\.038−\-0\.011−\-0\.009Synthetic004−\-0\.128−\-0\.065−\-0\.046DDPMMerged7111−\-0\.052−\-0\.021−\-0\.034Synthetic019−\-0\.119−\-0\.063−\-0\.049RTVAEMerged73136−\-0\.029−\-0\.004−\-0\.006Synthetic001−\-0\.129−\-0\.068−\-0\.047TVAEMerged52027−\-0\.040−\-0\.011−\-0\.006Synthetic007−\-0\.106−\-0\.053−\-0\.033Crop Yield PredictionTCSDGMerged468097\+0\.008\+0\.015\*\+0\.028\*Synthetic363460−\-0\.006−\-0\.017\+0\.011\*ADSGANMerged3238−\-0\.032−\-0\.057−\-0\.023Synthetic000−\-0\.427−\-0\.385−\-0\.302BNMerged367593−\-0\.008\+0\.014\*\+0\.021\*Synthetic222856−\-0\.037−\-0\.030\+0\.007CTGANMerged3027−\-0\.037−\-0\.060−\-0\.024Synthetic000−\-0\.441−\-0\.403−\-0\.317DDPMMerged9210−\-0\.205−\-0\.021−\-0\.256Synthetic000−\-2\.994−\-1\.690−\-2\.268RTVAEMerged221031−\-0\.052−\-0\.025−\-0\.015Synthetic000−\-1\.063−\-0\.502−\-0\.397TVAEMerged24434−\-0\.036−\-0\.039−\-0\.009Synthetic000−\-0\.449−\-0\.313−\-0\.229For crop type classification, TCSDG was the only generator to improve all three ML algorithms in both the merged and synthetic regimes, with near\-perfect win rates for RF and SVM \(99–100%\) and a lower but still positive rate for MLP \(68–75%\)\. The performance gains were largest for SVM \(\+0\.069 merged, \+0\.090 synthetic\), followed by RF and MLP\. The same ordering held for crop yield prediction: TCSDG significantly improved SVM in both regimes and RF in the merged regime, whereas its effect on MLP was weak or slightly negative\. Among the competing generators, only BN produced any positive performance gain, strongest with RF and SVM in the merged regime \(\+0\.014, \+0\.021\); every other SDG method negatively impacted RMSE relative to the baseline\.

This learner\-level view also sharpens the contrast between the two augmentation regimes\. For the benchmark SDG methods, utility largely collapsed once the real training data were removed: synthetic\-only win rates fell to or near 0% in most regression settings, and the associated errors grew by an order of magnitude or more for the diffusion\- and VAE\-based methods \(for example, DDPM reached mean changes of \-2\.994, \-1\.690, and \-2\.268 for MLP, RF, and SVM, respectively\)\.

These learner\-dependent patterns are consistent with both the algorithmic design of TCSDG and the inductive biases of the learners\. In the merged regime, TCSDG synthetic samples carried teacher\-derived, quality\-aware weights, but these weights could only be exploited by learners that support weighted training, namely RF and SVM\. Both could therefore up\-weight high\-confidence synthetic records while discounting lower\-confidence ones, whereas MLP received no such signal, a plausible contributor to its weaker response\. The effect was strongest for SVM because its decision boundary is determined by a subset of margin\-defining support vectors\(Mountrakiset al\.,[2011](https://arxiv.org/html/2607.09751#bib.bib118)\): well\-placed synthetic points can directly improve the margin geometry\. The teacher\-consistency filter, by preferentially retaining the high\-confidence samples that sharpen the margin and discarding those that would blur it, is the most likely reason SVM benefited most\.

The comparative robustness of RF is partly consistent with the expectation that tree ensembles tolerate noisy inputs\(Belgiu and Drăguţ,[2016](https://arxiv.org/html/2607.09751#bib.bib119)\)\. Under the weakest classification generator, DDPM in the merged regime, RF showed the smallest BAC degradation \(–0\.021\) relative to SVM \(–0\.034\) and MLP \(–0\.052\)\. The weaker MLP response should not, however, be read as evidence that neural models cannot benefit from synthetic data; rather, on these tabular agricultural tasks the MLP was simply more sensitive to imperfect synthetic calibration and could not access TCSDG’s sample\-weighting mechanism\. Taken together, the per\-learner results reinforce the broader observation that synthetic\-data utility is determined jointly by generator quality, the downstream learner, and the augmentation size, rather than by any single factor\(Ebrahimyet al\.,[2023](https://arxiv.org/html/2607.09751#bib.bib47)\)\.

### 3\.4Effect of Training Data Size

For each SDG method and evaluation regime, the win rate against the real\-data baseline and the mean difference relative to that baseline at two real\-training\-data fractions \(TD30 and TD70\) is presented in Figure[4](https://arxiv.org/html/2607.09751#S3.F4)\. In crop\-type classification, TCSDG remains consistently superior under both data fractions\. In the merged regime, it achieves win rates of 90% at TD30 and 88% at TD70, while in the synthetic\-only regime its win rate remains stable at 91% under both conditions\. By contrast, all benchmark SDG methods remains below the baseline in crop type classification at both training sizes\. For crop\-yield prediction, the effects are smaller but still favor TCSDG\. In the merged regime, TCSDG achieves win rates of 73% at TD30 and 74% at TD70\. BN was the only other generator that shows systematic positive utility for crop yield prediction, with its win rate increasing from 67% to 69%\. The remaining SDG methods show low win rates, and their synthetic\-only results are effectively unusable\.

For most benchmark SDG methods, increasing the amount of real\-training\-data weakened their relative position because the real\-only baseline became stronger and therefore more difficult to outperform\. Under the merged regime, classification win rates decline across the benchmark methods, including BN from 31% to 20%, TVAE from 20% to 15%, and DDPM from 9% to 4%\. A similar pattern was observed in crop yield prediction, where the GAN\-based generators lost much of their relative utility; for example, ADSGAN declined from 21% to 8% and CTGAN from 19% to 9%\. In the synthetic regime, DDPM deteriorates further, with its mean gap from the baseline widening from−\-2 at TD30 to−\-3 at TD70\. The only partial exception among the benchmark SDG methods was BN in yield prediction under the merged regime, where it remains above the baseline and improved slightly as more real\-training\-data became available\. TCSDG showed the opposite pattern as rather than losing utility as the real\-training\-data fraction increased, it maintained or extended its advantage over the baseline\.

![Refer to caption](https://arxiv.org/html/2607.09751v1/Figure_4.png)Figure 4:Effect of the real\-data\-training fraction \(TD30 and TD70\) on utility of SDG methods, under merged and synthetic regimes\. \(a, b\) Win rate \(%\) over the no\-augmentation baseline for crop type classification and crop yield prediction\. \(c, d\) Mean signed difference to the baseline in the metric’s natural units \(BAC for classification, sign\-flipped RMSE for regression\)\.This pattern was notable because many tabular SDG methods are motivated by limited\-data settings and are commonly evaluated under data\-scarcity assumptions\(Akkemet al\.,[2024](https://arxiv.org/html/2607.09751#bib.bib120); Fonseca and Bacao,[2023](https://arxiv.org/html/2607.09751#bib.bib115); Jamniket al\.,[2024](https://arxiv.org/html/2607.09751#bib.bib112)\)\. Previous work has also shown that, for some SDG approaches, the largest performance gains occur in the smallest\-data regime and diminish as more real data become available\(Ebrahimyet al\.,[2023](https://arxiv.org/html/2607.09751#bib.bib47)\)\. TCSDG departed from this scarcity\-driven pattern, since its utility persisted, and in classification even increased, when the real\-training\-data fraction rose from 30% to 70%\. Methodologically, this persistence suggested that TCSDG captured information that was not redundant with the real training data; otherwise, its marginal benefit would have been expected to shrink toward zero as the real\-data baseline strengthened\.

### 3\.5Per\-dataset breakdown

At the dataset level with fixed multiplication ratio of 2 and merged regime \(see Table[3](https://arxiv.org/html/2607.09751#S3.T3)\), TCSDG shows the most stable performance among all generators\. For the crop type classification task, TCSDG attained the highest mean BAC across all six datasets and was the only generator to produce statistically significant improvements over the baseline in all the experiments\. The remaining SDG methods \(ADSGAN, BN, CTGAN, DDPM, RTVAE, and TVAE\) consistently fail to surpass the baseline and, in several cases most notably DDPM in Germany and Romania, aggressively degrade downstream classification quality\.

Table 3:The per\-dataset breakdown of SDG performance at a fixed multiplication ratio of 2 and merged regime, with each cell summarizing 60 paired evaluations \(10 repetitions × 3 downstream ML learners × 2 real training\-data\-fractions\)\. The values represent mean BAC for crop type classification and RMSE for crop yield prediction with standard deviation values provided in parenthesis\. The bold values show the most accurate method in each dataset, and the \* sign marks entries that outperform baseline on a paired Wilcoxon signed\-rank test, with the Holm correction applied within each row across the seven SDG method\-vs\-baseline hypotheses\.TaskDatasetBaselineTCSDGADSGANBNCTGANDDPMRTVAETVAECrop Type ClassificationAustria0\.23\(0\.07\)0\.28\(0\.04\)\*0\.21\(0\.06\)0\.21\(0\.04\)0\.21\(0\.05\)0\.19\(0\.06\)0\.22\(0\.05\)0\.21\(0\.04\)Bulgaria0\.17\(0\.05\)0\.22\(0\.03\)\*0\.16\(0\.04\)0\.17\(0\.04\)0\.16\(0\.04\)0\.16\(0\.05\)0\.16\(0\.04\)0\.16\(0\.04\)Germany0\.12\(0\.03\)0\.15\(0\.02\)\*0\.10\(0\.02\)0\.10\(0\.02\)0\.10\(0\.02\)0\.09\(0\.01\)0\.11\(0\.02\)0\.10\(0\.02\)Greece0\.22\(0\.04\)0\.25\(0\.03\)\*0\.21\(0\.03\)0\.21\(0\.03\)0\.21\(0\.03\)0\.18\(0\.06\)0\.21\(0\.03\)0\.20\(0\.03\)Italy0\.18\(0\.04\)0\.21\(0\.02\)\*0\.17\(0\.03\)0\.16\(0\.02\)0\.17\(0\.03\)0\.16\(0\.03\)0\.17\(0\.03\)0\.15\(0\.03\)Romania0\.13\(0\.04\)0\.17\(0\.03\)\*0\.12\(0\.03\)0\.12\(0\.03\)0\.12\(0\.02\)0\.10\(0\.02\)0\.13\(0\.03\)0\.12\(0\.03\)Crop Yield PredictionGermany1\.09\(0\.10\)1\.07\(0\.07\)\*1\.10\(0\.06\)1\.09\(0\.09\)\*1\.10\(0\.06\)1\.27\(0\.19\)1\.09\(0\.06\)\*1\.09\(0\.06\)\*India0\.54\(0\.03\)0\.54\(0\.04\)0\.58\(0\.05\)0\.54\(0\.05\)0\.58\(0\.05\)0\.64\(0\.09\)0\.57\(0\.07\)0\.57\(0\.06\)Zambia0\.58\(0\.05\)0\.58\(0\.06\)0\.59\(0\.04\)0\.59\(0\.07\)0\.60\(0\.05\)0\.67\(0\.10\)0\.60\(0\.06\)0\.60\(0\.06\)Argentina1\.36\(0\.13\)1\.35\(0\.13\)\*1\.42\(0\.11\)1\.36\(0\.14\)1\.44\(0\.11\)1\.64\(0\.29\)1\.41\(0\.13\)1\.41\(0\.11\)France0\.78\(0\.14\)0\.72\(0\.10\)\*0\.79\(0\.10\)0\.73\(0\.10\)\*0\.79\(0\.10\)0\.94\(0\.14\)0\.78\(0\.09\)0\.77\(0\.09\)Italy0\.82\(0\.11\)0\.80\(0\.11\)\*0\.83\(0\.09\)0\.80\(0\.11\)\*0\.83\(0\.10\)0\.88\(0\.10\)0\.83\(0\.11\)0\.84\(0\.10\)The crop yield prediction results were more nuanced but remained consistent with the classification findings\. TCSDG achieved the best mean RMSE on five of six datasets and significantly improved performance on Germany, Argentina, France, and Italy\. On India, TCSDG matches the baseline \(both 0\.54\) with no meaningful difference, while Zambia was the only dataset where the baseline retains the lowest \(best\) mean RMSE\. Even in Zambia, the TCSDG–baseline difference was within one standard deviation and did not indicate a significant loss\. BN was again the only credible non\-TCSDG alternative, producing significant RMSE reductions on Germany, France, and Italy\. DDPM was consistently the weakest method, increasing RMSE values on every dataset\.

The robustness of TCSDG across country\-level LUCAS crop classification tasks and CY\-Bench yield\-prediction tasks suggests that its advantage was not caused by a single favorable dataset\. In both tasks the relative position of each generator was essentially identical from dataset to dataset, supporting the view that the observed effects reflect genuine differences in generator quality rather than artefacts of any particular dataset or experimental configuration\. The cross\-dataset stability observed here therefore strengthens the case for TCSDG as a task\-aware augmentation method\.

### 3\.6Implications and Future Direction

The results carry three methodological implications for synthetic data in agriculture\. First, the utility of a tabular SDG method is determined by whether it preserves the conditional structure required by the downstream task, not by how realistically it reproduces the joint distribution; methods optimized for fidelity alone do not consistently transfer to the agricultural settings examined here\. Second, the synthetic multiplication ratio is not a neutral scaling parameter: when the generator is task\-misaligned, larger synthetic budgets actively erode downstream performance, whereas a task\-conditioned generator such as TCSDG exhibits controlled saturation\. Third, generator choice cannot be decoupled from the choice of downstream learner: learners that support sample weighting realize the largest gains from TCSDG, while unweighted learners respond more conservatively\. Taken together, these observations argue for a unified, task\-conditioned design and evaluation pipeline for agricultural synthetic data, in which the generator, the candidate\-selection stage, and the downstream training procedure are co\-specified rather than treated as independent modules\.

Several scope decisions in this work define its natural extensions\. The benchmark is utility\-centered, consistent with the ML\-efficiency evaluation paradigm of the tabular SDG literature; fidelity and privacy diagnostics, for example, the distance\-to\-closest\-record analysis used to detect memorization of training records\(Borisovet al\.,[2023](https://arxiv.org/html/2607.09751#bib.bib110)\), are complementary directions that can be layered onto the present framework\. Moreover, a promising direction is to leverage tabular foundation models \(e\.g\., TabICL\) to design a model\-agnostic framework that operates on top of arbitrary SDG methods and prunes their generated samples into task\-aware subsets tailored to the intended downstream application\. Such a framework would decouple the synthetic data quality from the choice of generator and could provide a principled mechanism for selecting samples that maximize downstream utility rather than purely statistical fidelity\.

## 4Conclusion

This study introduced TCSDG, a task\-conditioned synthetic data generation algorithm that combines class\- or bin\-aware budget allocation, a teacher\-based consistency filter, coverage\-preserving selection, and quality\-aware sample weighting into a single pipeline\. The algorithm was benchmarked against six established tabular SDG methods on twelve supervised agricultural tasks under identical training regimes, multiplication ratios, and downstream ML learners\. TCSDG was the only method in the benchmark to deliver statistically reliable improvements over the no\-augmentation baseline in both tasks under the merged regime, and for crop type classification under the synthetic regime\. For crop yield prediction under the synthetic regime, TCSDG remained the best\-performing method, although its mean improvement was not statistically significant\. Its advantage held across multiplication ratios, with performance saturating rather than collapsing as the synthetic fraction grew; across downstream learners, with the largest gains for RF and SVM that exploit the teacher\-derived instance weights; and across all twelve country\-level datasets\. Crucially, the benefit did not vanish when real training data became more abundant, indicating that TCSDG supplies task\-relevant variation that is complementary, rather than redundant, to the real training set\.

## 5Acknowledgements

This work was supported by the Lower Saxony Ministry of Science and Culture \(MWK\), funded through the zukunft\.niedersachsen program of the Volkswagen Foundation \(ZN4072\)\.

## 6Data availability statement

## References

- Fidelity\-agnostic synthetic data generation improves utility while retaining privacy\.Patterns6\(10\),pp\. 101287\(en\)\.External Links:ISSN 26663899,[Link](https://linkinghub.elsevier.com/retrieve/pii/S2666389925001357),[Document](https://dx.doi.org/10.1016/j.patter.2025.101287)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p9.1),[§3\.1](https://arxiv.org/html/2607.09751#S3.SS1.p4.1)\.
- Y\. Akkem, S\. K\. Biswas, and A\. Varanasi \(2024\)A comprehensive review of synthetic data generation in smart farming by using variational autoencoder and generative adversarial network\.Engineering Applications of Artificial Intelligence131,pp\. 107881\(en\)\.External Links:ISSN 09521976,[Link](https://linkinghub.elsevier.com/retrieve/pii/S0952197624000393),[Document](https://dx.doi.org/10.1016/j.engappai.2024.107881)Cited by:[§3\.4](https://arxiv.org/html/2607.09751#S3.SS4.p3.1)\.
- H\. Akrami, A\. A\. Joshi, J\. Li, S\. Aydöre, and R\. M\. Leahy \(2022\)A robust variational autoencoder using beta divergence\.Knowledge\-Based Systems238,pp\. 107886\(en\)\.External Links:ISSN 09507051,[Link](https://linkinghub.elsevier.com/retrieve/pii/S0950705121010534),[Document](https://dx.doi.org/10.1016/j.knosys.2021.107886)Cited by:[§2\.2](https://arxiv.org/html/2607.09751#S2.SS2.p5.1)\.
- M\. Alami Machichi, L\. E\. Mansouri, Y\. Imani, O\. Bourja, O\. Lahlou, Y\. Zennayi, F\. Bourzeix, I\. Hanadé Houmma, and R\. Hadria \(2023\)Crop mapping using supervised machine learning and deep learning: a systematic literature review\.International Journal of Remote Sensing44\(8\),pp\. 2717–2753\(en\)\.External Links:ISSN 0143\-1161, 1366\-5901,[Link](https://www.tandfonline.com/doi/full/10.1080/01431161.2023.2205984),[Document](https://dx.doi.org/10.1080/01431161.2023.2205984)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p13.1)\.
- E\. Andersen \(2017\)The farming system component of European agricultural landscapes\.European Journal of Agronomy82,pp\. 282–291\(en\)\.External Links:ISSN 11610301,[Link](https://linkinghub.elsevier.com/retrieve/pii/S116103011630171X),[Document](https://dx.doi.org/10.1016/j.eja.2016.09.011)Cited by:[§2\.3\.1](https://arxiv.org/html/2607.09751#S2.SS3.SSS1.p2.1)\.
- A\. Ankan and A\. Panda \(2015\)Pgmpy: Probabilistic Graphical Models using Python\.InSciPy,Austin, Texas,pp\. 6–11\.External Links:[Link](https://doi.curvenote.com/10.25080/Majora-7b98e3ed-001),[Document](https://dx.doi.org/10.25080/Majora-7b98e3ed-001)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p11.1),[§2\.2](https://arxiv.org/html/2607.09751#S2.SS2.p5.1)\.
- D\. Anshelevich and G\. Katz \(2025\)Synthetic tabular data generation using a VAE\-GAN architecture\.Knowledge\-Based Systems326,pp\. 113997\(en\)\.External Links:ISSN 09507051,[Link](https://linkinghub.elsevier.com/retrieve/pii/S0950705125010421),[Document](https://dx.doi.org/10.1016/j.knosys.2025.113997)Cited by:[§3\.1](https://arxiv.org/html/2607.09751#S3.SS1.p3.1)\.
- I\. Becker\-Reshef, B\. Barker, A\. Whitcraft, P\. Oliva, K\. Mobley, C\. Justice, and R\. Sahajpal \(2023\)Crop Type Maps for Operational Global Agricultural Monitoring\.Scientific Data10\(1\),pp\. 172\(en\)\.External Links:ISSN 2052\-4463,[Link](https://www.nature.com/articles/s41597-023-02047-9),[Document](https://dx.doi.org/10.1038/s41597-023-02047-9)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p1.1)\.
- M\. Belgiu and L\. Drăguţ \(2016\)Random forest in remote sensing: A review of applications and future directions\.ISPRS Journal of Photogrammetry and Remote Sensing114,pp\. 24–31\(en\)\.External Links:ISSN 09242716,[Link](https://linkinghub.elsevier.com/retrieve/pii/S0924271616000265),[Document](https://dx.doi.org/10.1016/j.isprsjprs.2016.01.011)Cited by:[§3\.3](https://arxiv.org/html/2607.09751#S3.SS3.p5.1)\.
- V\. Borisov, K\. Seßler, T\. Leemann, M\. Pawelczyk, and G\. Kasneci \(2023\)Language Models are Realistic Tabular Data Generators\.arXiv\.Note:arXiv:2210\.06280 \[cs\.LG\]External Links:[Link](http://arxiv.org/abs/2210.06280),[Document](https://dx.doi.org/10.48550/arXiv.2210.06280)Cited by:[§3\.1](https://arxiv.org/html/2607.09751#S3.SS1.p4.1),[§3\.6](https://arxiv.org/html/2607.09751#S3.SS6.p2.1)\.
- A\. Bouguettaya, H\. Zarzour, A\. Kechida, and A\. M\. Taberkit \(2022\)Deep learning techniques to classify agricultural crops through UAV imagery: a review\.Neural Computing and Applications34\(12\),pp\. 9511–9536\(en\)\.External Links:ISSN 0941\-0643, 1433\-3058,[Link](https://link.springer.com/10.1007/s00521-022-07104-9),[Document](https://dx.doi.org/10.1007/s00521-022-07104-9)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p1.1)\.
- L\. Breiman \(2001\)Random Forests\.Machine Learning45\(1\),pp\. 5–32\(en\)\.External Links:ISSN 0885\-6125, 1573\-0565,[Link](https://link.springer.com/10.1023/A:1010933404324),[Document](https://dx.doi.org/10.1023/A%3A1010933404324)Cited by:[§2\.2](https://arxiv.org/html/2607.09751#S2.SS2.p7.1)\.
- A\. D\. Călin, A\. M\. Coroiu, and H\. B\. Mureşan \(2023\)Analysis of Preprocessing Techniques for Missing Data in the Prediction of Sunflower Yield in Response to the Effects of Climate Change\.Applied Sciences13\(13\),pp\. 7415\(en\)\.External Links:ISSN 2076\-3417,[Link](https://www.mdpi.com/2076-3417/13/13/7415),[Document](https://dx.doi.org/10.3390/app13137415)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p4.1)\.
- M\. C\. Caro, H\. Huang, M\. Cerezo, K\. Sharma, A\. Sornborger, L\. Cincio, and P\. J\. Coles \(2022\)Generalization in quantum machine learning from few training data\.Nature Communications13\(1\),pp\. 4919\(en\)\.External Links:ISSN 2041\-1723,[Link](https://www.nature.com/articles/s41467-022-32550-3),[Document](https://dx.doi.org/10.1038/s41467-022-32550-3)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p3.1)\.
- A\. J\. Challinor, J\. Watson, D\. B\. Lobell, S\. M\. Howden, D\. R\. Smith, and N\. Chhetri \(2014\)A meta\-analysis of crop yield under climate change and adaptation\.Nature Climate Change4\(4\),pp\. 287–291\(en\)\.External Links:ISSN 1758\-678X, 1758\-6798,[Link](https://www.nature.com/articles/nclimate2153),[Document](https://dx.doi.org/10.1038/nclimate2153)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p1.1)\.
- N\. V\. Chawla, K\. W\. Bowyer, L\. O\. Hall, and W\. P\. Kegelmeyer \(2002\)SMOTE: synthetic minority over\-sampling technique\.J\. Artif\. Int\. Res\.16\(1\),pp\. 321–357\.External Links:ISSN 1076\-9757Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p8.1)\.
- S\. Condran, M\. Bewong, M\. Z\. Islam, L\. Maphosa, and L\. Zheng \(2022\)Machine Learning in Precision Agriculture: A Survey on Trends, Applications and Evaluations Over Two Decades\.IEEE Access10,pp\. 73786–73803\.External Links:ISSN 2169\-3536,[Link](https://ieeexplore.ieee.org/document/9815230/),[Document](https://dx.doi.org/10.1109/ACCESS.2022.3188649)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p4.1)\.
- Z\. Cui and G\. Gong \(2018\)The effect of machine learning regression algorithms and sample size on individualized behavioral prediction with functional connectivity features\.NeuroImage178,pp\. 622–637\(en\)\.External Links:ISSN 10538119,[Link](https://linkinghub.elsevier.com/retrieve/pii/S1053811918305081),[Document](https://dx.doi.org/10.1016/j.neuroimage.2018.06.001)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p3.1)\.
- R\. d’Andrimont, M\. Yordanov, F\. Sedano, A\. Verhegghen, P\. Strobl, S\. Zachariadis, F\. Camilleri, A\. Palmieri, B\. Eiselt, J\. M\. Rubio Iglesias, and M\. Van Der Velde \(2024\)Advances in LUCAS Copernicus 2022: enhancing Earth observations with comprehensive in situ data on EU land cover and use\.Earth System Science Data16\(12\),pp\. 5723–5735\(en\)\.External Links:ISSN 1866\-3516,[Link](https://essd.copernicus.org/articles/16/5723/2024/),[Document](https://dx.doi.org/10.5194/essd-16-5723-2024)Cited by:[§2\.3\.1](https://arxiv.org/html/2607.09751#S2.SS3.SSS1.p1.1)\.
- C\. M\. De Melo, A\. Torralba, L\. Guibas, J\. DiCarlo, R\. Chellappa, and J\. Hodgins \(2022\)Next\-generation deep learning based on simulators and synthetic data\.Trends in Cognitive Sciences26\(2\),pp\. 174–187\(en\)\.External Links:ISSN 13646613,[Link](https://linkinghub.elsevier.com/retrieve/pii/S136466132100293X),[Document](https://dx.doi.org/10.1016/j.tics.2021.11.008)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p7.1)\.
- H\. Ebrahimy, Y\. Wang, and Z\. Zhang \(2023\)Utilization of synthetic minority oversampling technique for improving potato yield prediction using remote sensing data and machine learning algorithms with small sample size of yield data\.ISPRS Journal of Photogrammetry and Remote Sensing201,pp\. 12–25\(en\)\.External Links:ISSN 09242716,[Link](https://linkinghub.elsevier.com/retrieve/pii/S0924271623001338),[Document](https://dx.doi.org/10.1016/j.isprsjprs.2023.05.015)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p13.1),[§3\.3](https://arxiv.org/html/2607.09751#S3.SS3.p5.1),[§3\.4](https://arxiv.org/html/2607.09751#S3.SS4.p3.1)\.
- A\. Elmes, H\. Alemohammad, R\. Avery, K\. Caylor, J\. Eastman, L\. Fishgold, M\. Friedl, M\. Jain, D\. Kohli, J\. Laso Bayas, D\. Lunga, J\. McCarty, R\. Pontius, A\. Reinmann, J\. Rogan, L\. Song, H\. Stoynova, S\. Ye, Z\. Yi, and L\. Estes \(2020\)Accounting for Training Data Error in Machine Learning Applied to Earth Observations\.Remote Sensing12\(6\),pp\. 1034\(en\)\.External Links:ISSN 2072\-4292,[Link](https://www.mdpi.com/2072-4292/12/6/1034),[Document](https://dx.doi.org/10.3390/rs12061034)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p3.1)\.
- T\. Emmanuel, T\. Maupong, D\. Mpoeleng, T\. Semong, B\. Mphago, and O\. Tabona \(2021\)A survey on missing data in machine learning\.Journal of Big Data8\(1\),pp\. 140\(en\)\.External Links:ISSN 2196\-1115,[Link](https://journalofbigdata.springeropen.com/articles/10.1186/s40537-021-00516-9),[Document](https://dx.doi.org/10.1186/s40537-021-00516-9)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p4.1)\.
- S\. Feng, J\. Zhao, T\. Liu, H\. Zhang, Z\. Zhang, and X\. Guo \(2019\)Crop Type Identification and Mapping Using Machine Learning Algorithms and Sentinel\-2 Time Series Data\.IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing12\(9\),pp\. 3295–3306\.External Links:ISSN 1939\-1404, 2151\-1535,[Link](https://ieeexplore.ieee.org/document/8753575/),[Document](https://dx.doi.org/10.1109/JSTARS.2019.2922469)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p2.1)\.
- J\. Fonseca and F\. Bacao \(2023\)Tabular and latent space synthetic data generation: a literature review\.Journal of Big Data10\(1\),pp\. 115\(en\)\.External Links:ISSN 2196\-1115,[Link](https://journalofbigdata.springeropen.com/articles/10.1186/s40537-023-00792-7),[Document](https://dx.doi.org/10.1186/s40537-023-00792-7)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p7.1),[§1](https://arxiv.org/html/2607.09751#S1.p9.1),[§3\.1](https://arxiv.org/html/2607.09751#S3.SS1.p3.1),[§3\.4](https://arxiv.org/html/2607.09751#S3.SS4.p3.1)\.
- G\. M\. Foody and A\. Mathur \(2004\)Toward intelligent training of supervised image classifications: directing training data acquisition for SVM classification\.Remote Sensing of Environment93\(1\-2\),pp\. 107–117\(en\)\.External Links:ISSN 00344257,[Link](https://linkinghub.elsevier.com/retrieve/pii/S003442570400207X),[Document](https://dx.doi.org/10.1016/j.rse.2004.06.017)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p3.1)\.
- J\. Gallego, E\. Carfagna, and B\. Baruth \(2010\)Accuracy, Objectivity and Efficiency of Remote Sensing for Agricultural Statistics\.InAgricultural Survey Methods,R\. Benedetti, M\. Bee, G\. Espa, and F\. Piersimoni \(Eds\.\),pp\. 193–211\(en\)\.External Links:ISBN 978\-0\-470\-74371\-3 978\-0\-470\-66548\-0,[Link](https://onlinelibrary.wiley.com/doi/10.1002/9780470665480.ch12),[Document](https://dx.doi.org/10.1002/9780470665480.ch12)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p1.1)\.
- H\. Gm, M\. K\. Gourisaria, M\. Pandey, and S\. S\. Rautaray \(2020\)A comprehensive survey and analysis of generative models in machine learning\.Computer Science Review38,pp\. 100285\(en\)\.External Links:ISSN 15740137,[Link](https://linkinghub.elsevier.com/retrieve/pii/S1574013720303853),[Document](https://dx.doi.org/10.1016/j.cosrev.2020.100285)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p8.1)\.
- I\. J\. Goodfellow, J\. Pouget\-Abadie, M\. Mirza, B\. Xu, D\. Warde\-Farley, S\. Ozair, A\. Courville, and Y\. Bengio \(2014\)Generative Adversarial Networks\.arXiv\.Note:arXiv:1406\.2661 \[stat\.ML\]External Links:[Link](http://arxiv.org/abs/1406.2661),[Document](https://dx.doi.org/10.48550/arXiv.1406.2661)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p8.1)\.
- M\.A\. Hearst, S\.T\. Dumais, E\. Osuna, J\. Platt, and B\. Scholkopf \(1998\)Support vector machines\.IEEE Intelligent Systems and their Applications13\(4\),pp\. 18–28\.External Links:ISSN 1094\-7167,[Link](http://ieeexplore.ieee.org/document/708428/),[Document](https://dx.doi.org/10.1109/5254.708428)Cited by:[§2\.2](https://arxiv.org/html/2607.09751#S2.SS2.p7.1)\.
- M\. Hernandez, G\. Epelde, A\. Alberdi, R\. Cilla, and D\. Rankin \(2022\)Synthetic data generation for tabular health records: A systematic review\.Neurocomputing493,pp\. 28–45\(en\)\.External Links:ISSN 09252312,[Link](https://linkinghub.elsevier.com/retrieve/pii/S0925231222004349),[Document](https://dx.doi.org/10.1016/j.neucom.2022.04.053)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p8.1)\.
- G\. Hinton, O\. Vinyals, and J\. Dean \(2015\)Distilling the Knowledge in a Neural Network\.arXiv\.Note:Version Number: 1External Links:[Link](https://arxiv.org/abs/1503.02531),[Document](https://dx.doi.org/10.48550/ARXIV.1503.02531)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p10.1)\.
- J\. Hoffmann, Y\. Bar\-Sinai, L\. M\. Lee, J\. Andrejevic, S\. Mishra, S\. M\. Rubinstein, and C\. H\. Rycroft \(2019\)Machine learning in a data\-limited regime: Augmenting experiments with synthetic data uncovers order in crumpled sheets\.Science Advances5\(4\),pp\. eaau6792\(en\)\.External Links:ISSN 2375\-2548,[Link](https://www.science.org/doi/10.1126/sciadv.aau6792),[Document](https://dx.doi.org/10.1126/sciadv.aau6792)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p4.1)\.
- N\. Hollmann, S\. Müller, L\. Purucker, A\. Krishnakumar, M\. Körfer, S\. B\. Hoo, R\. T\. Schirrmeister, and F\. Hutter \(2025\)Accurate predictions on small data with a tabular foundation model\.Nature637\(8045\),pp\. 319–326\(en\)\.External Links:ISSN 0028\-0836, 1476\-4687,[Link](https://www.nature.com/articles/s41586-024-08328-6),[Document](https://dx.doi.org/10.1038/s41586-024-08328-6)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p10.1)\.
- K\. Hornik, M\. Stinchcombe, and H\. White \(1989\)Multilayer feedforward networks are universal approximators\.Neural Networks2\(5\),pp\. 359–366\(en\)\.External Links:ISSN 08936080,[Link](https://linkinghub.elsevier.com/retrieve/pii/0893608089900208),[Document](https://dx.doi.org/10.1016/0893-6080%2889%2990020-8)Cited by:[§2\.2](https://arxiv.org/html/2607.09751#S2.SS2.p7.1)\.
- M\. Jamnik, X\. Jiang, A\. Margeloiu, and N\. Simidjievski \(2024\)TabEBM: A Tabular Data Augmentation Method with Distinct Class\-Specific Energy\-Based Models\.InAdvances in Neural Information Processing Systems 37,Vancouver, BC, Canada,pp\. 72094–72144\.External Links:ISBN 979\-8\-3313\-1438\-5,[Link](http://www.proceedings.com/079017-2302.html),[Document](https://dx.doi.org/10.52202/079017-2302)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p9.1),[§3\.2](https://arxiv.org/html/2607.09751#S3.SS2.p4.1),[§3\.4](https://arxiv.org/html/2607.09751#S3.SS4.p3.1)\.
- M\. I\. Jordan and T\. M\. Mitchell \(2015\)Machine learning: Trends, perspectives, and prospects\.Science349\(6245\),pp\. 255–260\(en\)\.External Links:ISSN 0036\-8075, 1095\-9203,[Link](https://www.science.org/doi/10.1126/science.aaa8415),[Document](https://dx.doi.org/10.1126/science.aaa8415)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p3.1)\.
- J\. Jordon, J\. Yoon, and M\. van der Schaar \(2018\)PATE\-gan: generating synthetic data with differential privacy guarantees\.InInternational Conference on Learning Representations,pp\. 1–21\.External Links:[Link](https://api.semanticscholar.org/CorpusID:53342261)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p7.1)\.
- Y\. Kang, S\. Khan, and X\. Ma \(2009\)Climate change impacts on crop yield, crop water productivity and food security – A review\.Progress in Natural Science19\(12\),pp\. 1665–1674\(en\)\.External Links:ISSN 10020071,[Link](https://linkinghub.elsevier.com/retrieve/pii/S1002007109002810),[Document](https://dx.doi.org/10.1016/j.pnsc.2009.08.001)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p1.1)\.
- S\. Khanal, K\. Kc, J\. P\. Fulton, S\. Shearer, and E\. Ozkan \(2020\)Remote Sensing in Agriculture—Accomplishments, Limitations, and Opportunities\.Remote Sensing12\(22\),pp\. 3783\(en\)\.External Links:ISSN 2072\-4292,[Link](https://www.mdpi.com/2072-4292/12/22/3783),[Document](https://dx.doi.org/10.3390/rs12223783)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p4.1)\.
- J\. Klein, R\. Waller, S\. Pirk, W\. Pałubicki, M\. Tester, and D\. L\. Michels \(2024\)Synthetic data at scale: a development model to efficiently leverage machine learning in agriculture\.Frontiers in Plant Science15,pp\. 1360113\.External Links:ISSN 1664\-462X,[Link](https://www.frontiersin.org/articles/10.3389/fpls.2024.1360113/full),[Document](https://dx.doi.org/10.3389/fpls.2024.1360113)Cited by:[§3\.1](https://arxiv.org/html/2607.09751#S3.SS1.p4.1)\.
- A\. Kotelnikov, D\. Baranchuk, I\. Rubachev, and A\. Babenko \(2023\)TabDDPM: modelling tabular data with diffusion models\.InProceedings of the 40th International Conference on Machine Learning,ICML’23,pp\. 17564–17579\.Cited by:[§2\.2](https://arxiv.org/html/2607.09751#S2.SS2.p5.1)\.
- Y\. Lu, L\. Chen, Y\. Zhang, M\. Shen, H\. Wang, X\. Wang, C\. v\. Rechem, T\. Fu, and W\. Wei \(2025\)Machine Learning for Synthetic Data Generation: A Review\.arXiv\.Note:arXiv:2302\.04062 \[cs\.LG\]External Links:[Link](http://arxiv.org/abs/2302.04062),[Document](https://dx.doi.org/10.48550/arXiv.2302.04062)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p5.1),[§1](https://arxiv.org/html/2607.09751#S1.p6.1),[§1](https://arxiv.org/html/2607.09751#S1.p8.1)\.
- D\. Manousakas and S\. Aydöre \(2023\)On the Usefulness of Synthetic Tabular Data Generation\.arXiv\.Note:arXiv:2306\.15636 \[cs\.LG\]External Links:[Link](http://arxiv.org/abs/2306.15636),[Document](https://dx.doi.org/10.48550/arXiv.2306.15636)Cited by:[§3\.1](https://arxiv.org/html/2607.09751#S3.SS1.p3.1),[§3\.2](https://arxiv.org/html/2607.09751#S3.SS2.p4.1)\.
- G\. Mountrakis, J\. Im, and C\. Ogole \(2011\)Support vector machines in remote sensing: A review\.ISPRS Journal of Photogrammetry and Remote Sensing66\(3\),pp\. 247–259\(en\)\.External Links:ISSN 09242716,[Link](https://linkinghub.elsevier.com/retrieve/pii/S0924271610001140),[Document](https://dx.doi.org/10.1016/j.isprsjprs.2010.11.001)Cited by:[§3\.3](https://arxiv.org/html/2607.09751#S3.SS3.p4.1)\.
- P\. Muruganantham, S\. Wibowo, S\. Grandhi, N\. H\. Samrat, and N\. Islam \(2022\)A Systematic Literature Review on Crop Yield Prediction with Deep Learning and Remote Sensing\.Remote Sensing14\(9\),pp\. 1990\(en\)\.External Links:ISSN 2072\-4292,[Link](https://www.mdpi.com/2072-4292/14/9/1990),[Document](https://dx.doi.org/10.3390/rs14091990)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p1.1)\.
- S\. J\. Pan and Q\. Yang \(2010\)A Survey on Transfer Learning\.IEEE Transactions on Knowledge and Data Engineering22\(10\),pp\. 1345–1359\.External Links:ISSN 1041\-4347,[Link](http://ieeexplore.ieee.org/document/5288526/),[Document](https://dx.doi.org/10.1109/TKDE.2009.191)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p5.1)\.
- D\. Paudel, H\. Baja, R\. van Bree, M\. Kallenberg, S\. Ofori\-Ampofo, A\. Potze, P\. Poudel, A\. Saleh, W\. Anderson, M\. von Bloh, A\. Castellano, O\. Ennaji, R\. Hamed, R\. Laudien, D\. Lee, I\. Luna, D\. Masiliūnas, M\. Meroni, J\. M\. Mutuku, S\. Mkuhlani, J\. Richetti, A\. C\. Ruane, R\. Sahajpal, G\. Shuai, V\. Sitokonstantinou, R\. de Souza Noia Junior, A\. K\. Srivastava, R\. Strong, L\. Sweet, P\. Vojnović, A\. de Wit, M\. Zachow, and I\. N\. Athanasiadis \(2024\)CY\-Bench: A comprehensive benchmark dataset for subnational crop yield forecasting\.AgML \(https://www\.agml\.org/\)\(en\)\.External Links:[Link](https://zenodo.org/doi/10.5281/zenodo.14243115),[Document](https://dx.doi.org/10.5281/ZENODO.14243115)Cited by:[§2\.3\.2](https://arxiv.org/html/2607.09751#S2.SS3.SSS2.p1.1)\.
- D\. Paudel, M\. Kallenberg, S\. Ofori\-Ampofo, H\. Baja, R\. Van Bree, A\. Potze, P\. Poudel, A\. Saleh, W\. Anderson, M\. Von Bloh, A\. Castellano, O\. Ennaji, R\. Hamed, R\. Laudien, D\. Lee, I\. Luna, M\. Meroni, J\. M\. Mutuku, S\. Mkuhlani, J\. Richetti, A\. C\. Ruane, R\. Sahajpal, G\. Shai, V\. Sitokonstantinou, R\. De Souza Nóia Júnior, A\. K\. Srivastava, R\. Strong, L\. Sweet, P\. Vojnovic, and I\. N\. Athanasiadis \(2025\)CY\-Bench: A comprehensive benchmark dataset for sub\-national crop yield forecasting\.ESSD – Land/Land Cover and Land Use\.External Links:[Link](https://essd.copernicus.org/preprints/essd-2025-83/),[Document](https://dx.doi.org/10.5194/essd-2025-83)Cited by:[§2\.3\.2](https://arxiv.org/html/2607.09751#S2.SS3.SSS2.p1.1)\.
- G\. Paulin and M\. Ivasic‐Kos \(2023\)Review and analysis of synthetic dataset generation methods and techniques for application in computer vision\.Artificial Intelligence Review56\(9\),pp\. 9221–9265\(en\)\.External Links:ISSN 0269\-2821, 1573\-7462,[Link](https://link.springer.com/10.1007/s10462-022-10358-3),[Document](https://dx.doi.org/10.1007/s10462-022-10358-3)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p6.1)\.
- V\. C\. Pezoulas, D\. I\. Zaridis, E\. Mylona, C\. Androutsos, K\. Apostolidis, N\. S\. Tachos, and D\. I\. Fotiadis \(2024\)Synthetic data generation methods in healthcare: A review on open\-source tools and methods\.Computational and Structural Biotechnology Journal23,pp\. 2892–2910\(en\)\.External Links:ISSN 2001\-0370,[Link](https://spj.science.org/doi/10.1016/j.csbj.2024.07.005),[Document](https://dx.doi.org/10.1016/j.csbj.2024.07.005)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p7.1)\.
- D\. Pflugmacher, A\. Rabe, M\. Peters, and P\. Hostert \(2019\)Mapping pan\-European land cover using Landsat spectral\-temporal metrics and the European LUCAS survey\.Remote Sensing of Environment221,pp\. 583–595\(en\)\.External Links:ISSN 00344257,[Link](https://linkinghub.elsevier.com/retrieve/pii/S0034425718305546),[Document](https://dx.doi.org/10.1016/j.rse.2018.12.001)Cited by:[§2\.3\.1](https://arxiv.org/html/2607.09751#S2.SS3.SSS1.p1.1)\.
- A\. R\. Phalke, M\. Özdoğan, P\. S\. Thenkabail, T\. Erickson, N\. Gorelick, K\. Yadav, and R\. G\. Congalton \(2020\)Mapping croplands of Europe, Middle East, Russia, and Central Asia using Landsat, Random Forest, and Google Earth Engine\.ISPRS Journal of Photogrammetry and Remote Sensing167,pp\. 104–122\(en\)\.External Links:ISSN 09242716,[Link](https://linkinghub.elsevier.com/retrieve/pii/S0924271620301805),[Document](https://dx.doi.org/10.1016/j.isprsjprs.2020.06.022)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p4.1)\.
- H\. Pham, J\. Reisner, A\. Swift, S\. Olafsson, and S\. Vardeman \(2022\)Crop phenotype prediction using biclustering to explain genotype\-by\-environment interactions\.Frontiers in Plant Science13,pp\. 975976\.External Links:ISSN 1664\-462X,[Link](https://www.frontiersin.org/articles/10.3389/fpls.2022.975976/full),[Document](https://dx.doi.org/10.3389/fpls.2022.975976)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p4.1)\.
- L\. Pierre Pott, T\. Jorge Carneiro Amado, R\. Augusto Schwalbert, G\. Mateus Corassa, and I\. Antonio Ciampitti \(2022\)Crop type classification in Southern Brazil: Integrating remote sensing, crop modeling and machine learning\.Computers and Electronics in Agriculture201,pp\. 107320\(en\)\.External Links:ISSN 01681699,[Link](https://linkinghub.elsevier.com/retrieve/pii/S0168169922006305),[Document](https://dx.doi.org/10.1016/j.compag.2022.107320)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p1.1),[§1](https://arxiv.org/html/2607.09751#S1.p4.1)\.
- Z\. Qian, R\. Davis, and M\. van der Schaar \(2023\)Synthcity: a benchmark framework for diverse use cases of tabular synthetic data\.InAdvances in Neural Information Processing Systems,A\. Oh, T\. Naumann, A\. Globerson, K\. Saenko, M\. Hardt, and S\. Levine \(Eds\.\),Vol\.36,pp\. 3173–3188\.External Links:[Link](https://proceedings.neurips.cc/paper_files/paper/2023/file/09723c9f291f6056fd1885081859c186-Paper-Datasets_and_Benchmarks.pdf)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p11.1),[§2\.2](https://arxiv.org/html/2607.09751#S2.SS2.p5.1)\.
- J\. Qu, D\. Holzmüller, G\. Varoquaux, and M\. L\. Morvan \(2025\)TabICL: A Tabular Foundation Model for In\-Context Learning on Large Data\.arXiv\.Note:Version Number: 2External Links:[Link](https://arxiv.org/abs/2502.05564),[Document](https://dx.doi.org/10.48550/ARXIV.2502.05564)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p11.1),[§2\.1\.2](https://arxiv.org/html/2607.09751#S2.SS1.SSS2.p1.1)\.
- M\. Rashid, B\. S\. Bari, Y\. Yusup, M\. A\. Kamaruddin, and N\. Khan \(2021\)A Comprehensive Review of Crop Yield Prediction Using Machine Learning Approaches With Special Emphasis on Palm Oil Yield Prediction\.IEEE Access9,pp\. 63406–63439\.External Links:ISSN 2169\-3536,[Link](https://ieeexplore.ieee.org/document/9410627/),[Document](https://dx.doi.org/10.1109/ACCESS.2021.3075159)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p2.1)\.
- S\.J\. Raudys and A\.K\. Jain \(1991\)Small sample size effects in statistical pattern recognition: recommendations for practitioners\.IEEE Transactions on Pattern Analysis and Machine Intelligence13\(3\),pp\. 252–264\.External Links:ISSN 01628828,[Link](http://ieeexplore.ieee.org/document/75512/),[Document](https://dx.doi.org/10.1109/34.75512)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p3.1)\.
- A\. Tariq, J\. Yan, A\. S\. Gagnon, M\. Riaz Khan, and F\. Mumtaz \(2023\)Mapping of cropland, cropping patterns and crop types by combining optical remote sensing images with decision tree classifier and random forest\.Geo\-spatial Information Science26\(3\),pp\. 302–320\(en\)\.External Links:ISSN 1009\-5020, 1993\-5153,[Link](https://www.tandfonline.com/doi/full/10.1080/10095020.2022.2100287),[Document](https://dx.doi.org/10.1080/10095020.2022.2100287)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p2.1)\.
- B\. Van Breugel, Z\. Qian, and M\. Van Der Schaar \(2023\)Synthetic data, real errors: how \(not\) to publish and use synthetic data\.InProceedings of the 40th International Conference on Machine Learning,ICML’23,pp\. 34793–34808\.Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p8.1)\.
- T\. Van Klompenburg, A\. Kassahun, and C\. Catal \(2020\)Crop yield prediction using machine learning: A systematic literature review\.Computers and Electronics in Agriculture177,pp\. 105709\(en\)\.External Links:ISSN 01681699,[Link](https://linkinghub.elsevier.com/retrieve/pii/S0168169920302301),[Document](https://dx.doi.org/10.1016/j.compag.2020.105709)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p1.1),[§1](https://arxiv.org/html/2607.09751#S1.p13.1)\.
- D\. R\. Velez, B\. C\. White, A\. A\. Motsinger, W\. S\. Bush, M\. D\. Ritchie, S\. M\. Williams, and J\. H\. Moore \(2007\)A balanced accuracy function for epistasis modeling in imbalanced datasets using multifactor dimensionality reduction\.Genetic Epidemiology31\(4\),pp\. 306–315\(en\)\.External Links:ISSN 0741\-0395, 1098\-2272,[Link](https://onlinelibrary.wiley.com/doi/10.1002/gepi.20211),[Document](https://dx.doi.org/10.1002/gepi.20211)Cited by:[§2\.4](https://arxiv.org/html/2607.09751#S2.SS4.p2.1)\.
- Y\. Wang, Q\. Zhang, F\. Yu, N\. Zhang, X\. Zhang, Y\. Li, M\. Wang, and J\. Zhang \(2024\)Progress in Research on Deep Learning\-Based Crop Yield Prediction\.Agronomy14\(10\),pp\. 2264\(en\)\.External Links:ISSN 2073\-4395,[Link](https://www.mdpi.com/2073-4395/14/10/2264),[Document](https://dx.doi.org/10.3390/agronomy14102264)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p13.1)\.
- M\. Weigand, J\. Staab, M\. Wurm, and H\. Taubenböck \(2020\)Spatial and semantic effects of LUCAS samples on fully automated land use/land cover classification in high\-resolution Sentinel\-2 data\.International Journal of Applied Earth Observation and Geoinformation88,pp\. 102065\(en\)\.External Links:ISSN 15698432,[Link](https://linkinghub.elsevier.com/retrieve/pii/S0303243419307317),[Document](https://dx.doi.org/10.1016/j.jag.2020.102065)Cited by:[§2\.3\.1](https://arxiv.org/html/2607.09751#S2.SS3.SSS1.p1.1)\.
- M\. Weiss, F\. Jacob, and G\. Duveiller \(2020\)Remote sensing for agricultural applications: A meta\-review\.Remote Sensing of Environment236,pp\. 111402\(en\)\.External Links:ISSN 00344257,[Link](https://linkinghub.elsevier.com/retrieve/pii/S0034425719304213),[Document](https://dx.doi.org/10.1016/j.rse.2019.111402)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p4.1)\.
- T\. Weitkamp and P\. Karimi \(2023\)Evaluating the Effect of Training Data Size and Composition on the Accuracy of Smallholder Irrigated Agriculture Mapping in Mozambique Using Remote Sensing and Machine Learning Algorithms\.Remote Sensing15\(12\),pp\. 3017\(en\)\.External Links:ISSN 2072\-4292,[Link](https://www.mdpi.com/2072-4292/15/12/3017),[Document](https://dx.doi.org/10.3390/rs15123017)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p4.1)\.
- L\. Xu, M\. Skoularidou, A\. Cuesta\-Infante, and K\. Veeramachaneni \(2019\)Modeling Tabular data using Conditional GAN\.arXiv\.Note:Version Number: 2External Links:[Link](https://arxiv.org/abs/1907.00503),[Document](https://dx.doi.org/10.48550/ARXIV.1907.00503)Cited by:[§2\.2](https://arxiv.org/html/2607.09751#S2.SS2.p5.1)\.
- S\. Xu, W\. W\. Sun, and G\. Cheng \(2025\)Utility Theory of Synthetic Data Generation\.arXiv\.Note:arXiv:2305\.10015 \[stat\.ML\]External Links:[Link](http://arxiv.org/abs/2305.10015),[Document](https://dx.doi.org/10.48550/arXiv.2305.10015)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p9.1)\.
- Y\. Yan, Y\. Zhang, J\. Chen, and Y\. Zhang \(2016\)Incomplete data classification with voting based extreme learning machine\.Neurocomputing193,pp\. 167–175\(en\)\.External Links:ISSN 09252312,[Link](https://linkinghub.elsevier.com/retrieve/pii/S0925231216001855),[Document](https://dx.doi.org/10.1016/j.neucom.2016.01.068)Cited by:[§1](https://arxiv.org/html/2607.09751#S1.p4.1)\.
- J\. Yoon, L\. N\. Drumright, and M\. Van Der Schaar \(2020\)Anonymization Through Data Synthesis Using Generative Adversarial Networks \(ADS\-GAN\)\.IEEE Journal of Biomedical and Health Informatics24\(8\),pp\. 2378–2388\.External Links:ISSN 2168\-2194, 2168\-2208,[Link](https://ieeexplore.ieee.org/document/9034117/),[Document](https://dx.doi.org/10.1109/JBHI.2020.2980262)Cited by:[§2\.2](https://arxiv.org/html/2607.09751#S2.SS2.p5.1)\.

Similar Articles

Agents That Build Better Training Data (25 minute read)

TLDR AI

Autodata introduces an agentic data scientist that iteratively generates and refines synthetic training data, with meta-optimization to further improve data quality, achieving better results on computer science and legal reasoning tasks.

@neural_avb: https://x.com/neural_avb/status/2072294078805684613

X AI KOLs Timeline

This paper introduces Autodata, a method that uses an agentic 'data scientist' AI to automate the creation of high-quality synthetic datasets through iterative generation, verification, and refinement, specifically optimized for reinforcement learning (GRPO) to improve reasoning in language models.

LLM-Guided Task-Semantic Field Factorization for Industrial Process Forecasting

arXiv cs.LG

This paper proposes Task-Semantic Field Factorization (TSF), an LLM-guided framework that uses offline semantic construction from process documents to enhance time-series forecasting and soft sensing in industrial processes. TSF reduces MAE by 6.4% on average with nearly negligible added parameters and inference overhead.