MLLGCONov 4, 2016

Information Dropout: Learning Optimal Representations Through Noisy Computation

arXiv:1611.01353v3453 citations
Originality Incremental advance
AI Analysis

This work addresses the challenge of learning optimal representations in deep learning, offering a method that adapts noise automatically, but it is incremental as it builds on existing dropout and variational autoencoder concepts.

The paper tackles the problem that cross-entropy loss in deep learning does not enforce key properties of optimal representations, and shows that adding a regularization term related to injecting multiplicative noise improves generalization, achieving comparable or better performance than binary dropout, especially on smaller models.

The cross-entropy loss commonly used in deep learning is closely related to the defining properties of optimal representations, but does not enforce some of the key properties. We show that this can be solved by adding a regularization term, which is in turn related to injecting multiplicative noise in the activations of a Deep Neural Network, a special case of which is the common practice of dropout. We show that our regularized loss function can be efficiently minimized using Information Dropout, a generalization of dropout rooted in information theoretic principles that automatically adapts to the data and can better exploit architectures of limited capacity. When the task is the reconstruction of the input, we show that our loss function yields a Variational Autoencoder as a special case, thus providing a link between representation learning, information theory and variational inference. Finally, we prove that we can promote the creation of disentangled representations simply by enforcing a factorized prior, a fact that has been observed empirically in recent work. Our experiments validate the theoretical intuitions behind our method, and we find that information dropout achieves a comparable or better generalization performance than binary dropout, especially on smaller models, since it can automatically adapt the noise to the structure of the network, as well as to the test sample.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes