DOCSLIB.ORG

Dual Contradistinctive Generative Autoencoder

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Dual Contradistinctive Generative Autoencoder Dual Contradistinctive Generative Autoencoder Gaurav Parmar* 1 Dacheng Li* 1 Kwonjoon Lee* 2 Zhuowen Tu2 1Carnegie Mellon University 2UC San Diego {gparmar,dacheng2}@andrew.cmu.edu {kwl042,ztu}@ucsd.edu (a) DC-VAE (ours) Reconstruction results. Left: 128 × 128. Right: 512 × 512. (b) DC-VAE (ours) Sampling results. Left: 128 × 128. Right: 512 × 512. Figure 1: DC-VAE Reconstruction (top) and Sampling (bottom) on LSUN Bedroom [68] at resolution 128 × 128 (left) and CelebA-HQ [35] at resolution 512 × 512 (right). Abstract 1. Introduction We present a new generative autoencoder model with dual contradistinctive losses to improve generative autoencoder Tremendous progress has been made in deep learning that performs simultaneous inference (reconstruction) and for the development of various learning frameworks [40, synthesis (sampling). Our model, named dual contradis- 24, 17, 64]. Autoencoder (AE) [44, 27] aims to compactly tinctive generative autoencoder (DC-VAE), integrates an represent and faithfully reproduce the original input signal instance-level discriminative loss (maintaining the instance- by concatenating an encoder and a decoder in an end-to- level fidelity for the reconstruction/synthesis) with a set-level end learning framework. The goal of AE is to make the adversarial loss (encouraging the set-level fidelity for the encoded representation semantically efficient and sufficient reconstruction/synthesis), both being contradistinctive. Ex- to reproduce the input signal by its decoder. Autoencoder’s tensive experimental results by DC-VAE across different res- generative companion, variational autoencoder (VAE) [38], olutions including 32×32, 64×64, 128×128, and 512×512 additionally learns a variational model for the latent variables are reported. The two contradistinctive losses in VAE work to capture the underlying sample distribution. harmoniously in DC-VAE leading to a significant qualitative The key objective for a generative autoencoder is to main- and quantitative performance enhancement over the base- tain two types of fidelities: (1) an instance-level fidelity to line VAEs without architectural changes. State-of-the-art make the reconstruction/synthesis faithful to the individual or competitive results among generative autoencoders for input data sample, and (2) a set-level fidelity to make the image reconstruction, image synthesis, image interpolation, reconstruction/synthesis of the decoder faithful to the entire and representation learning are observed. DC-VAE is a input data set. The VAE/GAN algorithm [42] combines a general-purpose VAE model, applicable to a wide variety of * indicates equal contribution. downstream tasks in computer vision and machine learning. Code: https://github.com/mlpc-ucsd/DC-VAE. 823 reconstruction loss (for instance-level fidelity) with an ad- by developing an Evidence Lower BOund (ELBO) objec- versarial loss (for set-level fidelity). However, the result of tive. However, the VAE reconstruction/synthesis is known VAE/GAN is sub-optimal, as shown in Table 1. to be blurry. To improve the image quality, a sequence of The pixel-wise reconstruction loss in the standard VAE VAE based models have been developed [42, 15, 30, 3, 69]. [38] typically results in blurry images with degenerated se- VAE/GAN [42] adopts an adversarial loss to improve the mantics. A possible solution to resolving the above conflict quality of the image, but its output for both reconstruction lies in two aspects: (1) turning the measure in the pixel space and synthesis (new samples) is still unsatisfactory. IntroVAE into induced feature space that is more semantically meaning- [30] adds a loop from the output back to the input and is ful; (2) changing the L2 distance (per-pixel) into a learned able to attain image quality that is on par with some modern instance-level distance function for the entire image (akin GANs in some aspects. However, its full illustration for both to generative adversarial networks which learn set-level dis- reconstruction and synthesis is unclear. PGA [69] adds a tance functions). Taking these two steps allows us to design constraint to the latent variables. an instance-level classification loss that is aligned with the Deep generative model. Pioneering works of [61, 20] alle- adversarial loss in the GAN model enforcing set-level fidelity. viate the difficulty of learning densities by approximating Motivated by the above observations, we develop a new gen- likelihoods via classification (real (positive) samples vs. fake erative autoencoder model with dual contradistinctive losses (pseudo-negative or adversarial) samples). Generative adver- by adopting a discriminative loss performing instance-level sarial network (GAN) [17] builds on neural networks and classification (enforcing the instance-level fidelity), which amortized sampling (a decoder network that maps a noise is rooted in metric learning [41] and contrastive learning into an image). The subsequent development after GAN [21, 66, 63]. Combined with the adversarial losses for the [56, 2, 18, 35, 16] has led to a great leap forward in build- set-level fidelity, both terms are formulated in the induced ing decoder-based generative models. It has been widely feature space performing contradistinction: (1) the instance- observed that the adversarial loss in GANs contributes signif- level contrastive loss considers each input instance (image) icantly to the improved quality of image synthesis. InfoGAN itself as a class, and (2) the set-level adversarial loss treats [9] aims to maximize mutual information between latent vari- the entire input set as a positive class. We name our method ables and the output of the generator. In contrast, DC-VAE dual contradistinctive generative autoencoder (DC-VAE) and can be understood as increasing mutual information between make the following contributions: the input and output of the autoencoder. Furthermore, In- foGAN does not learn encoder. ALI/BiGAN [15, 14] ad- • We develop a new algorithm, dual contradistinctive gen- ditionally learn inference network (encoder), however they erative autoencoder (DC-VAE), by combining instance- are shown to have poor reconstruction. Energy-based gen- level and set-level classification losses in the VAE frame- erative models [57, 67, 43, 32, 47] — which aim to directly work, and systematically show the significance of these model data density — are making a steady improvement for two loss terms in DC-VAE; a simultaneously generative and discriminative single model. • The effectiveness of DC-VAE is illustrated in a number Contrastive learning. From another angle, contrastive of tasks, including image reconstruction, image synthesis, learning [21, 66, 23, 6] has lately shown its particular advan- image interpolation, and representation learning by recon- tage in unsupervised training of CNN features. It overcomes structing and sampling images across different resolutions the limitation in unsupervised learning where class label is including 32 × 32, 64 × 64, 128 × 128, and 512 × 512; missing by turning each image instance into one class. Thus, • Under the new loss term, DC-VAE attains a signifi- the softmax function in the standard discriminative classifi- cant performance boost over the competing methods cation training can be applied. Contrastive learning can be without architectural change, thus potentially provid- connected to metric learning [4, 10, 5]. ing a handy solution for many AE/VAE based model- In this paper, we aim to improve VAE [38] by introduc- ing/representation applications. DC-VAE helps greatly ing a contrastive loss [63] to address instance-level fidelity reducing the performance gap for image synthesis be- between the input and the reconstruction in the induced fea- tween the baseline VAE to the competitive GAN models. ture space. Unlike in self-supervised representation learning methods [63, 23, 6], where self-supervision requires generat- 2. Related Work ing a transformed input (via data augmentation operations), the reconstruction naturally fits into the contrastive term that Related work can be roughly divided into three categories: encourages the matching between the reconstruction and (1) generative autoencoder, (2) deep generative model, and the input image instance, while pushing the reconstruction (3) contrastive learning. away from the rest of the images in the entire training set. Generative autoencoder. Variational autoencoder (VAE) Thus, the instance-level and set-level contradistinctive terms [38] points to an exciting direction of generative models collaborate with each to encourage the high fidelity of the 824 reconstruction and synthesis. In Figure 3 and Table 1, we VAE/GAN Generative adversarial networks (GANs) [17] systematically show the significance of with and without the and its variants [56], on the other hand, are shown to be instance-level and the set-level contradistinctive terms. In producing highly realistic images. The success was largely addition, we explore multi-scale contrastive learning via two attributed to learning a fidelity function (often referred to as schemes in Section 4.2: 1) deep supervision for contrastive a discriminator) that measures how realistic the generated learning in different convolution layers, and 2) patch-based images are. This can be achieved by learning to contrast contrastive learning for fine-grained data fidelity. In the ex- (classify) the set of training images with the set of generated periments, we show competitive results for the proposed DC- images [61, 20, 17]. VAE in a number of benchmarks for three
Load more

Recommended publications
  • Disentangled Variational Auto-Encoder for Semi-Supervised Learning
    Information Sciences 482 (2019) 73–85 Contents lists available at ScienceDirect Information Sciences journal homepage: www.elsevier.com/locate/ins Disentangled Variational Auto-Encoder for semi-supervised learning ∗ Yang Li a, Quan Pan a, Suhang Wang c, Haiyun Peng b, Tao Yang a, Erik Cambria b, a School of Automation, Northwestern Polytechnical University, China b School of Computer Science and Engineering, Nanyang Technological University, Singapore c College of Information Sciences and Technology, Pennsylvania State University, USA a r t i c l e i n f o a b s t r a c t Article history: Semi-supervised learning is attracting increasing attention due to the fact that datasets Received 5 February 2018 of many domains lack enough labeled data. Variational Auto-Encoder (VAE), in particu- Revised 23 December 2018 lar, has demonstrated the benefits of semi-supervised learning. The majority of existing Accepted 24 December 2018 semi-supervised VAEs utilize a classifier to exploit label information, where the param- Available online 3 January 2019 eters of the classifier are introduced to the VAE. Given the limited labeled data, learn- Keywords: ing the parameters for the classifiers may not be an optimal solution for exploiting label Semi-supervised learning information. Therefore, in this paper, we develop a novel approach for semi-supervised Variational Auto-encoder VAE without classifier. Specifically, we propose a new model called Semi-supervised Dis- Disentangled representation entangled VAE (SDVAE), which encodes the input data into disentangled representation Neural networks and non-interpretable representation, then the category information is directly utilized to regularize the disentangled representation via the equality constraint.
    [Show full text]
  • A Deep Hierarchical Variational Autoencoder
    NVAE: A Deep Hierarchical Variational Autoencoder Arash Vahdat, Jan Kautz NVIDIA {avahdat, jkautz}@nvidia.com Abstract Normalizing flows, autoregressive models, variational autoencoders (VAEs), and deep energy-based models are among competing likelihood-based frameworks for deep generative learning. Among them, VAEs have the advantage of fast and tractable sampling and easy-to-access encoding networks. However, they are cur- rently outperformed by other models such as normalizing flows and autoregressive models. While the majority of the research in VAEs is focused on the statistical challenges, we explore the orthogonal direction of carefully designing neural archi- tectures for hierarchical VAEs. We propose Nouveau VAE (NVAE), a deep hierar- chical VAE built for image generation using depth-wise separable convolutions and batch normalization. NVAE is equipped with a residual parameterization of Normal distributions and its training is stabilized by spectral regularization. We show that NVAE achieves state-of-the-art results among non-autoregressive likelihood-based models on the MNIST, CIFAR-10, CelebA 64, and CelebA HQ datasets and it provides a strong baseline on FFHQ. For example, on CIFAR-10, NVAE pushes the state-of-the-art from 2.98 to 2.91 bits per dimension, and it produces high-quality images on CelebA HQ as shown in Fig. 1. To the best of our knowledge, NVAE is the first successful VAE applied to natural images as large as 256×256 pixels. The source code is available at https://github.com/NVlabs/NVAE. 1 Introduction The majority of the research efforts on improving VAEs [1, 2] is dedicated to the statistical challenges, such as reducing the gap between approximate and true posterior distributions [3, 4, 5, 6, 7, 8, 9, 10], formulating tighter bounds [11, 12, 13, 14], reducing the gradient noise [15, 16], extending VAEs to discrete variables [17, 18, 19, 20, 21, 22, 23], or tackling posterior collapse [24, 25, 26, 27].
    [Show full text]
  • Explainable Deep Learning Models in Medical Image Analysis
    Journal of Imaging Review Explainable Deep Learning Models in Medical Image Analysis Amitojdeep Singh 1,2,* , Sourya Sengupta 1,2 and Vasudevan Lakshminarayanan 1,2 1 Theoretical and Experimental Epistemology Laboratory, School of Optometry and Vision Science, University of Waterloo, Waterloo, ON N2L 3G1, Canada; [email protected] (S.S.); [email protected] (V.L.) 2 Department of Systems Design Engineering, University of Waterloo, Waterloo, ON N2L 3G1, Canada * Correspondence: [email protected] Received: 28 May 2020; Accepted: 17 June 2020; Published: 20 June 2020 Abstract: Deep learning methods have been very effective for a variety of medical diagnostic tasks and have even outperformed human experts on some of those. However, the black-box nature of the algorithms has restricted their clinical use. Recent explainability studies aim to show the features that influence the decision of a model the most. The majority of literature reviews of this area have focused on taxonomy, ethics, and the need for explanations. A review of the current applications of explainable deep learning for different medical imaging tasks is presented here. The various approaches, challenges for clinical deployment, and the areas requiring further research are discussed here from a practical standpoint of a deep learning researcher designing a system for the clinical end-users. Keywords: explainability; explainable AI; XAI; deep learning; medical imaging; diagnosis 1. Introduction Computer-aided diagnostics (CAD) using artificial intelligence (AI) provides a promising way to make the diagnosis process more efficient and available to the masses. Deep learning is the leading artificial intelligence (AI) method for a wide range of tasks including medical imaging problems.
    [Show full text]
  • Double Backpropagation for Training Autoencoders Against Adversarial Attack
    1 Double Backpropagation for Training Autoencoders against Adversarial Attack Chengjin Sun, Sizhe Chen, and Xiaolin Huang, Senior Member, IEEE Abstract—Deep learning, as widely known, is vulnerable to adversarial samples. This paper focuses on the adversarial attack on autoencoders. Safety of the autoencoders (AEs) is important because they are widely used as a compression scheme for data storage and transmission, however, the current autoencoders are easily attacked, i.e., one can slightly modify an input but has totally different codes. The vulnerability is rooted the sensitivity of the autoencoders and to enhance the robustness, we propose to adopt double backpropagation (DBP) to secure autoencoder such as VAE and DRAW. We restrict the gradient from the reconstruction image to the original one so that the autoencoder is not sensitive to trivial perturbation produced by the adversarial attack. After smoothing the gradient by DBP, we further smooth the label by Gaussian Mixture Model (GMM), aiming for accurate and robust classification. We demonstrate in MNIST, CelebA, SVHN that our method leads to a robust autoencoder resistant to attack and a robust classifier able for image transition and immune to adversarial attack if combined with GMM. Index Terms—double backpropagation, autoencoder, network robustness, GMM. F 1 INTRODUCTION N the past few years, deep neural networks have been feature [9], [10], [11], [12], [13], or network structure [3], [14], I greatly developed and successfully used in a vast of fields, [15]. such as pattern recognition, intelligent robots, automatic Adversarial attack and its defense are revolving around a control, medicine [1]. Despite the great success, researchers small ∆x and a big resulting difference between f(x + ∆x) have found the vulnerability of deep neural networks to and f(x).
    [Show full text]
  • Generative Models
    Lecture 11: Generative Models Fei-Fei Li & Justin Johnson & Serena Yeung Lecture 11 - 1 May 9, 2019 Administrative ● A3 is out. Due May 22. ● Milestone is due next Wednesday. ○ Read Piazza post for milestone requirements. ○ Need to Finish data preprocessing and initial results by then. ● Don't discuss exam yet since people are still taking it. Fei-Fei Li & Justin Johnson & Serena Yeung Lecture 11 -2 May 9, 2019 Overview ● Unsupervised Learning ● Generative Models ○ PixelRNN and PixelCNN ○ Variational Autoencoders (VAE) ○ Generative Adversarial Networks (GAN) Fei-Fei Li & Justin Johnson & Serena Yeung Lecture 11 - 3 May 9, 2019 Supervised vs Unsupervised Learning Supervised Learning Data: (x, y) x is data, y is label Goal: Learn a function to map x -> y Examples: Classification, regression, object detection, semantic segmentation, image captioning, etc. Fei-Fei Li & Justin Johnson & Serena Yeung Lecture 11 - 4 May 9, 2019 Supervised vs Unsupervised Learning Supervised Learning Data: (x, y) x is data, y is label Cat Goal: Learn a function to map x -> y Examples: Classification, regression, object detection, Classification semantic segmentation, image captioning, etc. This image is CC0 public domain Fei-Fei Li & Justin Johnson & Serena Yeung Lecture 11 - 5 May 9, 2019 Supervised vs Unsupervised Learning Supervised Learning Data: (x, y) x is data, y is label Goal: Learn a function to map x -> y Examples: Classification, DOG, DOG, CAT regression, object detection, semantic segmentation, image Object Detection captioning, etc. This image is CC0 public domain Fei-Fei Li & Justin Johnson & Serena Yeung Lecture 11 - 6 May 9, 2019 Supervised vs Unsupervised Learning Supervised Learning Data: (x, y) x is data, y is label Goal: Learn a function to map x -> y Examples: Classification, GRASS, CAT, TREE, SKY regression, object detection, semantic segmentation, image Semantic Segmentation captioning, etc.
    [Show full text]
  • Infinite Variational Autoencoder for Semi-Supervised Learning
    Infinite Variational Autoencoder for Semi-Supervised Learning M. Ehsan Abbasnejad Anthony Dick Anton van den Hengel The University of Adelaide {ehsan.abbasnejad, anthony.dick, anton.vandenhengel}@adelaide.edu.au Abstract with whatever labelled data is available to train a discrimi- native model for classification. This paper presents an infinite variational autoencoder We demonstrate that our infinite VAE outperforms both (VAE) whose capacity adapts to suit the input data. This the classical VAE and standard classification methods, par- is achieved using a mixture model where the mixing coef- ticularly when the number of available labelled samples is ficients are modeled by a Dirichlet process, allowing us to small. This is because the infinite VAE is able to more ac- integrate over the coefficients when performing inference. curately capture the distribution of the unlabelled data. It Critically, this then allows us to automatically vary the therefore provides a generative model that allows the dis- number of autoencoders in the mixture based on the data. criminative model, which is trained based on its output, to Experiments show the flexibility of our method, particularly be more effectively learnt using a small number of samples. for semi-supervised learning, where only a small number of The main contribution of this paper is twofold: (1) we training samples are available. provide a Bayesian non-parametric model for combining autoencoders, in particular variational autoencoders. This bridges the gap between non-parametric Bayesian meth- 1. Introduction ods and the deep neural networks; (2) we provide a semi- supervised learning approach that utilizes the infinite mix- The Variational Autoencoder (VAE) [18] is a newly in- ture of autoencoders learned by our model for prediction troduced tool for unsupervised learning of a distribution x x with from a small number of labeled examples.
    [Show full text]
  • Variational Autoencoder for End-To-End Control of Autonomous Driving with Novelty Detection and Training De-Biasing
    Variational Autoencoder for End-to-End Control of Autonomous Driving with Novelty Detection and Training De-biasing Alexander Amini1, Wilko Schwarting1, Guy Rosman2, Brandon Araki1, Sertac Karaman3, Daniela Rus1 Abstract— This paper introduces a new method for end-to- Uncertainty Estimation end training of deep neural networks (DNNs) and evaluates & Novelty Detection it in the context of autonomous driving. DNN training has Uncertainty been shown to result in high accuracy for perception to action Propagate learning given sufficient training data. However, the trained models may fail without warning in situations with insufficient or biased training data. In this paper, we propose and evaluate Encoder a novel architecture for self-supervised learning of latent variables to detect the insufficiently trained situations. Our method also addresses training data imbalance, by learning a set of underlying latent variables that characterize the training Dataset Debiasing data and evaluate potential biases. We show how these latent Weather Adjacent Road Steering distributions can be leveraged to adapt and accelerate the (Snow) Vehicles Surface Control training pipeline by training on only a fraction of the total Command Resampled data dataset. We evaluate our approach on a challenging dataset distribution for driving. The data is collected from a full-scale autonomous Unsupervised Latent vehicle. Our method provides qualitative explanation for the Variables Sample Efficient latent variables learned in the model. Finally, we show how Accelerated Training our model can be additionally trained as an end-to-end con- troller, directly outputting a steering control command for an Fig. 1: Semi-supervised end-to-end control. An encoder autonomous vehicle.
    [Show full text]
  • An Introduction to Variational Autoencoders Full Text Available At
    Full text available at: http://dx.doi.org/10.1561/2200000056 An Introduction to Variational Autoencoders Full text available at: http://dx.doi.org/10.1561/2200000056 Other titles in Foundations and Trends R in Machine Learning Computational Optimal Transport Gabriel Peyre and Marco Cuturi ISBN: 978-1-68083-550-2 An Introduction to Deep Reinforcement Learning Vincent Francois-Lavet, Peter Henderson, Riashat Islam, Marc G. Bellemare and Joelle Pineau ISBN: 978-1-68083-538-0 An Introduction to Wishart Matrix Moments Adrian N. Bishop, Pierre Del Moral and Angele Niclas ISBN: 978-1-68083-506-9 A Tutorial on Thompson Sampling Daniel J. Russo, Benjamin Van Roy, Abbas Kazerouni, Ian Osband and Zheng Wen ISBN: 978-1-68083-470-3 Full text available at: http://dx.doi.org/10.1561/2200000056 An Introduction to Variational Autoencoders Diederik P. Kingma Google [email protected] Max Welling University of Amsterdam Qualcomm [email protected] Boston — Delft Full text available at: http://dx.doi.org/10.1561/2200000056 Foundations and Trends R in Machine Learning Published, sold and distributed by: now Publishers Inc. PO Box 1024 Hanover, MA 02339 United States Tel. +1-781-985-4510 www.nowpublishers.com [email protected] Outside North America: now Publishers Inc. PO Box 179 2600 AD Delft The Netherlands Tel. +31-6-51115274 The preferred citation for this publication is D. P. Kingma and M. Welling. An Introduction to Variational Autoencoders. Foundations and Trends R in Machine Learning, vol. 12, no. 4, pp. 307–392, 2019. ISBN: 978-1-68083-623-3 c 2019 D.
    [Show full text]
  • Exploring Semi-Supervised Variational Autoencoders for Biomedical Relation Extraction
    Exploring Semi-supervised Variational Autoencoders for Biomedical Relation Extraction Yijia Zhanga,b and Zhiyong Lua* a National Center for Biotechnology Information (NCBI), National Library of Medicine (NLM), National Institutes of Health (NIH), Bethesda, Maryland 20894, USA b School of Computer Science and Technology, Dalian University of Technology, Dalian, Liaoning 116023, China Corresponding author: Zhiyong Lu ([email protected]) Abstract The biomedical literature provides a rich source of knowledge such as protein-protein interactions (PPIs), drug-drug interactions (DDIs) and chemical-protein interactions (CPIs). Biomedical relation extraction aims to automatically extract biomedical relations from biomedical text for various biomedical research. State-of-the-art methods for biomedical relation extraction are primarily based on supervised machine learning and therefore depend on (sufficient) labeled data. However, creating large sets of training data is prohibitively expensive and labor-intensive, especially so in biomedicine as domain knowledge is required. In contrast, there is a large amount of unlabeled biomedical text available in PubMed. Hence, computational methods capable of employing unlabeled data to reduce the burden of manual annotation are of particular interest in biomedical relation extraction. We present a novel semi-supervised approach based on variational autoencoder (VAE) for biomedical relation extraction. Our model consists of the following three parts, a classifier, an encoder and a decoder. The classifier is implemented using multi-layer convolutional neural networks (CNNs), and the encoder and decoder are implemented using both bidirectional long short-term memory networks (Bi-LSTMs) and CNNs, respectively. The semi-supervised mechanism allows our model to learn features from both the labeled and unlabeled data.
    [Show full text]
  • Deep Variational Autoencoder: an Efficient Tool for PHM Frameworks
    Deep Variational Autoencoder: An Efficient Tool for PHM Frameworks Ryad Zemouri, Melanie Levesque, Normand Amyot, Claude Hudon, Olivier Kokoko To cite this version: Ryad Zemouri, Melanie Levesque, Normand Amyot, Claude Hudon, Olivier Kokoko. Deep Varia- tional Autoencoder: An Efficient Tool for PHM Frameworks. 2020 Prognostics and Health Man- agement Conference (PHM-Besançon), May 2020, Besancon, France. pp.235-240, 10.1109/PHM- Besancon49106.2020.00046. hal-02868384 HAL Id: hal-02868384 https://hal-cnam.archives-ouvertes.fr/hal-02868384 Submitted on 7 Jul 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Deep Variational Autoencoder: an efficient tool for PHM frameworks. Ryad Zemouri∗,Melanie´ Levesque´ y, Normand Amyoty, Claude Hudony and Olivier Kokokoy ∗Cedric-Lab, CNAM, HESAM universite,´ Paris (France), [email protected] y Institut de Recherche d’Hydro-Quebec´ (IREQ), Varennes, QC, J3X1S1 Canada Abstract—Deep learning (DL) has been recently used in several Variational Autoencoder applications of machine health monitoring systems. Unfortu- nately, most of these DL models are considered as black-boxes with low interpretability. In this research, we propose an original PHM framework based on visual data analysis. The most suitable space dimension for the data visualization is the 2D-space, Encoder Decoder which necessarily involves a significant reduction from a high- dimensional to a low-dimensional data space.
    [Show full text]
  • A Generative Model for Semi-Supervised Learning
    Iowa State University Capstones, Theses and Creative Components Dissertations Fall 2019 A Generative Model for Semi-Supervised Learning Shang Da Follow this and additional works at: https://lib.dr.iastate.edu/creativecomponents Part of the Artificial Intelligence and Robotics Commons Recommended Citation Da, Shang, "A Generative Model for Semi-Supervised Learning" (2019). Creative Components. 382. https://lib.dr.iastate.edu/creativecomponents/382 This Creative Component is brought to you for free and open access by the Iowa State University Capstones, Theses and Dissertations at Iowa State University Digital Repository. It has been accepted for inclusion in Creative Components by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. A Generative Model for Semi-Supervised Learning Shang Da A Creative Component submitted to the graduate faculty in partial fulfillment of the requirements for the degree of Master of Science in Computer Science Program of Study Committee: Dr. Jin Tian, Major Professor Dr. Jia Liu, Committee Member Dr. Wensheng Zhang, Committee Member The student author, whose presentation of the scholarship herein was approved by the program of study committee, is solely responsible for the content of this dissertation. The Graduate College will ensure this dissertation is globally accessible and will not permit alterations after a degree is conferred. Iowa State University Ames, Iowa 2019 Copyright © Cy Cardinal, 2019. All rights reserved. ii TABLE
    [Show full text]
  • Latent Property State Abstraction for Reinforcement Learning
    Latent Property State Abstraction For Reinforcement learning John Burden Sajjad Kamali Siahroudi Daniel Kudenko Centre for the Study Of Existential L3S Research Center L3S Research Center Risk Hanover Hanover University of Cambridge [email protected] [email protected] [email protected] ABSTRACT the construction of RS functions. This would allow for reaping the Potential Based Reward Shaping has proven itself to be an effective benefits of reward shaping without the onus of manually encoding method for improving the learning rate for Reinforcement Learning domain knowledge or abstract tasks. algorithms — especially when the potential function is derived Our main contribution is a novel RL technique, called Latent from the solution to an Abstract Markov Decision Process (AMDP) Property State Abstraction (LPSA) that creates its own intrinsic encapsulating an abstraction of the desired task. The provenance reward function for use with reward shaping which can speed of the AMDP is often a domain expert. In this paper we introduce up the learning process of Deep RL algorithms. In our work we a novel method for the full automation of creating and solving an demonstrate this speed-up on the widely popular DQN algorithm AMDP to induce a potential function. We then show empirically [13]. Our method works by learning its own abstract representation that the potential function our method creates improves the sample of environment states using an auto-encoder. Then it learns an efficiency of DQN in the domain in which we test our approach. abstract value function over the environment before utilising this to increase the learning rate on the ground level of the domain KEYWORDS using reward shaping.
    [Show full text]