Brainstorming Generative Adversarial Networks (BGANs): Towards Multi-Agent Generative Models with Distributed Private Datasets

• URL: http://arxiv.org/abs/2002.00306v3
• Date: Mon, 25 Sep 2023 01:47:15 GMT
• Title: Brainstorming Generative Adversarial Networks (BGANs): Towards Multi-Agent Generative Models with Distributed Private Datasets
• Authors: Aidin Ferdowsi and Walid Saad
• Abstract summary: generative adversarial networks (GANs) must be fed by large datasets that adequately represent the data space. In many scenarios, the available datasets may be limited and distributed across multiple agents, each of which is seeking to learn the distribution of the data on its own. In this paper, a novel brainstorming GAN (BGAN) architecture is proposed using which multiple agents can generate real-like data samples while operating in a fully distributed manner.
• Score: 70.62568022925971
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: To achieve a high learning accuracy, generative adversarial networks (GANs) must be fed by large datasets that adequately represent the data space. However, in many scenarios, the available datasets may be limited and distributed across multiple agents, each of which is seeking to learn the distribution of the data on its own. In such scenarios, the agents often do not wish to share their local data as it can cause communication overhead for large datasets. In this paper, to address this multi-agent GAN problem, a novel brainstorming GAN (BGAN) architecture is proposed using which multiple agents can generate real-like data samples while operating in a fully distributed manner. BGAN allows the agents to gain information from other agents without sharing their real datasets but by ``brainstorming'' via the sharing of their generated data samples. In contrast to existing distributed GAN solutions, the proposed BGAN architecture is designed to be fully distributed, and it does not need any centralized controller. Moreover, BGANs are shown to be scalable and not dependent on the hyperparameters of the agents' deep neural networks (DNNs) thus enabling the agents to have different DNN architectures. Theoretically, the interactions between BGAN agents are analyzed as a game whose unique Nash equilibrium is derived. Experimental results show that BGAN can generate real-like data samples with higher quality and lower Jensen-Shannon divergence (JSD) and Fr\`echet Inception distance (FID) compared to other distributed GAN architectures.

Related papers

• AgentOhana: Design Unified Data and Training Pipeline for Effective Agent Learning [98.26836657967162]
  textbfAgentOhana aggregates agent trajectories from distinct environments, spanning a wide array of scenarios. textbfxLAM-v0.1, a large action model tailored for AI agents, demonstrates exceptional performance across various benchmarks.
  arXiv  Detail & Related papers  (2024-02-23T18:56:26Z)
• Distributed Traffic Synthesis and Classification in Edge Networks: A Federated Self-supervised Learning Approach [83.2160310392168]
  This paper proposes FS-GAN to support automatic traffic analysis and synthesis over a large number of heterogeneous datasets. FS-GAN is composed of multiple distributed Generative Adversarial Networks (GANs) FS-GAN can classify data of unknown types of service and create synthetic samples that capture the traffic distribution of the unknown types.
  arXiv  Detail & Related papers  (2023-02-01T03:23:11Z)
• MineGAN++: Mining Generative Models for Efficient Knowledge Transfer to Limited Data Domains [77.46963293257912]
  We propose a novel knowledge transfer method for generative models based on mining the knowledge that is most beneficial to a specific target domain. This is done using a miner network that identifies which part of the generative distribution of each pretrained GAN outputs samples closest to the target domain. We show that the proposed method, called MineGAN, effectively transfers knowledge to domains with few target images, outperforming existing methods.
  arXiv  Detail & Related papers  (2021-04-28T13:10:56Z)
• Multi-Source Data Fusion Outage Location in Distribution Systems via Probabilistic Graph Models [1.7205106391379026]
  We propose a multi-source data fusion approach to locate outage events in partially observable distribution systems. A novel aspect of the proposed approach is that it takes multi-source evidence and the complex structure of distribution systems into account. Our method can radically reduce the computational complexity of outage location inference in high-dimensional spaces.
  arXiv  Detail & Related papers  (2020-12-04T22:34:20Z)
• Lessons Learned from the Training of GANs on Artificial Datasets [0.0]
  Generative Adversarial Networks (GANs) have made great progress in synthesizing realistic images in recent years. GANs are prone to underfitting or overfitting, making the analysis of them difficult and constrained. We train them on artificial datasets where there are infinitely many samples and the real data distributions are simple. We find that training mixtures of GANs leads to more performance gain compared to increasing the network depth or width.
  arXiv  Detail & Related papers  (2020-07-13T14:51:02Z)
• 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)
• GANs with Conditional Independence Graphs: On Subadditivity of Probability Divergences [70.30467057209405]
  Generative Adversarial Networks (GANs) are modern methods to learn the underlying distribution of a data set. GANs are designed in a model-free fashion where no additional information about the underlying distribution is available. We propose a principled design of a model-based GAN that uses a set of simple discriminators on the neighborhoods of the Bayes-net/MRF.
  arXiv  Detail & Related papers  (2020-03-02T04:31:22Z)
• Distribution Approximation and Statistical Estimation Guarantees of Generative Adversarial Networks [82.61546580149427]
  Generative Adversarial Networks (GANs) have achieved a great success in unsupervised learning. This paper provides approximation and statistical guarantees of GANs for the estimation of data distributions with densities in a H"older space.
  arXiv  Detail & Related papers  (2020-02-10T16:47:57Z)

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.