Deep Learning of Nonnegativity-Constrained Autoencoders for Enhanced Understanding of Data
Not on the map. Why?
Abstract (arXiv)
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 MNIST data, the NORB normalized uniform object data, and the Reuters text categorization dataset.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 31 Jan 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2; 2023: 2; 2024: 1; 2025: 0; 2026: 2.
9 papers.
- 2022Modeling Content Creator Incentives on Algorithm-Curated Platformscited by 35
- 2021Fixed points of nonnegative neural networkscited by 5
- 2021The Impact of Activation Sparsity on Overfitting in Convolutional Neural Networkscited by 3
- 2023Multiplicative update rules for accelerating deep learning training and increasing robustnesscited by 1
- 2022Fixed Points of Cone Mapping with the Application to Neural Networkscited by 0
- 2023Non-negative isomorphic neural networks for photonic neuromorphic acceleratorscited by 0
- 2024Using Part-based Representations for Explainable Deep Reinforcement Learningcited by 0
- 2026Hidden Monotonicity: Explaining Deep Neural Networks via their DC Decompositioncited by 0
- 2026Soft-Constrained Optimization of Latent Space in Variational Autoencoderscited by 0
- 2026Soft-Constrained Optimization of Latent Space in Variational Autoencoders26 Jul 2026
- 2026Hidden Monotonicity: Explaining Deep Neural Networks via their DC Decomposition12 Jan 2026
- 2024Using Part-based Representations for Explainable Deep Reinforcement Learning21 Aug 2024
- 2023Non-negative isomorphic neural networks for photonic neuromorphic accelerators2 Oct 2023
- 2023Multiplicative update rules for accelerating deep learning training and increasing robustness14 Jul 2023
- 2022Fixed Points of Cone Mapping with the Application to Neural Networks20 Jul 2022
- 2022Modeling Content Creator Incentives on Algorithm-Curated Platforms27 Jun 2022
- 2021Fixed points of nonnegative neural networks30 Jun 2021
- 2021The Impact of Activation Sparsity on Overfitting in Convolutional Neural Networks13 Apr 2021