The exact minimizer of the empirical score-matching loss makes reverse diffusion trajectories converge to training samples, and certain regularizers prevent that collapse.
Reducing Training Sample Memorization in GANs by Training with Memorization Rejection
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Generative adversarial network (GAN) continues to be a popular research direction due to its high generation quality. It is observed that many state-of-the-art GANs generate samples that are more similar to the training set than a holdout testing set from the same distribution, hinting some training samples are implicitly memorized in these models. This memorization behavior is unfavorable in many applications that demand the generated samples to be sufficiently distinct from known samples. Nevertheless, it is unclear whether it is possible to reduce memorization without compromising the generation quality. In this paper, we propose memorization rejection, a training scheme that rejects generated samples that are near-duplicates of training samples during training. Our scheme is simple, generic and can be directly applied to any GAN architecture. Experiments on multiple datasets and GAN models validate that memorization rejection effectively reduces training sample memorization, and in many cases does not sacrifice the generation quality. Code to reproduce the experiment results can be found at $\texttt{https://github.com/jybai/MRGAN}$.
citation-role summary
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Memorization and Regularization in Generative Diffusion Models
The exact minimizer of the empirical score-matching loss makes reverse diffusion trajectories converge to training samples, and certain regularizers prevent that collapse.