scholarly journals Knowledge-Based Regularization in Generative Modeling

2020 ◽  
Author(s):  
Naoya Takeishi ◽  
Yoshinobu Kawahara
Keyword(s):  
Prior Knowledge ◽  
Domain Knowledge ◽  
Specific Model ◽  
General Purpose ◽  
Generative Models ◽  
Generative Adversarial Networks ◽  
Knowledge Based ◽  
Adversarial Networks ◽  
Generative Modeling ◽  
Relative Dependence

Prior domain knowledge can greatly help to learn generative models. However, it is often too costly to hard-code prior knowledge as a specific model architecture, so we often have to use general-purpose models. In this paper, we propose a method to incorporate prior knowledge of feature relations into the learning of general-purpose generative models. To this end, we formulate a regularizer that makes the marginals of a generative model to follow prescribed relative dependence of features. It can be incorporated into off-the-shelf learning methods of many generative models, including variational autoencoders and generative adversarial networks, as its gradients can be computed using standard backpropagation techniques. We show the effectiveness of the proposed method with experiments on multiple types of datasets and generative models.

scholarly journals InvNet: Encoding Geometric and Statistical Invariances in Deep Generative Models

2020 ◽  
Vol 34 (04) ◽  
pp. 4377-4384
Author(s):  
Ameya Joshi ◽  
Minsu Cho ◽  
Viraj Shah ◽  
Balaji Pokuri ◽  
Soumik Sarkar ◽  
...  
Keyword(s):  
Image Data ◽  
Generative Models ◽  
Generative Adversarial Networks ◽  
Complex Data ◽  
Challenging Problem ◽  
Two Phase ◽  
Adversarial Networks ◽  
Generative Modeling ◽  
Lack Of Control ◽  
Real World Problems

Generative Adversarial Networks (GANs), while widely successful in modeling complex data distributions, have not yet been sufficiently leveraged in scientific computing and design. Reasons for this include the lack of flexibility of GANs to represent discrete-valued image data, as well as the lack of control over physical properties of generated samples. We propose a new conditional generative modeling approach (InvNet) that efficiently enables modeling discrete-valued images, while allowing control over their parameterized geometric and statistical properties. We evaluate our approach on several synthetic and real world problems: navigating manifolds of geometric shapes with desired sizes; generation of binary two-phase materials; and the (challenging) problem of generating multi-orientation polycrystalline microstructures.

scholarly journals Density estimation using deep generative neural networks

2021 ◽  
Vol 118 (15) ◽  
pp. e2101344118
Author(s):  
Qiao Liu ◽  
Jiaze Xu ◽  
Rui Jiang ◽  
Wing Hung Wong
Keyword(s):  
Neural Networks ◽  
Density Estimation ◽  
General Purpose ◽  
Generative Models ◽  
Generative Adversarial Networks ◽  
Data Generation ◽  
Diverse Range ◽  
Statistical Framework ◽  
Adversarial Networks ◽  
Density Values

Density estimation is one of the fundamental problems in both statistics and machine learning. In this study, we propose Roundtrip, a computational framework for general-purpose density estimation based on deep generative neural networks. Roundtrip retains the generative power of deep generative models, such as generative adversarial networks (GANs) while it also provides estimates of density values, thus supporting both data generation and density estimation. Unlike previous neural density estimators that put stringent conditions on the transformation from the latent space to the data space, Roundtrip enables the use of much more general mappings where target density is modeled by learning a manifold induced from a base density (e.g., Gaussian distribution). Roundtrip provides a statistical framework for GAN models where an explicit evaluation of density values is feasible. In numerical experiments, Roundtrip exceeds state-of-the-art performance in a diverse range of density estimation tasks.

Generative Adversarial Networks (GANs)

2021 ◽  
Vol 54 (3) ◽  
pp. 1-42
Author(s):  
Divya Saxena ◽  
Jiannong Cao
Keyword(s):  
Optimization Technique ◽  
Generative Models ◽  
Generative Adversarial Networks ◽  
Network Architectures ◽  
Research Directions ◽  
Research Issues ◽  
Design And Optimization ◽  
Adversarial Networks ◽  
Comprehensive Survey ◽  
Selection Of

Generative Adversarial Networks (GANs) is a novel class of deep generative models that has recently gained significant attention. GANs learn complex and high-dimensional distributions implicitly over images, audio, and data. However, there exist major challenges in training of GANs, i.e., mode collapse, non-convergence, and instability, due to inappropriate design of network architectre, use of objective function, and selection of optimization algorithm. Recently, to address these challenges, several solutions for better design and optimization of GANs have been investigated based on techniques of re-engineered network architectures, new objective functions, and alternative optimization algorithms. To the best of our knowledge, there is no existing survey that has particularly focused on the broad and systematic developments of these solutions. In this study, we perform a comprehensive survey of the advancements in GANs design and optimization solutions proposed to handle GANs challenges. We first identify key research issues within each design and optimization technique and then propose a new taxonomy to structure solutions by key research issues. In accordance with the taxonomy, we provide a detailed discussion on different GANs variants proposed within each solution and their relationships. Finally, based on the insights gained, we present promising research directions in this rapidly growing field.

scholarly journals Conditional Wasserstein Generative Adversarial Networks for Fast Detector Simulation

2021 ◽  
Vol 251 ◽  
pp. 03055
Author(s):  
John Blue ◽  
Braden Kronheim ◽  
Michelle Kuchera ◽  
Raghuram Ramanujan
Keyword(s):  
High Energy Physics ◽  
High Energy ◽  
Generative Models ◽  
Generative Adversarial Networks ◽  
Detector Response ◽  
Event Simulation ◽  
Simulation Process ◽  
Adversarial Networks ◽  
Wide Range ◽  
Detector Simulation

Detector simulation in high energy physics experiments is a key yet computationally expensive step in the event simulation process. There has been much recent interest in using deep generative models as a faster alternative to the full Monte Carlo simulation process in situations in which the utmost accuracy is not necessary. In this work we investigate the use of conditional Wasserstein Generative Adversarial Networks to simulate both hadronization and the detector response to jets. Our model takes the 4-momenta of jets formed from partons post-showering and pre-hadronization as inputs and predicts the 4-momenta of the corresponding reconstructed jet. Our model is trained on fully simulated tt events using the publicly available GEANT-based simulation of the CMS Collaboration. We demonstrate that the model produces accurate conditional reconstructed jet transverse momentum (pT) distributions over a wide range of pT for the input parton jet. Our model takes only a fraction of the time necessary for conventional detector simulation methods, running on a CPU in less than a millisecond per event.

scholarly journals Designing complex architectured materials with generative adversarial networks

2020 ◽  
Vol 6 (17) ◽  
pp. eaaz4169 ◽  
Author(s):  
Yunwei Mao ◽  
Qi He ◽  
Xuanhe Zhao
Keyword(s):  
Prior Knowledge ◽  
Mass Production ◽  
Systematic Approach ◽  
Elastic Stiffness ◽  
Upper Bounds ◽  
Generative Adversarial Networks ◽  
Simulation Data ◽  
Adversarial Networks ◽  
Isotropic Elasticity ◽  
Architectured Materials

Architectured materials on length scales from nanometers to meters are desirable for diverse applications. Recent advances in additive manufacturing have made mass production of complex architectured materials technologically and economically feasible. Existing architecture design approaches such as bioinspiration, Edisonian, and optimization, however, generally rely on experienced designers’ prior knowledge, limiting broad applications of architectured materials. Particularly challenging is designing architectured materials with extreme properties, such as the Hashin-Shtrikman upper bounds on isotropic elasticity in an experience-free manner without prior knowledge. Here, we present an experience-free and systematic approach for the design of complex architectured materials with generative adversarial networks. The networks are trained using simulation data from millions of randomly generated architectures categorized based on different crystallographic symmetries. We demonstrate modeling and experimental results of more than 400 two-dimensional architectures that approach the Hashin-Shtrikman upper bounds on isotropic elastic stiffness with porosities from 0.05 to 0.75.

scholarly journals Learning Generative Adversarial Networks from Multiple Data Sources

2019 ◽  
Author(s):  
Trung Le ◽  
Quan Hoang ◽  
Hung Vu ◽  
Tu Dinh Nguyen ◽  
Hung Bui ◽  
...  
Keyword(s):  
Generative Models ◽  
Data Sources ◽  
Black Hair ◽  
Primary Data ◽  
Generative Adversarial Networks ◽  
Auxiliary Data ◽  
Adversarial Networks ◽  
Multiple Data ◽  
Data Source ◽  
Push And Pull

Generative Adversarial Networks (GANs) are a powerful class of deep generative models. In this paper, we extend GAN to the problem of generating data that are not only close to a primary data source but also required to be different from auxiliary data sources. For this problem, we enrich both GANs' formulations and applications by introducing pushing forces that thrust generated samples away from given auxiliary data sources. We term our method Push-and-Pull GAN (P2GAN). We conduct extensive experiments to demonstrate the merit of P2GAN in two applications: generating data with constraints and addressing the mode collapsing problem. We use CIFAR-10, STL-10, and ImageNet datasets and compute Fréchet Inception Distance to evaluate P2GAN's effectiveness in addressing the mode collapsing problem. The results show that P2GAN outperforms the state-of-the-art baselines. For the problem of generating data with constraints, we show that P2GAN can successfully avoid generating specific features such as black hair.

scholarly journals Emulation of Cosmological Mass Maps with Conditional Generative Adversarial Networks

2021 ◽  
Vol 4 ◽  
Author(s):  
Nathanaël Perraudin ◽  
Sandro Marcon ◽  
Aurelien Lucchi ◽  
Tomasz Kacprzak
Keyword(s):  
Gravitational Lensing ◽  
Cosmological Parameters ◽  
Similarity Index ◽  
Power Spectra ◽  
Generative Models ◽  
Generative Adversarial Networks ◽  
Summary Statistics ◽  
Redshift Distribution ◽  
Adversarial Networks ◽  
The Universe

Weak gravitational lensing mass maps play a crucial role in understanding the evolution of structures in the Universe and our ability to constrain cosmological models. The prediction of these mass maps is based on expensive N-body simulations, which can create a computational bottleneck for cosmological analyses. Simulation-based emulators of map summary statistics, such as the matter power spectrum and its covariance, are starting to play increasingly important role, as the analytical predictions are expected to reach their precision limits for upcoming experiments. Creating an emulator of the cosmological mass maps themselves, rather than their summary statistics, is a more challenging task. Modern deep generative models, such as Generative Adversarial Networks (GAN), have demonstrated their potential to achieve this goal. Most existing GAN approaches produce simulations for a fixed value of the cosmological parameters, which limits their practical applicability. We propose a novel conditional GAN model that is able to generate mass maps for any pair of matter density Ωm and matter clustering strength σ8, parameters which have the largest impact on the evolution of structures in the Universe, for a given source galaxy redshift distribution n(z). Our results show that our conditional GAN can interpolate efficiently within the space of simulated cosmologies, and generate maps anywhere inside this space with good visual quality high statistical accuracy. We perform an extensive quantitative comparison of the N-body and GAN -generated maps using a range of metrics: the pixel histograms, peak counts, power spectra, bispectra, Minkowski functionals, correlation matrices of the power spectra, the Multi-Scale Structural Similarity Index (MS-SSIM) and our equivalent of the Fréchet Inception Distance. We find a very good agreement on these metrics, with typical differences are <5% at the center of the simulation grid, and slightly worse for cosmologies at the grid edges. The agreement for the bispectrum is slightly worse, on the <20% level. This contribution is a step toward building emulators of mass maps directly, capturing both the cosmological signal and its variability. We make the code1 and the data2 publicly available.

scholarly journals Deep image synthesis from intuitive user input: A review and perspectives

2021 ◽  
Vol 8 (1) ◽  
pp. 3-31
Author(s):  
Yuan Xue ◽  
Yuan-Chen Guo ◽  
Han Zhang ◽  
Tao Xu ◽  
Song-Hai Zhang ◽  
...  
Keyword(s):  
Image Synthesis ◽  
Generative Models ◽  
Generative Adversarial Networks ◽  
Image Generation ◽  
Art And Design ◽  
User Input ◽  
Adversarial Networks ◽  
Benchmark Datasets ◽  
Deep Image ◽  
Realistic Images

AbstractIn many applications of computer graphics, art, and design, it is desirable for a user to provide intuitive non-image input, such as text, sketch, stroke, graph, or layout, and have a computer system automatically generate photo-realistic images according to that input. While classically, works that allow such automatic image content generation have followed a framework of image retrieval and composition, recent advances in deep generative models such as generative adversarial networks (GANs), variational autoencoders (VAEs), and flow-based methods have enabled more powerful and versatile image generation approaches. This paper reviews recent works for image synthesis given intuitive user input, covering advances in input versatility, image generation methodology, benchmark datasets, and evaluation metrics. This motivates new perspectives on input representation and interactivity, cross fertilization between major image generation paradigms, and evaluation and comparison of generation methods.

scholarly journals CreativeGAN: Editing Generative Adversarial Networks for Creative Design Synthesis

2021 ◽  
Author(s):  
Amin Heyrani Nobari ◽  
Muhammad Fathy Rashad ◽  
Faez Ahmed
Keyword(s):  
Novelty Detection ◽  
Computational Design ◽  
Generative Models ◽  
Machine Learning Techniques ◽  
Generative Adversarial Networks ◽  
Creative Design ◽  
Design Synthesis ◽  
Adversarial Networks ◽  
Automated Method ◽  
Learning Techniques

Abstract Modern machine learning techniques, such as deep neural networks, are transforming many disciplines ranging from image recognition to language understanding, by uncovering patterns in big data and making accurate predictions. They have also shown promising results for synthesizing new designs, which is crucial for creating products and enabling innovation. Generative models, including generative adversarial networks (GANs), have proven to be effective for design synthesis with applications ranging from product design to metamaterial design. These automated computational design methods can support human designers, who typically create designs by a time-consuming process of iteratively exploring ideas using experience and heuristics. However, there are still challenges remaining in automatically synthesizing ‘creative’ designs. GAN models, however, are not capable of generating unique designs, a key to innovation and a major gap in AI-based design automation applications. This paper proposes an automated method, named CreativeGAN, for generating novel designs. It does so by identifying components that make a design unique and modifying a GAN model such that it becomes more likely to generate designs with identified unique components. The method combines state-of-art novelty detection, segmentation, novelty localization, rewriting, and generative models for creative design synthesis. Using a dataset of bicycle designs, we demonstrate that the method can create new bicycle designs with unique frames and handles, and generalize rare novelties to a broad set of designs. Our automated method requires no human intervention and demonstrates a way to rethink creative design synthesis and exploration. For details and code used in this paper please refer to http://decode.mit.edu/projects/creativegan/.

Sign in / Sign up

Export Citation Format

Share Document