Table of Contents
Fetching ...

Data Cleansing for GANs

Naoyuki Terashita, Hiroki Ohashi, Satoshi Hara

TL;DR

The paper tackles the problem of improving GAN performance by identifying and removing harmful training instances. It develops a Jacobian-based influence framework that captures indirect effects between the discriminator and generator, introducing two estimators, ITD and AID, to approximate the impact of removing a sample without full retraining. It then extends this approach to quantify influence on GAN evaluation metrics via ITD-EIGEM and AID-EIGEM, enabling data cleansing that improves metrics such as Inception Score, FID, and ALL across diverse GAN architectures (LQGAN, DCGAN, StyleGAN, StyleGAN2 with LoRA). The findings demonstrate that removing identified harmful instances yields consistent gains and that one-epoch retraining can be nearly as effective as full retraining for cleansing, offering practical computational advantages. Overall, the work provides a principled, scalable route to enhance generative performance by judicious data pruning grounded in cross-model influence analysis.

Abstract

As the application of generative adversarial networks (GANs) expands, it becomes increasingly critical to develop a unified approach that improves performance across various generative tasks. One effective strategy that applies to any machine learning task is identifying harmful instances, whose removal improves the performance. While previous studies have successfully estimated these harmful training instances in supervised settings, their approaches are not easily applicable to GANs. The challenge lies in two requirements of the previous approaches that do not apply to GANs. First, previous approaches require that the absence of a training instance directly affects the parameters. However, in the training for GANs, the instances do not directly affect the generator's parameters since they are only fed into the discriminator. Second, previous approaches assume that the change in loss directly quantifies the harmfulness of the instance to a model's performance, while common types of GAN losses do not always reflect the generative performance. To overcome the first challenge, we propose influence estimation methods that use the Jacobian of the generator's gradient with respect to the discriminator's parameters (and vice versa). Such a Jacobian represents the indirect effect between two models: how removing an instance from the discriminator's training changes the generator's parameters. Second, we propose an instance evaluation scheme that measures the harmfulness of each training instance based on how a GAN evaluation metric (e.g., Inception score) is expected to change by the instance's removal. Furthermore, we demonstrate that removing the identified harmful instances significantly improves the generative performance on various GAN evaluation metrics.

Data Cleansing for GANs

TL;DR

The paper tackles the problem of improving GAN performance by identifying and removing harmful training instances. It develops a Jacobian-based influence framework that captures indirect effects between the discriminator and generator, introducing two estimators, ITD and AID, to approximate the impact of removing a sample without full retraining. It then extends this approach to quantify influence on GAN evaluation metrics via ITD-EIGEM and AID-EIGEM, enabling data cleansing that improves metrics such as Inception Score, FID, and ALL across diverse GAN architectures (LQGAN, DCGAN, StyleGAN, StyleGAN2 with LoRA). The findings demonstrate that removing identified harmful instances yields consistent gains and that one-epoch retraining can be nearly as effective as full retraining for cleansing, offering practical computational advantages. Overall, the work provides a principled, scalable route to enhance generative performance by judicious data pruning grounded in cross-model influence analysis.

Abstract

As the application of generative adversarial networks (GANs) expands, it becomes increasingly critical to develop a unified approach that improves performance across various generative tasks. One effective strategy that applies to any machine learning task is identifying harmful instances, whose removal improves the performance. While previous studies have successfully estimated these harmful training instances in supervised settings, their approaches are not easily applicable to GANs. The challenge lies in two requirements of the previous approaches that do not apply to GANs. First, previous approaches require that the absence of a training instance directly affects the parameters. However, in the training for GANs, the instances do not directly affect the generator's parameters since they are only fed into the discriminator. Second, previous approaches assume that the change in loss directly quantifies the harmfulness of the instance to a model's performance, while common types of GAN losses do not always reflect the generative performance. To overcome the first challenge, we propose influence estimation methods that use the Jacobian of the generator's gradient with respect to the discriminator's parameters (and vice versa). Such a Jacobian represents the indirect effect between two models: how removing an instance from the discriminator's training changes the generator's parameters. Second, we propose an instance evaluation scheme that measures the harmfulness of each training instance based on how a GAN evaluation metric (e.g., Inception score) is expected to change by the instance's removal. Furthermore, we demonstrate that removing the identified harmful instances significantly improves the generative performance on various GAN evaluation metrics.

Paper Structure

This paper contains 69 sections, 16 theorems, 87 equations, 10 figures, 9 tables, 2 algorithms.

Key Result

Lemma 1

Suppose that ass:J_bound holds and $\eta < \frac{2\mu}{\lambda^2}$, where $\lambda \coloneqq \max_{{\boldsymbol{\theta}}\in\mathcal{B}({\boldsymbol{\theta}}^{*})} \left\Vert{\boldsymbol{J}}\left({{\boldsymbol{\theta}}}\right)\right\Vert$, then $\sigma_{\mathcal{B}} \coloneqq \max_{{\boldsymbol{\th

Figures (10)

  • Figure 1: The average Kendall's Tau calculated from the true and estimated influence values on ALL for LQGAN \ref{['sub:toy_valid']} and IS for DCGAN \ref{['sub:mnist_valid_is']} of 100 instances. The error bars show the 10% and 90% percentiles of Kendall's Tau obtained from iterative experiments. To enhance visibility, we excluded the error bars of AID (M=1,10,100,1000).
  • Figure 2: The average test GAN evaluation metrics after the data cleansing. A higher value in \ref{['sub:clean_ll']}-\ref{['sub:clean_is_1epoch']} and a lower value in other plots \ref{['sub:clean_fid']}-\ref{['sub:clean_stylegan_1epoch']} indicate better generative performance, respectively. We left out error bars and extreme values for clarity.
  • Figure 3: Influence on ALL representing harmfulness of 1D-Normal training instances \ref{['sub:visual_gauss_harmful']} and generator's distributions before and after the data cleansing \ref{['sub:visual_gauss_cleansed']}. \ref{['sub:visual_gauss_harmful']} presents the histogram of the training instances, with each segment colored according to the average influence on ALL calculated over the instances within the belonging bin. \ref{['sub:visual_gauss_cleansed']} shows the kernel density estimates of the true distribution ("True") and generator's distributions before ("No removal") and after ("Cleansed") the data cleansing.
  • Figure 4: Label-wise total influence on FID of estimated harmful instances \ref{['sub:harmful_label']} and generated instances before \ref{['sub:visual_mnist_no_removal']} and after \ref{['sub:visual_mnist_cleansed']} the data cleansing. Both \ref{['sub:visual_mnist_no_removal']} and \ref{['sub:visual_mnist_cleansed']} use the same series of test latent variables. As seen in \ref{['sub:harmful_label']}, instances labeled as digits 1 and 7 were suggested to be the most harmful. \ref{['sub:visual_mnist_no_removal']} and \ref{['sub:visual_mnist_cleansed']} indicate that their exclusion increased the diversity of generated instances by assigning latent variables that had been associated with the digits 1 (blue solid line) and 7 (orange dotted line) to other digits.
  • Figure 5: Top-27 harmful \ref{['sub:harmful_stylegan']} and helpful training \ref{['sub:helpful_stylegan']} instances suggested by our ITD-EIGEM performed over entire training steps, and randomly selected instances from the dataset \ref{['sub:random_stylegan']}.
  • ...and 5 more figures

Theorems & Definitions (28)

  • Definition 1
  • Lemma 1
  • Theorem 1
  • Corollary 1
  • Lemma 2
  • Corollary 2
  • Theorem 2
  • Definition 2
  • Lemma 2
  • proof
  • ...and 18 more