Pith. Sign in

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.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1403.7752 (version 2)
Pith IDYQB35J7O, Pith's permanent record of this paper and its review
CitationYann Ollivier. "Auto-encoders: reconstruction versus compression." arXiv:1403.7752 (2014). https://pith.science/paper/YQB35J7O
Claim paper

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

Compiled by classifier-1.13-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 3,683 input tokens, $0.0002 reported.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.28 · human participants 0.02 · controlled comparison 0.18 · randomized assignment 0.01 · states quantitative result 0.04 · compares with prior results 0.90 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v2. Results and the main claim are underlined; .

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

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
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 kind of paper the classifier reports this is: theoretical result 0.99 · evidence from proof or derivation 0.79.

What was examined, and what was not

sources read
  • arXiv listing abstract v2
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

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

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

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.