MIM-Based GAN: Information Metric to Amplify Small Probability Events Importance in Generative Adversarial Networks

• URL: http://arxiv.org/abs/2003.11285v2
• Date: Thu, 7 Jan 2021 12:33:51 GMT
• Title: MIM-Based GAN: Information Metric to Amplify Small Probability Events Importance in Generative Adversarial Networks
• Authors: Rui She and Pingyi Fan
• Abstract summary: In terms of Generative Adversarial Networks (GANs), the information metric to discriminate the generative data from the real data lies in the key point of generation efficiency. In this paper, we adopt the exponential form, referred from the information measure, i.e. MIM, to replace the logarithm form of the original GAN. This approach is called MIM-based GAN, has better performance on networks training and rare events generation.
• Score: 13.599726672717827
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In terms of Generative Adversarial Networks (GANs), the information metric to discriminate the generative data from the real data, lies in the key point of generation efficiency, which plays an important role in GAN-based applications, especially in anomaly detection. As for the original GAN, there exist drawbacks for its hidden information measure based on KL divergence on rare events generation and training performance for adversarial networks. Therefore, it is significant to investigate the metrics used in GANs to improve the generation ability as well as bring gains in the training process. In this paper, we adopt the exponential form, referred from the information measure, i.e. MIM, to replace the logarithm form of the original GAN. This approach is called MIM-based GAN, has better performance on networks training and rare events generation. Specifically, we first discuss the characteristics of training process in this approach. Moreover, we also analyze its advantages on generating rare events in theory. In addition, we do simulations on the datasets of MNIST and ODDS to see that the MIM-based GAN achieves state-of-the-art performance on anomaly detection compared with some classical GANs.

Related papers

• Bt-GAN: Generating Fair Synthetic Healthdata via Bias-transforming Generative Adversarial Networks [3.3903891679981593]
  We present Bias-transforming Generative Adversarial Networks (Bt-GAN), a GAN-based synthetic data generator specifically designed for the healthcare domain. Our results demonstrate that Bt-GAN achieves SOTA accuracy while significantly improving fairness and minimizing bias.
  arXiv  Detail & Related papers  (2024-04-21T12:16:38Z)
• Enhancing Network Intrusion Detection Performance using Generative Adversarial Networks [0.25163931116642785]
  We propose a novel approach for enhancing the performance of an NIDS through the integration of Generative Adversarial Networks (GANs) GANs generate synthetic network traffic data that closely mimics real-world network behavior. Our findings show that the integration of GANs into NIDS can lead to enhancements in intrusion detection performance for attacks with limited training data.
  arXiv  Detail & Related papers  (2024-04-11T04:01:15Z)
• Assessing Neural Network Representations During Training Using Noise-Resilient Diffusion Spectral Entropy [55.014926694758195]
  Entropy and mutual information in neural networks provide rich information on the learning process. We leverage data geometry to access the underlying manifold and reliably compute these information-theoretic measures. We show that they form noise-resistant measures of intrinsic dimensionality and relationship strength in high-dimensional simulated data.
  arXiv  Detail & Related papers  (2023-12-04T01:32:42Z)
• SMaRt: Improving GANs with Score Matching Regularity [94.81046452865583]
  Generative adversarial networks (GANs) usually struggle in learning from highly diverse data, whose underlying manifold is complex. We show that score matching serves as a promising solution to this issue thanks to its capability of persistently pushing the generated data points towards the real data manifold. We propose to improve the optimization of GANs with score matching regularity (SMaRt)
  arXiv  Detail & Related papers  (2023-11-30T03:05:14Z)
• Self-Supervised Neuron Segmentation with Multi-Agent Reinforcement Learning [53.00683059396803]
  Mask image model (MIM) has been widely used due to its simplicity and effectiveness in recovering original information from masked images. We propose a decision-based MIM that utilizes reinforcement learning (RL) to automatically search for optimal image masking ratio and masking strategy. Our approach has a significant advantage over alternative self-supervised methods on the task of neuron segmentation.
  arXiv  Detail & Related papers  (2023-10-06T10:40:46Z)
• Generative adversarial networks for data-scarce spectral applications [0.0]
  We report on an application of GANs in the domain of synthetic spectral data generation. We show that CWGANs can act as a surrogate model with improved performance in the low-data regime.
  arXiv  Detail & Related papers  (2023-07-14T16:27:24Z)
• From MIM-Based GAN to Anomaly Detection:Event Probability Influence on Generative Adversarial Networks [13.599726672717827]
  In this paper, we introduce the exponential information metric into the GAN, referred to as MIM-based GAN. We propose an anomaly detection method with MIM-based GAN, as well as explain its principle for the unsupervised learning case.
  arXiv  Detail & Related papers  (2022-03-25T06:08:03Z)
• Self-Ensembling GAN for Cross-Domain Semantic Segmentation [107.27377745720243]
  This paper proposes a self-ensembling generative adversarial network (SE-GAN) exploiting cross-domain data for semantic segmentation. In SE-GAN, a teacher network and a student network constitute a self-ensembling model for generating semantic segmentation maps, which together with a discriminator, forms a GAN. Despite its simplicity, we find SE-GAN can significantly boost the performance of adversarial training and enhance the stability of the model.
  arXiv  Detail & Related papers  (2021-12-15T09:50:25Z)
• Convolutional generative adversarial imputation networks for spatio-temporal missing data in storm surge simulations [86.5302150777089]
  Generative Adversarial Imputation Nets (GANs) and GAN-based techniques have attracted attention as unsupervised machine learning methods. We name our proposed method as Con Conval Generative Adversarial Imputation Nets (Conv-GAIN)
  arXiv  Detail & Related papers  (2021-11-03T03:50:48Z)
• Regularizing Generative Adversarial Networks under Limited Data [88.57330330305535]
  This work proposes a regularization approach for training robust GAN models on limited data. We show a connection between the regularized loss and an f-divergence called LeCam-divergence, which we find is more robust under limited training data.
  arXiv  Detail & Related papers  (2021-04-07T17:59:06Z)
• Generative Adversarial Networks (GANs): An Overview of Theoretical Model, Evaluation Metrics, and Recent Developments [9.023847175654602]
  Generative Adversarial Network (GAN) is an effective method to produce samples of large-scale data distribution. GANs provide an appropriate way to learn deep representations without widespread use of labeled training data. In GANs, the generative model is estimated via a competitive process where the generator and discriminator networks are trained simultaneously.
  arXiv  Detail & Related papers  (2020-05-27T05:56:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.