UtilGen: Utility-Centric Generative Data Augmentation with Dual-Level Task Adaptation
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 59 of its 79 references that are in the map. First posted on arXiv 28 Oct 2025.
Builds on
59 of 79 references.
References · 59
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020Denoising Diffusion Probabilistic Modelscited by 20,851
- 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,694
- 2020Denoising Diffusion Implicit Modelscited by 9,655
- 2021Diffusion Models Beat GANs on Image Synthesiscited by 8,185
- 2022Classifier-Free Diffusion Guidancecited by 5,717
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
- 2021GLIDE: Towards Photorealistic Image Generation and Editing with Text-Guided Diffusion Modelscited by 3,595
- 2016Wide Residual Networkscited by 3,057
- 2016Aggregated Residual Transformations for Deep Neural Networkscited by 2,540
- 2022An Image is Worth One Word: Personalizing Text-to-Image Generation using Textual Inversioncited by 2,231
- 2013Describing Textures in the Wildcited by 2,110
38 more
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
- 2017Improved Regularization of Convolutional Neural Networks with Cutoutcited by 1,623
- 2017Random Erasing Data Augmentationcited by 1,235
- 2021Variational Diffusion Modelscited by 1,145
- 2019AugMix: A Simple Data Processing Method to Improve Robustness and Uncertaintycited by 897
- 2023Diffusion Model Alignment Using Direct Preference Optimizationcited by 767
- 2019Data Shapley: Equitable Valuation of Data for Machine Learningcited by 617
- 2020Estimating Training Data Influence by Tracing Gradient Descentcited by 565
- 2020Dataset Condensation with Gradient Matchingcited by 510
- 2021Dataset Condensation with Distribution Matchingcited by 362
- 2022Is synthetic data from generative models ready for image recognition?cited by 320
- 2023Data-centric Artificial Intelligence: A Surveycited by 202
- 2020How Does Mixup Help With Robustness and Generalization?cited by 193
- 2018Representer Point Selection for Explaining Deep Neural Networkscited by 187
- 2021Free Lunch for Few-shot Learning: Distribution Calibrationcited by 165
- 2018Synthetic Data Augmentation using GAN for Improved Liver Lesion Classificationcited by 136
- 2022Training Data Influence Analysis and Estimation: A Surveycited by 134
- 2022Dataset Pruning: Reducing Training Data by Examining Generalization Influencecited by 132
- 2023Diversify Your Vision Datasets with Automatic Diffusion-Based Augmentationcited by 100
- 2020Characterizing Structural Regularities of Labeled Data in Overparameterized Modelscited by 93
- 2024Golden Noise for Diffusion Models: A Learning Frameworkcited by 91
- 2021Learning Fast Sample Re-weighting Without Reward Datacited by 69
- 2022Expanding Small-Scale Datasets with Guided Imaginationcited by 61
- 2022From Shapley Values to Generalized Additive Models and backcited by 59
- 2024A Noise is Worth Diffusion Guidancecited by 48
- 2022Harnessing Out-Of-Distribution Examples via Augmenting Content and Stylecited by 43
- 2024Few-Shot Adversarial Prompt Learning on Vision-Language Modelscited by 39
- 2020Efficient computation and analysis of distributional Shapley valuescited by 38
- 2021HYDRA: Hypergradient Data Relevance Analysis for Interpreting Deep Neural Networkscited by 38
- 2024Zigzag Diffusion Sampling: Diffusion Models Can Self-Improve via Self-Reflectioncited by 38
- 2023Data Valuation Without Training of a Modelcited by 35
- 2023Real-Fake: Effective Training Data Synthesis Through Distribution Matchingcited by 35
- 2024DEEM: Diffusion Models Serve as the Eyes of Large Language Models for Image Perceptioncited by 32
- 2021Estimating Instance-dependent Bayes-label Transition Matrix using a Deep Neural Networkcited by 30
- 2024DataDream: Few-shot Guided Dataset Generationcited by 28
- 2023BiCro: Noisy Correspondence Rectification for Multi-modality Data via Bi-directional Cross-modal Similarity Consistencycited by 27
- 2015Do We Need More Training Data?cited by 26
- 2021Rethinking Influence Functions of Neural Networks in the Over-parameterized Regimecited by 26
50 most cited of 59 All 59 (JSON)
Built on by
Citing papers per year: 2026: 2.
2 papers.