scholarly journals An Overview of Variational Autoencoders for Source Separation, Finance, and Bio-Signal Applications

Entropy ◽  
2021 ◽  
Vol 24 (1) ◽  
pp. 55
Author(s):  
Aman Singh ◽  
Tokunbo Ogunfunmi
Keyword(s):  
Input Data ◽  
Source Separation ◽  
Generative Models ◽  
Learning System ◽  
Generative Adversarial Networks ◽  
Space Representation ◽  
Comprehensive Overview ◽  
Maximum Information ◽  
Adversarial Networks ◽  
Latent Space

Autoencoders are a self-supervised learning system where, during training, the output is an approximation of the input. Typically, autoencoders have three parts: Encoder (which produces a compressed latent space representation of the input data), the Latent Space (which retains the knowledge in the input data with reduced dimensionality but preserves maximum information) and the Decoder (which reconstructs the input data from the compressed latent space). Autoencoders have found wide applications in dimensionality reduction, object detection, image classification, and image denoising applications. Variational Autoencoders (VAEs) can be regarded as enhanced Autoencoders where a Bayesian approach is used to learn the probability distribution of the input data. VAEs have found wide applications in generating data for speech, images, and text. In this paper, we present a general comprehensive overview of variational autoencoders. We discuss problems with the VAEs and present several variants of the VAEs that attempt to provide solutions to the problems. We present applications of variational autoencoders for finance (a new and emerging field of application), speech/audio source separation, and biosignal applications. Experimental results are presented for an example of speech source separation to illustrate the powerful application of variants of VAE: VAE, β-VAE, and ITL-AE. We conclude the paper with a summary, and we identify possible areas of research in improving performance of VAEs in particular and deep generative models in general, of which VAEs and generative adversarial networks (GANs) are examples.

Synthesizing Designs With Interpart Dependencies Using Hierarchical Generative Adversarial Networks

2019 ◽  
Vol 141 (11) ◽  
Author(s):  
Wei Chen ◽  
Mark Fuge
Keyword(s):  
Constraint Satisfaction ◽  
Real World ◽  
Generative Models ◽  
Dependency Graph ◽  
Generative Adversarial Networks ◽  
Engineering Systems ◽  
Adversarial Networks ◽  
Latent Space ◽  
Branching Factor ◽  
Low Dimensional

Abstract Real-world designs usually consist of parts with interpart dependencies, i.e., the geometry of one part is dependent on one or multiple other parts. We can represent such dependency in a part dependency graph. This paper presents a method for synthesizing these types of hierarchical designs using generative models learned from examples. It decomposes the problem of synthesizing the whole design into synthesizing each part separately but keeping the interpart dependencies satisfied. Specifically, this method constructs multiple generative models, the interaction of which is based on the part dependency graph. We then use the trained generative models to synthesize or explore each part design separately via a low-dimensional latent representation, conditioned on the corresponding parent part(s). We verify our model on multiple design examples with different interpart dependencies. We evaluate our model by analyzing the constraint satisfaction performance, the synthesis quality, the latent space quality, and the effects of part dependency depth and branching factor. This paper’s techniques for capturing dependencies among parts lay the foundation for learned generative models to extend to more realistic engineering systems where such relationships are widespread.

scholarly journals A Deep Generative Model for Code Switched Text

2019 ◽  
Author(s):  
Bidisha Samanta ◽  
Sharmila Reddy ◽  
Hussain Jagirdar ◽  
Niloy Ganguly ◽  
Soumen Chakrabarti
Keyword(s):  
State Of The Art ◽  
Generative Models ◽  
Code Switching ◽  
Language Models ◽  
Generative Adversarial Networks ◽  
Data Intensive ◽  
Adversarial Networks ◽  
Latent Space ◽  
Variational Autoencoder ◽  
Multilingual Societies

Code-switching, the interleaving of two or more languages within a sentence or discourse is pervasive in multilingual societies. Accurate language models for code-switched text are critical for NLP tasks. State-of-the-art data-intensive neural language models are difficult to train well from scarce language-labeled code-switched text. A potential solution is to use deep generative models to synthesize large volumes of realistic code-switched text. Although generative adversarial networks and variational autoencoders can synthesize plausible monolingual text from continuous latent space, they cannot adequately address code-switched text, owing to their informal style and complex interplay between the constituent languages. We introduce VACS, a novel variational autoencoder architecture specifically tailored to code-switching phenomena. VACS encodes to and decodes from a two-level hierarchical representation, which models syntactic contextual signals in the lower level, and language switching signals in the upper layer. Sampling representations from the prior and decoding them produced well-formed, diverse code-switched sentences. Extensive experiments show that using synthetic code-switched text with natural monolingual data results in significant (33.06\%) drop in perplexity.

Synthesizing Designs With Inter-Part Dependencies Using Hierarchical Generative Adversarial Networks

2018 ◽  
Author(s):  
Wei Chen ◽  
Ashwin Jeyaseelan ◽  
Mark Fuge
Keyword(s):  
Real World ◽  
Generative Models ◽  
Generative Adversarial Networks ◽  
Generative Adversarial Network ◽  
Design Exploration ◽  
Adversarial Network ◽  
Adversarial Networks ◽  
Latent Space ◽  
Latent Representations

Real-world designs usually consist of parts with hierarchical dependencies, i.e., the geometry of one component (a child shape) is dependent on another (a parent shape). We propose a method for synthesizing this type of design. It decomposes the problem of synthesizing the whole design into synthesizing each component separately but keeping the inter-component dependencies satisfied. This method constructs a two-level generative adversarial network to train two generative models for parent and child shapes, respectively. We then use the trained generative models to synthesize or explore parent and child shapes separately via a parent latent representation and infinite child latent representations, each conditioned on a parent shape. We evaluate and discuss the disentanglement and consistency of latent representations obtained by this method. We show that shapes change consistently along any direction in the latent space. This property is desirable for design exploration over the latent space.

scholarly journals Fast and Accurate Electromagnetic and Hadronic Showers from Generative Models

2021 ◽  
Vol 251 ◽  
pp. 03049
Author(s):  
Erik Buhmann ◽  
Sascha Diefenbacher ◽  
Engin Eren ◽  
Frank Gaede ◽  
Daniel Hundhausen ◽  
...  
Keyword(s):  
Particle Physics ◽  
Computational Cost ◽  
Generative Models ◽  
Generative Adversarial Networks ◽  
Event Simulation ◽  
Information Bottleneck ◽  
Adversarial Networks ◽  
Latent Space ◽  
High Computational Cost ◽  
Expected Increase

Generative machine learning models offer a promising way to efficiently amplify classical Monte Carlo generators’ statistics for event simulation and generation in particle physics. Given the already high computational cost of simulation and the expected increase in data in the high-precision era of the LHC and at future colliders, such fast surrogate simulators are urgently needed. This contribution presents a status update on simulating particle showers in high granularity calorimeters for future colliders. Building on prior work using Generative Adversarial Networks (GANs), Wasserstein-GANs, and the information-theoretically motivated Bounded Information Bottleneck Autoencoder (BIB-AE), we further improve the fidelity of generated photon showers. The key to this improvement is a detailed understanding and optimisation of the latent space. The richer structure of hadronic showers compared to electromagnetic ones makes their precise modeling an important yet challenging problem. We present initial progress towards accurately simulating the core of hadronic showers in a highly granular scintillator calorimeter.

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 A deep learning approach to capture the essence of Candida albicans morphologies

2021 ◽  
Author(s):  
Van Bettauer ◽  
Anna CBP Costa ◽  
Raha Parvizi Omran ◽  
Samira Massahi ◽  
Eftyhios Kirbizakis ◽  
...  
Keyword(s):  
Deep Learning ◽  
Learning Strategy ◽  
Developmental Trajectories ◽  
Generative Adversarial Networks ◽  
Learning Approach ◽  
Adversarial Networks ◽  
Latent Space ◽  
Contrast Microscopy ◽  
Opportunistic Human Pathogen ◽  
Community Meeting

We present deep learning-based approaches for exploring the complex array of morphologies exhibited by the opportunistic human pathogen C. albicans. Our system entitled Candescence automatically detects C. albicans cells from Differential Image Contrast microscopy, and labels each detected cell with one of nine vegetative, mating-competent or filamentous morphologies. The software is based upon a fully convolutional one-stage object detector and exploits a novel cumulative curriculum-based learning strategy that stratifies our images by difficulty from simple vegetative forms to more complex filamentous architectures. Candescence achieves very good performance on this difficult learning set which has substantial intermixing between the predicted classes. To capture the essence of each C. albicans morphology, we develop models using generative adversarial networks and identify subcomponents of the latent space which control technical variables, developmental trajectories or morphological switches. We envision Candescence as a community meeting point for quantitative explorations of C. albicans morphology.

Deep Learning in Cybersecurity

2020 ◽  
Vol 10 (2) ◽  
pp. 82-105
Author(s):  
Yadigar N. Imamverdiyev ◽  
Fargana J. Abdullayeva
Keyword(s):  
Deep Learning ◽  
Statistical Analysis ◽  
Detection Methods ◽  
Generative Adversarial Networks ◽  
Comprehensive Overview ◽  
Adversarial Networks

In this article, a review and summarization of the emerging scientific approaches of deep learning (DL) on cybersecurity are provided, a structured and comprehensive overview of the various cyberattack detection methods is conducted, existing cyberattack detection methods based on DL is categorized. Methods covering attacks to deep learning based on generative adversarial networks (GAN) are investigated. The datasets used for the evaluation of the efficiency proposed by researchers for cyberattack detection methods are discussed. The statistical analysis of papers published on cybersecurity with the application of DL over the years is conducted. Existing commercial cybersecurity solutions developed on deep learning are described.

scholarly journals Parallel Image Completion with Edge and Color Map

2019 ◽  
Vol 9 (18) ◽  
pp. 3856 ◽  
Author(s):  
Dan Zhao ◽  
Baolong Guo ◽  
Yunyi Yan
Keyword(s):  
Superior Performance ◽  
Generative Adversarial Networks ◽  
Image Completion ◽  
Significant Progress ◽  
Color Information ◽  
Parallel Edge ◽  
Adversarial Networks ◽  
Parallel Image ◽  
Latent Space ◽  
Image Edge

Over the last few years, image completion has made significant progress due to the generative adversarial networks (GANs) that are able to synthesize photorealistic contents. However, one of the main obstacles faced by many existing methods is that they often create blurry textures or distorted structures that are inconsistent with surrounding regions. The main reason is the ineffectiveness of disentangling style latent space implicitly from images. To address this problem, we develop a novel image completion framework called PIC-EC: parallel image completion networks with edge and color maps, which explicitly provides image edge and color information as the prior knowledge for image completion. The PIC-EC framework consists of the parallel edge and color generators followed by an image completion network. Specifically, the parallel paths generate edge and color maps for the missing region at the same time, and then the image completion network fills the missing region with fine details using the generated edge and color information as the priors. The proposed method was evaluated over CelebA-HQ and Paris StreetView datasets. Experimental results demonstrate that PIC-EC achieves superior performance on challenging cases with complex compositions and outperforms existing methods on evaluations of realism and accuracy, both quantitatively and qualitatively.

Sign in / Sign up

Export Citation Format

Share Document