Unsupervised Feature Learning Via Encoder Decoder Reconstruction

via “multi-scale-feature-fusion-with-linear-decoder”

image-segmentation model by undefined. 63,104 downloads.

Unique: Replaces dense convolutional decoders with simple linear projections and concatenation — reduces decoder parameters from ~10M (DeepLabV3+) to <1M while maintaining mIoU through reliance on strong transformer encoder features. Bilinear upsampling to 1/4 resolution (128×128) before fusion balances memory efficiency with spatial detail preservation.

vs others: 3-5x faster decoder inference than DeepLabV3+ with 90% fewer parameters, at the cost of less learnable spatial refinement — trades decoder flexibility for encoder quality and overall efficiency.

via “unsupervised feature learning via encoder-decoder reconstruction”

* 🏆 2014: [Generative Adversarial Networks (GAN)](https://papers.nips.cc/paper/2014/hash/5ca3e9b122f61f8f06494c97b1afccf3-Abstract.html)

Unique: Combines reconstruction loss with a probabilistic regularizer (KL divergence to prior) to learn latent representations that are both faithful to data and well-behaved for generation. Unlike standard autoencoders, the KL term ensures the latent distribution matches a simple prior (e.g., standard Gaussian), enabling principled sampling for generation. The probabilistic framing provides a principled way to balance compression and reconstruction fidelity through the ELBO objective.

vs others: Produces more interpretable and generative latent spaces than standard autoencoders because the KL regularizer prevents posterior collapse and encourages the latent distribution to match a tractable prior; enables both reconstruction and generation tasks, whereas PCA or standard autoencoders excel at only one.