paper-with-me

Papers

Escaping from Collapsing Modes in a Constrained Space

2018-08-22 · ECCV 2018 9 · Chia-Che Chang, Chieh Hubert Lin, Che-Rung Lee, Da-Cheng Juan, Wei Wei, Hwann-Tzong Chen

Generative adversarial networks (GANs) often suffer from unpredictable mode-collapsing during training. We study the issue of mode collapse of Boundary Equilibrium Generative Adversarial Network (BEGAN), which is one of the state-of-the-art generative models. Despite its potential of generating high-quality images, we find that BEGAN tends to collapse at some modes after a period of training. We propose a new model, called \emph{BEGAN with a Constrained Space} (BEGAN-CS), which includes a latent-space constraint in the loss function. We show that BEGAN-CS can significantly improve training stability and suppress mode collapse without either increasing the model complexity or degrading the image quality. Further, we visualize the distribution of latent vectors to elucidate the effect of latent-space constraint. The experimental results show that our method has additional advantages of being able to train on small datasets and to generate images similar to a given real image yet with variations of designated attributes on-the-fly.

📄 PDF Abstract BibTeX arXiv:1808.07258

Code (1)

chang810249/BEGAN-CS 공식 구현 tf

Tasks

Generative Adversarial NetworkImage Generation

Methods 이 논문이 사용한 방법론

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
Dogecoin Customer Service Number +1-833-534-1729 설명 없음

Similar Papers 제목 키워드 기반

HOUDINI: Escaping from Moderately Constrained Saddles

2022-05-27 · Dmitrii Avdiukhin, Grigory Yaroslavtsev

We give the first polynomial time algorithms for escaping from high-dimensional saddle points under a moderate number of constraints. Given gradient access to a smooth function $f \colon \mathbb R^d \to \mathbb R$ we sho…

Open-Ended Question Answering

Efficiently testing local optimality and escaping saddles for ReLU networks

2018-09-28 · ICLR 2019 5 · Chulhee Yun, Suvrit Sra, Ali Jadbabaie

We provide a theoretical algorithm for checking local optimality and escaping saddles at nondifferentiable points of empirical risks of two-layer ReLU networks. Our algorithm receives any parameter value and returns: loc…

Social Ways: Learning Multi-Modal Distributions of Pedestrian Trajectories with GANs

2019-04-20 · CVPR 2019 6 · Javad Amirian, Jean-Bernard Hayet, Julien Pettre

This paper proposes a novel approach for predicting the motion of pedestrians interacting with others. It uses a Generative Adversarial Network (GAN) to sample plausible predictions for any agent in the scene. As GANs ar…

Generative Adversarial NetworkHuman motion predictionMulti-future Trajectory PredictionPedestrian Trajectory Prediction+3

Escaping Barren Plateaus in Variational Quantum Algorithms Using Negative Learning Rate in Quantum Internet of Things

2025-11-28 · Ratun Rahman, Dinh C. Nguyen arxiv

Variational Quantum Algorithms (VQAs) are becoming the primary computational primitive for next-generation quantum computers, particularly those embedded as resource-constrained accelerators in the emerging Quantum Inter…

Improving Text to Image Generation using Mode-seeking Function

2020-08-19 · Naitik Bhise, Zhenfei Zhang, Tien D. Bui

Generative Adversarial Networks (GANs) have long been used to understand the semantic relationship between the text and image. However, there are problems with mode collapsing in the image generation that causes some pre…

Image GenerationText to Image GenerationText-to-Image Generation