Skip to content

ScoreMix: Synthetic Data Generation by Score Composition in Diffusion Models Improves Recognition

Jun 2025 · 0 citations · 46 references
Computer Science

TL;DR

This paper proposes ScoreMix, a self-contained synthetic generation method to produce hard synthetic samples for recognition tasks by leveraging the score compositionality of diffusion models, and finds that mixing classes distant in the discriminator's embedding space yields larger gains, compared to selection based on proximity.

Abstract

Synthetic data generation is increasingly used in machine learning for training and data augmentation. Yet, current strategies often rely on external foundation models or datasets, whose usage is restricted in many scenarios due to policy or legal constraints. We propose ScoreMix, a self-contained synthetic generation method to produce hard synthetic samples for recognition tasks by leveraging the score compositionality of diffusion models. The approach mixes class-conditioned scores along reverse diffusion trajectories, yielding domain-specific data augmentation without external resources. We systematically study class-selection strategies and find that mixing classes distant in the discriminator's embedding space yields larger gains, providing up to 3% additional average improvement, compared to selection based on proximity. Interestingly, we observe that condition and embedding spaces are largely uncorrelated under standard alignment metrics, and the generator's condition space has a negligible effect on downstream performance. Across 8 public face recognition benchmarks, ScoreMix improves accuracy by up to 7 percentage points, without hyperparameter search, highlighting both robustness and practicality. Our method provides a simple yet effective way to maximize discriminator performance using only the available dataset, without reliance on third-party resources. Paper website: https://parsa-ra.github.io/scoremix/.

View source

Similar papers

#artificial intelligence Preprint Oct 2026

Rethinking Data Augmentation under Covariate Shift: Invariant-Guided Diffusion and Prototype Reweighting

In many industrial applications, 1) tabular data is scarce and imbalanced and thus requires synthetic expansion; 2) input distributions drift between training and deployment (covariate shift); 3) validation sets often diverge from unseen test environments; or 4) standard generative models simply mimic outdated source d...

Hong-Yu Cao, Xin-Yuan Wang, Arun Vignesh Malarkkan et al. · 1 citation
#artificial intelligence Preprint Sep 2026

Distilling Diffusion Score Discrepancy for Efficient Training Data Attribution

Training data attribution for diffusion models aims to identify the training samples that influence a generated instance, but existing methods either require costly per-sample gradient computation or query-specific model optimization. Moreover, most methods attribute changes in a proxy loss rather than changes in the a...

Shi-Xuan Liu, Joan Serrà, Kin-Wai Cheuk et al. · 0 citations
#machine learning Preprint Sep 2026

Data Unlearning via Inverse Distillation

Multi-step matching models, including flow and diffusion models, produce high-quality outputs but incur substantial inference costs and may reproduce unwanted components of their training datasets. We introduce Inverse Distillation Unlearning (IDU), a unified framework that simultaneously distills a teacher multi-step...

Aleksei Leonov, N. Kornilov, Zhen-He Zhang et al. · 0 citations
#machine learning Preprint Sep 2026

Visualizing Distribution Coverage in Generative Diffusion Models

Diffusion distillation is widely adopted to accelerate sampling, and the resulting few-step models are broadly believed to match or even surpass their multi-step teachers in generation. However, standard evaluations such as GenEval2 typically draw only one sample per prompt, so improved scores may fail to reveal losses...

Yi-Fei Wang, Xiao-Yu Wu, Tsu-Jui Fu et al. · 0 citations
Preprint Aug 2026

Revisiting Classifier-Free Guidance Methods in Latent Diffusion Models

This study studies a family of training-free techniques conceptually rooted in Classifier-Free Guidance, most of which were originally proposed on older U-Net diffusion models and validated using metrics that assess image quality in isolation, without accounting for compositional alignment or semantic correspondence.

A. Sergievskii, Artyom Turevich, Sergey Kastryulin · 0 citations
#artificial intelligence Preprint Sep 2026

SwiftExplorer: Training-free Diffusion Model Alignment with Swift Diversity Exploration

SwiftExplorer is proposed, a plugin that mitigates distribution collapse caused by excessive diversity loss and reduces compute costs, and adopts an Inheritance-Restart exploration mechanism to avoid early convergence, while exploration also increases the likelihood of high-reward trajectories.

Ren-Ye Yan, Ji-Kang Cheng, You Wu et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

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