Learning Representations by Maximizing Compression

By Karol Gregor, Yann LeCun. 2011

17 citations recorded by the source corpus.

We give an algorithm that learns a representation of data through compression. The algorithm 1) predicts bits sequentially from those previously seen and 2) has a structure and a number of computations similar to an autoencoder. The likelihood under the model can be calculated exactly, and arithmetic coding can be used directly for compression. When training on digits the algorithm learns filters similar to those of restricted boltzman machines and denoising autoencoders. Independent samples can be drawn from the model by a single sweep through the pixels. The algorithm has a good compression performance when compared to other methods that work under random ordering of pixels.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Representation & Self-Supervised Learning, Signal Processing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Yoshua Bengio
  2. Sergey Levine
  3. Ruslan Salakhutdinov
  4. Max Welling
  5. Quoc V. Le
  6. Kyunghyun Cho
  7. Pieter Abbeel
  8. Mohit Bansal

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Dacheng Tao
  3. Trevor Darrell
  4. Yoshua Bengio
  5. Ming-Hsuan Yang
  6. Xiaogang Wang
  7. Jitendra Malik
  8. Andrew Zisserman

In Representation & Self-Supervised Learning

  1. Benigno Uria
  2. Yoshua Bengio
  3. Hugo Larochelle
  4. Karol Gregor
  5. Iain Murray
  6. Ivo Danihelka
  7. Daan Wierstra
  8. Oren Rippel

In Signal Processing

  1. Benigno Uria
  2. Hugo Larochelle
  3. Karol Gregor
  4. Iain Murray
  5. Daan Wierstra
  6. Andriy Mnih
  7. Charles Blundell
  8. Oren Rippel

Citations in the corpus