Extracting and composing robust features with denoising autoencoders

  title={Extracting and composing robust features with denoising autoencoders},
  author={Pascal Vincent and H. Larochelle and Yoshua Bengio and Pierre-Antoine Manzagol},
  booktitle={ICML '08},
Previous work has shown that the difficulties in learning deep generative or discriminative models can be overcome by an initial unsupervised learning step that maps inputs to useful intermediate representations. [] Key Method This approach can be used to train autoencoders, and these denoising autoencoders can be stacked to initialize deep architectures. The algorithm can be motivated from a manifold learning and information theoretic perspective or from a generative model perspective. Comparative…

Figures and Tables from this paper

A New Training Principle for Stacked Denoising Autoencoders

A new training principle is introduced for unsupervised learning that makes the learned representations more efficient and useful and can obtain more robust and representative pattern of inputs than the traditional learning methods.

Improving Deep Learning Accuracy with Noisy Autoencoders Embedded Perturbative Layers

A new training principle is presented based on denoising autoencoder and dropout training method that significantly improves learning accuracy when conducting classification experiments on benchmark data sets.

Scheduled denoising autoencoders

A representation learning method that learns features at multiple different levels of scale that yields a significant boost on a later supervised task compared to the original input, or to a standard denoising autoencoder trained at a single noise level.

Stacked Denoising Autoencoders: Learning Useful Representations in a Deep Network with a Local Denoising Criterion

This work clearly establishes the value of using a denoising criterion as a tractable unsupervised objective to guide the learning of useful higher level representations.

Representation Learning with Smooth Autoencoder

A novel autoencoder variant, smooth autoenCoder (SmAE), to learn robust and discriminative feature representations that are consistent among local neighbors and robust to small variations of the inputs is proposed.

Composite Denoising Autoencoders

This work introduces a novel cascaded training procedure which is designed to avoid types of bad solutions that are specific to CDAs, and shows that CDAs learn effective representations on two different image data sets.

A Stacked Denoising Autoencoder Based on Supervised Pre-training

The pre-training phase of the stacked denoising autoencoder was changed from unsupervised learning to supervised learning, which can improve the accuracy of the small sample prediction problem.

Discriminative Representation Learning with Supervised Auto-encoder

A supervised auto-encoder is introduced that combines the reconstruction error and the classification error to form a unified objective function while taking the noisy concatenate data and label as input and demonstrates that the model outperforms many existing learning algorithms.

Semi Supervised Autoencoders: Better Focusing Model Capacity during Feature Extraction

This paper addresses one of the limitations when using unsupervised models like regularized autoencoders to learn features that they hope to be useful for a subsequent supervised task, namely their blindness to that specific task.

Denoising auto-encoders toward robust unsupervised feature representation

A robust deep neural network, named as stacked convolutional denoising auto-encoders (SCDAE), which can map raw images to hierarchical representations in an unsupervised manner and demonstrates superior performance to the state-of-the-art unsuper supervised networks.



Sparse Feature Learning for Deep Belief Networks

This work proposes a simple criterion to compare and select different unsupervised machines based on the trade-off between the reconstruction error and the information content of the representation, and describes a novel and efficient algorithm to learn sparse representations.

Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries

This work addresses the image denoising problem, where zero-mean white and homogeneous Gaussian additive noise is to be removed from a given image, and uses the K-SVD algorithm to obtain a dictionary that describes the image content effectively.

Efficient Learning of Sparse Representations with an Energy-Based Model

A novel unsupervised method for learning sparse, overcomplete features using a linear encoder, and a linear decoder preceded by a sparsifying non-linearity that turns a code vector into a quasi-binary sparse code vector.

Training with Noise is Equivalent to Tikhonov Regularization

This paper shows that for the purposes of network training, the regularization term can be reduced to a positive semi-definite form that involves only first derivatives of the network mapping.

Reducing the Dimensionality of Data with Neural Networks

This work describes an effective way of initializing the weights that allows deep autoencoder networks to learn low-dimensional codes that work much better than principal components analysis as a tool to reduce the dimensionality of data.

An empirical evaluation of deep architectures on problems with many factors of variation

A series of experiments indicate that these models with deep architectures show promise in solving harder learning problems that exhibit many factors of variation.

Fields of Experts: a framework for learning image priors

  • S. RothMichael J. Black
  • Computer Science
    2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05)
  • 2005
A framework for learning generic, expressive image priors that capture the statistics of natural scenes and can be used for a variety of machine vision tasks, developed using a Products-of-Experts framework.

Greedy Layer-Wise Training of Deep Networks

These experiments confirm the hypothesis that the greedy layer-wise unsupervised training strategy mostly helps the optimization, by initializing weights in a region near a good local minimum, giving rise to internal distributed representations that are high-level abstractions of the input, bringing better generalization.

A Fast Learning Algorithm for Deep Belief Nets

A fast, greedy algorithm is derived that can learn deep, directed belief networks one layer at a time, provided the top two layers form an undirected associative memory.

A Machine Learning Framework for Adaptive Combination of Signal Denoising Methods

A general framework for combination of two distinct local denoising methods controlled by a spatially varying decision function is presented, yielding a "hybrid" Denoising algorithm whose performance surpasses that of either initial method.