CDE-GAN: Cooperative Dual Evolution Based Generative Adversarial Network

• URL: http://arxiv.org/abs/2008.09388v2
• Date: Tue, 23 Mar 2021 13:06:29 GMT
• Title: CDE-GAN: Cooperative Dual Evolution Based Generative Adversarial Network
• Abstract summary: Generative adversarial networks (GANs) have been a popular deep generative model for real-world applications. We propose a Cooperative Dual Evolution based Generative Adversarial Network (CDE-GAN) to circumvent these drawbacks. In essence, CDE-GAN incorporates dual evolution with respect to the generator(s) and discriminators into a unified adversarial framework.
• Score: 32.91091802159556
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Generative adversarial networks (GANs) have been a popular deep generative model for real-world applications. Despite many recent efforts on GANs that have been contributed, mode collapse and instability of GANs are still open problems caused by their adversarial optimization difficulties. In this paper, motivated by the cooperative co-evolutionary algorithm, we propose a Cooperative Dual Evolution based Generative Adversarial Network (CDE-GAN) to circumvent these drawbacks. In essence, CDE-GAN incorporates dual evolution with respect to the generator(s) and discriminators into a unified evolutionary adversarial framework to conduct effective adversarial multi-objective optimization. Thus it exploits the complementary properties and injects dual mutation diversity into training to steadily diversify the estimated density in capturing multi-modes and improve generative performance. Specifically, CDE-GAN decomposes the complex adversarial optimization problem into two subproblems (generation and discrimination), and each subproblem is solved with a separated subpopulation (E-Generator} and E-Discriminators), evolved by its own evolutionary algorithm. Additionally, we further propose a Soft Mechanism to balance the trade-off between E-Generators and E-Discriminators to conduct steady training for CDE-GAN. Extensive experiments on one synthetic dataset and three real-world benchmark image datasets demonstrate that the proposed CDE-GAN achieves a competitive and superior performance in generating good quality and diverse samples over baselines. The code and more generated results are available at our project homepage: https://shiming-chen.github.io/CDE-GAN-website/CDE-GAN.html.

Related papers

• Beyond the Dirac Delta: Mitigating Diversity Collapse in Reinforcement Fine-Tuning for Versatile Image Generation [51.305316234962554]
  We propose textbfDRIFT (textbfDivetextbfRsity-textbfIncentivized Reinforcement textbfFine-textbfTuning for Versatile Image Generation), an innovative framework that systematically incentivizes output throughout the on-policy fine-tuning process.<n>DRIFT achieves superior dominance regarding task alignment and generation diversity, yielding a $ 9.08%!sim! 43.46%$ increase in diversity equivalent alignment levels and a $ 59.65
  arXiv  Detail & Related papers  (2026-01-18T13:25:43Z)
• Efficient Generative Transformer Operators For Million-Point PDEs [12.324265832276538]
  ECHO is a transformer-operator framework for generating million-point PDE trajectories.<n>We demonstrate state-of-the-art performance on million-point simulations featuring complex, high-frequency dynamics, and long-term horizons.
  arXiv  Detail & Related papers  (2025-12-04T16:46:48Z)
• Unrolled Graph Neural Networks for Constrained Optimization [83.29547301151177]
  We study the dynamics of the dual ascent algorithm in two coupled graph neural networks (GNNs)<n>We propose a joint training scheme that alternates between updating the primal and dual networks.<n>Our numerical experiments demonstrate that our approach yields near-optimal near-feasible solutions.
  arXiv  Detail & Related papers  (2025-09-21T16:55:41Z)
• Deep Reinforcement Learning-Assisted Component Auto-Configuration of Differential Evolution Algorithm for Constrained Optimization: A Foundation Model [12.957830806430733]
  We introduce a novel framework for automated component configuration in Differential Evolution (DE) algorithm to address constrained optimization problems (COPs)<n>SuperDE is capable of recommending optimal per-generation configurations for unseen problems in a zero-shot manner.<n> Experimental results demonstrate that SuperDE significantly outperforms existing state-of-the-art algorithms on benchmark test suites.
  arXiv  Detail & Related papers  (2025-09-14T00:14:40Z)
• Multi-population GAN Training: Analyzing Co-Evolutionary Algorithms [0.3683202928838613]
  Generative adversarial networks (GANs) are powerful generative models but remain challenging to train due to pathologies such as mode collapse and instability.<n>Recent research has explored co-evolutionary approaches, in which populations of generators and discriminators are evolved.<n>This paper presents an empirical analysis of different coevolutionary GAN training strategies, focusing on the impact of selection and replacement mechanisms.
  arXiv  Detail & Related papers  (2025-07-17T14:19:17Z)
• On the Convergence of (Stochastic) Gradient Descent for Kolmogorov--Arnold Networks [56.78271181959529]
  Kolmogorov--Arnold Networks (KANs) have gained significant attention in the deep learning community. Empirical investigations demonstrate that KANs optimized via gradient descent (SGD) are capable of achieving near-zero training loss.
  arXiv  Detail & Related papers  (2024-10-10T15:34:10Z)
• Introducing Competitive Mechanism to Differential Evolution for Numerical Optimization [6.464980828114218]
  This paper introduces a novel competitive mechanism into differential evolution (DE) It features a mutation strategy: DE/winner-to-best/1. The incorporation of DE/winner-to-best/1 and the competitive mechanism provide new avenues for advancing DE techniques.
  arXiv  Detail & Related papers  (2024-06-08T10:48:39Z)
• GE-AdvGAN: Improving the transferability of adversarial samples by gradient editing-based adversarial generative model [69.71629949747884]
  Adversarial generative models, such as Generative Adversarial Networks (GANs), are widely applied for generating various types of data. In this work, we propose a novel algorithm named GE-AdvGAN to enhance the transferability of adversarial samples.
  arXiv  Detail & Related papers  (2024-01-11T16:43:16Z)
• Complexity Matters: Rethinking the Latent Space for Generative Modeling [65.64763873078114]
  In generative modeling, numerous successful approaches leverage a low-dimensional latent space, e.g., Stable Diffusion. In this study, we aim to shed light on this under-explored topic by rethinking the latent space from the perspective of model complexity.
  arXiv  Detail & Related papers  (2023-07-17T07:12:29Z)
• Result Diversification by Multi-objective Evolutionary Algorithms with Theoretical Guarantees [94.72461292387146]
  We propose to reformulate the result diversification problem as a bi-objective search problem, and solve it by a multi-objective evolutionary algorithm (EA) We theoretically prove that the GSEMO can achieve the optimal-time approximation ratio, $1/2$. When the objective function changes dynamically, the GSEMO can maintain this approximation ratio in running time, addressing the open question proposed by Borodin et al.
  arXiv  Detail & Related papers  (2021-10-18T14:00:22Z)
• IE-GAN: An Improved Evolutionary Generative Adversarial Network Using a New Fitness Function and a Generic Crossover Operator [20.100388977505002]
  We propose an improved E-GAN framework called IE-GAN, which introduces a new fitness function and a generic crossover operator. In particular, the proposed fitness function can model the evolutionary process of individuals more accurately. The crossover operator, which has been commonly adopted in evolutionary algorithms, can enable offspring to imitate the superior gene expression of their parents.
  arXiv  Detail & Related papers  (2021-07-25T13:55:07Z)
• Heterogeneous Face Frontalization via Domain Agnostic Learning [74.86585699909459]
  We propose a domain agnostic learning-based generative adversarial network (DAL-GAN) which can synthesize frontal views in the visible domain from thermal faces with pose variations. DAL-GAN consists of a generator with an auxiliary classifier and two discriminators which capture both local and global texture discriminations for better synthesis.
  arXiv  Detail & Related papers  (2021-07-17T20:41:41Z)
• Evolutionary Generative Adversarial Networks with Crossover Based Knowledge Distillation [4.044110325063562]
  We propose a general crossover operator, which can be widely applied to GANs using evolutionary strategies. We then design an evolutionary GAN framework C-GAN based on it. And we combine the crossover operator with evolutionary generative adversarial networks (EGAN) to implement the evolutionary generative adversarial networks with crossover (CE-GAN)
  arXiv  Detail & Related papers  (2021-01-27T03:24:30Z)
• Rethinking conditional GAN training: An approach using geometrically structured latent manifolds [58.07468272236356]
  Conditional GANs (cGAN) suffer from critical drawbacks such as the lack of diversity in generated outputs. We propose a novel training mechanism that increases both the diversity and the visual quality of a vanilla cGAN.
  arXiv  Detail & Related papers  (2020-11-25T22:54:11Z)
• Exploring the Evolution of GANs through Quality Diversity [0.4588028371034407]
  We propose the application of a quality-diversity algorithm in the evolution of GANs. We compare our proposal with the original COEGAN model and with an alternative version using a global competition approach.
  arXiv  Detail & Related papers  (2020-07-13T08:54:52Z)

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.