Maximum Entropy Auto-Encoding
Paul M Baggenstoss

TL;DR
This paper introduces a maximum entropy auto-encoder that uses optimal reconstruction for improved performance, demonstrating significant error reduction over conventional auto-encoders, especially in shallow networks.
Contribution
It proposes the deterministic projected belief network (D-PBN) with special non-linearities for optimal reconstruction, extending maximum entropy principles to multi-layer auto-encoders.
Findings
Mean square error reduced by up to 50%.
Performance gains diminish with deeper networks.
Method is most effective with constrained input data.
Abstract
In this paper, it is shown that an auto-encoder using optimal reconstruction significantly outperforms a conventional auto-encoder. Optimal reconstruction uses the conditional mean of the input given the features, under a maximum entropy prior distribution. The optimal reconstruction network, which is called deterministic projected belied network (D-PBN), resembles a standard reconstruction network, but with special non-linearities that mist be iteratively solved. The method, which can be seen as a generalization of maximum entropy image reconstruction, extends to multiple layers. In experiments, mean square reconstruction error reduced by up to a factor of two. The performance improvement diminishes for deeper networks, or for input data with unconstrained values (Gaussian assumption).
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.
Taxonomy
TopicsGenerative Adversarial Networks and Image Synthesis · Image and Signal Denoising Methods · Advanced Image Processing Techniques
