Deep Learning of Nonnegativity-Constrained Autoencoders for Enhanced Understanding of Data
Babajide O. Ayinde, Jacek M. Zurada

TL;DR
This paper introduces a nonnegativity-constrained autoencoder that improves interpretability and sparsity of features with minimal accuracy loss, enhancing understanding of deep data representations.
Contribution
It proposes a novel regularization approach using L1 and L2 to enforce nonnegativity in autoencoders, making learned features more interpretable and sparse.
Findings
Features are more sparse and interpretable.
Classification accuracy is minimally affected.
Enhanced feature sparsity observed across datasets.
Abstract
Unsupervised feature extractors are known to perform an efficient and discriminative representation of data. Insight into the mappings they perform and human ability to understand them, however, remain very limited. This is especially prominent when multilayer deep learning architectures are used. This paper demonstrates how to remove these bottlenecks within the architecture of Nonnegativity Constrained Autoencoder (NCSAE). It is shown that by using both L1 and L2 regularization that induce nonnegativity of weights, most of the weights in the network become constrained to be nonnegative thereby resulting into a more understandable structure with minute deterioration in classification accuracy. Also, this proposed approach extracts features that are more sparse and produces additional output layer sparsification. The method is analyzed for accuracy and feature interpretation on the…
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
MethodsSolana Customer Service Number +1-833-534-1729
