Skip to content
AI.info

Research

UtilGen: Utility-Centric Generative Data Augmentation with Dual-Level Task Adaptation

UtilGen: Utility-Centric Generative Data Augmentation with Dual-Level Task Adaptation Overview Research area: Computer vision / generative data augmentation, with connections to diffusion models, trai

arXiv
2510.24262
Published
2025-10-28
Authors
Jiyu Guo, Shuo Yang, Yiming Huang, Yancheng Long, Xiaobo Xia, Xiu Su, Bo Zhao, Zeke Xie, Liqiang Nie

AI summary

UtilGen: Utility-Centric Generative Data Augmentation with Dual-Level Task Adaptation

Overview

  • Research area: Computer vision / generative data augmentation, with connections to diffusion models, training-data valuation, and preference-based fine-tuning.
  • Technical level: Advanced. The method combines bi-level (meta-learning) optimization, Diffusion DPO, textual inversion, and DDIM inversion with classifier-free guidance.
  • Scope (one sentence): The paper proposes and empirically evaluates UtilGen, a framework that adapts a text-to-image diffusion generator to produce synthetic training images optimized for the measured utility of a specific downstream task, rather than for visual fidelity or diversity alone.

What This Paper Is About

Most generative data augmentation methods judge their synthetic images by intrinsic visual properties such as fidelity and diversity, implicitly assuming that better-looking, more varied images must be better training data. The authors argue that different tasks and network architectures need different training data, so a generator should be steered by feedback from the downstream task instead. UtilGen operationalizes this by scoring each synthetic sample's usefulness to a target classifier and then using those scores to refine both the generator itself and the per-sample generation policy.

Key Contributions

  1. A utility-centric paradigm for generative augmentation. The paper reframes augmentation around task-specific utility of synthetic data rather than intrinsic visual attributes, so the generation process is adapted to the needs of a given downstream task and architecture.

  2. Task-Oriented Data Valuation (TODV). A meta-learned weight allocation network (an MLP with a single hidden layer) predicts normalized utility weights in [0, 1] for samples, trained through bi-level optimization that alternates between classifier training on a weighted loss and weight-network training on a validation set. This provides an efficient utility predictor without full retraining-and-testing cycles.

  3. A dual-level optimization strategy. Model-Level Generation Capability Optimization (MLCO) tailors the diffusion U-Net to the downstream task via iterative Direct Preference Optimization using preference pairs of high-utility versus low-utility generated samples; Instance-Level Generation Policy Optimization (ILPO) then refines prompt embeddings and initial noise, with a CLIP-based regularization term to preserve semantic alignment.

  4. Empirical validation across eight benchmarks. The paper reports an average accuracy gain of 3.87% over the previous state of the art in the synthetic-only setting, and claims to be the first generative augmentation method where a ResNet-50 trained solely on 3× synthetic data surpasses its real-data-trained counterpart on several benchmarks.

Main Findings

  • Synthetic-only performance: With ResNet-50 trained only on synthetic data, UtilGen reaches an average accuracy of 37.17%, versus 33.30% for the previous best method, DataDream — a reported gain of +3.87%. Individual results include 40.94% on IN-100-S, 43.32% on CUB, 33.72% on IN-1k-S, 29.31% on Cal101, 13.52% on DTD, 37.25% on PETs, 31.87% on Food-S, and 67.43% on Flowers.

  • Joint training performance: When synthetic data is combined with the full real dataset, UtilGen averages 62.04% versus 58.67% for DataDream. The text describes this as a +3.54% margin, while the table's "over previous SOTA" row lists +3.37; results include 93.62% on Flowers, 75.62% on Cal101, 64.64% on PETs, 61.54% on IN-100-S, and 57.53% on CUB.

  • Scaling behavior: On ImageNet-100 with ResNet-50, accuracy rises with synthetic budget for every method tested: UtilGen scores 18.04 at 1×, 28.52 at 3×, and 40.94 at 5×, compared with 17.12 / 25.26 / 35.48 for DataDream, 15.02 / 21.16 / 30.94 for GAP, 13.44 / 21.90 / 31.94 for GIF, and 12.18 / 20.20 / 27.96 for SD v2.1. The gap over baselines widens as the synthesis ratio grows. Scaling synthetic data from 1× to 5× improves ResNet-50 performance in both synthetic-only and joint settings; at 3× synthetic data alone, models beat their real-data-trained counterparts on three datasets, and at 5× on four datasets.

  • Diversity: Measured as mean intra-class cosine distance of CLIP (ViT-L/14) features on ImageNet-100, UtilGen achieves 0.6054, higher than Stable Diffusion v2.1 (0.5815) and DataDream (0.5238), suggesting utility-guided optimization does not collapse sample variety.

  • Reusability across models: Even when the weight network is trained with ResNet-50, the generated data transfers: on WideResNet, UtilGen reaches 36.40% versus DataDream's 31.76%; on CLIP, 72.14% versus 71.42%.

  • Architecture generalization: On ImageNet-100 with 500 images generated per class, UtilGen leads on ResNeXt-50 (37.62), WideResNet-50 (37.82), and MobileNetV2 (40.59), compared with 31.24 / 31.76 / 35.48 for DataDream, 27.66 / 27.76 / 32.72 for GAP, and 27.54 / 27.84 / 31.24 for GIF.

  • Cost-benefit: The paper contrasts manual annotation of 10,000 images (about two weeks, roughly $800, 38.58% accuracy on the real-data baseline) against UtilGen generation: 10,000 images in about 0.94 hours for about $20 on 8 V100 GPUs from Google Cloud (18.04% accuracy at 1×), and 50,000 images in about 4.70 hours for about $100 (40.94% accuracy at 5×).

  • Ablation: On ImageNet-100 with ResNet-50 trained solely on synthetic data (500 images per class), the baseline is 27.96%. MLCO alone gives 28.68%, prompt optimization alone 36.42%, and noise optimization alone 37.96%. Pairing MLCO with prompt optimization gives 32.08%, MLCO with noise optimization 39.12%, and prompt plus noise optimization 39.73%. All three combined yields 40.94%, which the authors describe as surpassing the baseline by +12.98%.

  • Effect of the weight network: Comparing training with and without dynamic weighting (original Flowers plus SD v2.1 augmented data at 1× expansion, ResNet-50), the weighted model converges faster with higher early-epoch training accuracy, and test accuracy improves by 2.94% over the baseline. The authors attribute this to down-weighting low-utility or noisy samples.

  • Data influence: Using Influence Functions, UtilGen produces a higher proportion of positively influential samples (influence > 0) across all eight benchmarks; its influence-score distribution shifts to the right, and it dominates in high-influence density regions while SD v2.1 contributes more to low-influence areas.

  • Qualitative evidence: Feature-space visualization on the Flower dataset shows UtilGen's synthetic data aligning more closely with the real data distribution than vanilla Stable Diffusion, alongside higher utility-aware weight scores for synthetic samples.

Methodology in Plain English

The pipeline runs in three connected stages.

First, the system learns what "useful" means for the task. A small classifier is trained on a mix of real images and synthetic images produced from prompts built with learned class identifiers (obtained by textual inversion from a few real images per class, with prompts of the form "a photo of [I_i]"). In parallel, a small weight network looks at each sample's loss and predicts a weight in [0, 1] representing that sample's value to the downstream task. The two are trained in alternation: the classifier minimizes a loss weighted by those scores, then the weight network is updated to minimize the classifier's loss on a held-out validation set. The result is a fast utility scorer that can judge newly generated images without retraining the classifier every time.

Second, the generator is tuned toward the task. Each round, the diffusion model generates a batch of images, and the trained weight network scores them. High-scoring and low-scoring images for the same class are paired into a preference dataset, and the model's U-Net is fine-tuned with Diffusion DPO so that it becomes more likely to produce the kind of image the highest-utility samples represent. The optimization objective uses a sigmoid of a scaled difference between the trainable and reference U-Nets' noise-prediction errors on the preferred and dispreferred samples.

Third, each generation is tuned at the sample level. For a given class, the prompt embedding is optimized by gradient ascent to raise the predicted utility score, with a CLIP cosine-similarity term preventing the prompt from drifting away from the class's real-image semantics. The initial noise vector is also adjusted: rather than optimizing noise directly (too expensive per image), the method exploits the difference between denoising and DDIM-inversion classifier-free guidance scales, using a stronger denoising scale than inversion scale to implicitly inject high-utility semantics into the starting noise.

Why This Matters

Impact on research. The paper challenges a default assumption in generative augmentation — that fidelity and diversity are adequate proxies for usefulness. Because the utility signal comes from the target model itself, the framework supplies a general recipe for closing the loop between data generation and model training, and it reports that synthetic data can substitute for, not merely supplement, real data in some settings.

Potential real-world applications. (These are plausible extensions of the reported paradigm; the paper itself evaluates only image classification benchmarks.)

  • Expanding small labeled image datasets in domains where annotation is expensive or requires experts.
  • Building task-specialized training sets for edge or embedded vision models, where the reported architecture tests include MobileNetV2.
  • Augmenting rare classes or under-represented visual categories with data tuned to the deployed classifier.
  • Producing task-matched synthetic data for fine-grained recognition (pets, birds, flowers, food) where class distinctions are subtle.

Industry relevance. The cost comparison is the clearest industrial argument: generating 50,000 images took roughly 4.70 hours and about $100 on 8 rented V100 GPUs and yielded 40.94% accuracy on ImageNet-100-Subset, versus roughly two weeks and $800 for annotating 10,000 images. For teams training perception models, this reframes synthetic data as a cheaper alternative to annotation pipelines — with the caveat that the utility scores are tied to a specific classifier, unless the reusability results (WideResNet, CLIP) hold more broadly.

Future Directions

  • Broadening beyond image classification. All eight benchmarks are classification tasks; whether utility-centric generation transfers to detection, segmentation, or other structured outputs is not reported.
  • Generalizing utility beyond the source classifier. The reusability results (WideResNet, CLIP) suggest partial transfer, but the paper does not establish how utility assessments behave for architectures or objectives far from the one used to train the weight network.
  • Dealing with limitations the paper defers. The authors state that limitations are discussed in Appendix C, which is not included in the provided content; identifying and testing those constraints remains an open question.
  • Reducing the dependency on real reference data and validation sets. The pipeline relies on few-shot real images for textual inversion and on a validation set to train the weight network, so its behavior when neither is available or when the validation set is small is an open issue.

Target Audience

This paper is most useful to researchers and practitioners working on generative data augmentation, diffusion-model fine-tuning, and data-centric machine learning, especially those who already understand diffusion sampling, preference optimization, and meta-learning. Engineers building synthetic-data pipelines for visual recognition will find the cost-benefit and scalability results directly actionable, while readers new to diffusion models or bi-level optimization should expect a substantial prerequisite burden.

Authors’ abstract

Data augmentation using generative models has emerged as a powerful paradigm for enhancing performance in computer vision tasks. However, most existing augmentation approaches primarily focus on optimizing intrinsic data attributes -- such as fidelity and diversity -- to generate visually high-quality synthetic data, while often neglecting task-specific requirements. Yet, it is essential for data generators to account for the needs of downstream tasks, as training data requirements can vary significantly across different tasks and network architectures. To address these limitations, we propose UtilGen, a novel utility-centric data augmentation framework that adaptively optimizes the data generation process to produce task-specific, high-utility training data via downstream task feedback. Specifically, we first introduce a weight allocation network to evaluate the task-specific utility of each synthetic sample. Guided by these evaluations, UtilGen iteratively refines the data generation process using a dual-level optimization strategy to maximize the synthetic data utility: (1) model-level optimization tailors the generative model to the downstream task, and (2) instance-level optimization adjusts generation policies -- such as prompt embeddings and initial noise -- at each generation round. Extensive experiments on eight benchmark datasets of varying complexity and granularity demonstrate that UtilGen consistently achieves superior performance, with an average accuracy improvement of 3.87% over previous SOTA. Further analysis of data influence and distribution reveals that UtilGen produces more impactful and task-relevant synthetic data, validating the effectiveness of the paradigm shift from visual characteristics-centric to task utility-centric data augmentation.

Read the original paper