A manifold learning perspective on representation learning: Learning decoder and representations without an encoder
Viktoria Schuster, Anders Krogh

TL;DR
This paper proposes a novel perspective on autoencoders by training only the decoder as a manifold learning problem, leading to better representations especially with small datasets.
Contribution
It introduces a method to train the decoder independently of the encoder, providing theoretical insights and demonstrating improved representation learning on image and gene data.
Findings
Decoder requires fewer samples to be well-specified than encoder.
Training only the decoder yields better low-dimensional representations on small datasets.
The approach enhances generalization and interpretability of learned representations.
Abstract
Autoencoders are commonly used in representation learning. They consist of an encoder and a decoder, which provide a straightforward way to map n-dimensional data in input space to a lower m-dimensional representation space and back. The decoder itself defines an m-dimensional manifold in input space. Inspired by manifold learning, we show that the decoder can be trained on its own by learning the representations of the training samples along with the decoder weights using gradient descent. A sum-of-squares loss then corresponds to optimizing the manifold to have the smallest Euclidean distance to the training samples, and similarly for other loss functions. We derive expressions for the number of samples needed to specify the encoder and decoder and show that the decoder generally requires much less training samples to be well-specified compared to the encoder. We discuss training of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
