Demonstrating the Evolution of GANs through t-SNE
원문 초록
Generative Adversarial Networks (GANs) are powerful generative models that achieved strong results, mainly in the image domain. However, the training of GANs is not trivial, presenting some challenges tackled by different strategies. Evolutionary algorithms, such as COEGAN, were recently proposed as a solution to improve the GAN training, overcoming common problems that affect the model, such as vanishing gradient and mode collapse. In this work, we propose an evaluation method based on t-distributed Stochastic Neighbour Embedding (t-SNE) to assess the progress of GANs and visualize the distribution learned by generators in training. We propose the use of the feature space extracted from trained discriminators to evaluate samples produced by generators and from the input dataset. A metric based on the resulting t-SNE maps and the Jaccard index is proposed to represent the model quality. Experiments were conducted to assess the progress of GANs when trained using COEGAN. The results show both by visual inspection and metrics that the Evolutionary Algorithm gradually improves discriminators and generators through generations, avoiding problems such as mode collapse.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Graph-Supported Dynamic Algorithm Configuration for Multi-Objective Combinatorial Optimization
Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback
Benchmarking MOEAs for solving continuous multi-objective RL problems
Mergenetic: a Simple Evolutionary Model Merging Library
Evolutionary thoughts: integration of large language models and evolutionary algorithms
RainbowPlus: Enhancing Adversarial Prompt Generation via Evolutionary Quality-Diversity Search
토론
이 논문과 연결된 포럼 글이 아직 없습니다.