RECORD
Auto-encoders: reconstruction versus compression
Neural and Evolutionary Computing · Submitted 30 Mar 2014
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim Minimizing a codelength for the data using an auto-encoder is equivalent to minimizing the reconstruction error plus some correcting terms which have an interpretation as either a denoising or contractive property of the decoding function.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
We discuss the similarities and differences between training an auto-encoder to minimize the reconstruction error, and training the same auto-encoder to compress the data via a generative model. Minimizing a codelength for the data using an auto-encoder is equivalent to minimizing the reconstruction error plus some correcting terms which have an interpretation as either a denoising or contractive property of the decoding function. These terms are related but not identical to those used in denoising or contractive auto-encoders [Vincent et al. 2010, Rifai et al. 2011]. In particular, the codelength viewpoint fully determines an optimal noise level for the denoising criterion.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | We discuss the similarities and differences between training an auto-encoder to minimize the reconstruction error, and training the same auto-encoder to compress the data via a generative model. | contribution 0.86 | 0.44 | 0.09 | unclear 0.67 |
| s1 | Minimizing a codelength for the data using an auto-encoder is equivalent to minimizing the reconstruction error plus some correcting terms which have an interpretation as either a denoising or contractive property of the decoding function. | result 0.93 | 0.72 | 0.65 | asserted 1.00 |
| s2 | These terms are related but not identical to those used in denoising or contractive auto-encoders [Vincent et al. 2010, Rifai et al. 2011]. | result 0.46 | 0.26 | 0.09 | asserted 1.00 |
| s3 | In particular, the codelength viewpoint fully determines an optimal noise level for the denoising criterion. | result 0.89 | 0.75 | 0.32 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v2
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
We discuss the similarities and differences between training an auto-encoder to minimize the reconstruction error, and training the same auto-encoder to compress the data via a generative model. Minimizing a codelength for the data using an auto-encoder is equivalent to minimizing the reconstruction error plus some correcting terms which have an interpretation as either a denoising or contractive property of the decoding function. These terms are related but not identical to those used in denoising or contractive auto-encoders [Vincent et al. 2010, Rifai et al. 2011]. In particular, the codelength viewpoint fully determines an optimal noise level for the denoising criterion.
Human review
References
How the literature uses it
5 arXiv papers cite this in 5 sentences
Papers citing it · 3 sentences without a confident label
Cites it as background 2 papers
-
The idea that probabilistic models can be used to efficiently compress data is a topic widely studied in machine learning across different modalities and settings [ref] , specifically in sequence modeling [ref] due to its close similarities to prequential coding [ref] .
In-context learning and Occam's razor · Related Work · 0.97
-
In unsupervised learning, autoencoders and especially variational autoencoders [ref] are compression methods of the data [ref] .
The Description Length of Deep Learning Models · Introduction · 0.83
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.