It is shown that layer-wise generative learning can spontaneously uncover and progressively amplify class-related structure in unlabeled data and improve average clustering can coexist with reduced accessibility for a few difficult class pairs.
Abstract
Deep Belief Networks (DBNs) learn hierarchical generative models without class supervision. Here, we ask whether this purely unsupervised process nevertheless organizes internal representations according to the unknown data classes. We analyze successive layers of DBNs trained on MNIST, Fashion-MNIST, and KMNIST using the Generalized Discrimination Value (GDV), supervised probes applied only after training, a reconstruction-based measure of abstraction distance, effective dimensionality, and free sample generation. Remarkably, class-specific clustering generally increases with depth across datasets and network widths, although no label information is available during DBN training. Control experiments show that this effect depends on the learned feature structure and cannot be explained by random transformations, weight marginals, dimensionality reduction, or sigmoid saturation. The first hidden layers also frequently make class identity more accessible to linear and nonlinear probes. With greater depth, representations become increasingly compact and prototype-like as neurons acquire correlated feature directions. At the same time, GDV and probe accuracy reveal complementary aspects of class structure: improved average clustering can coexist with reduced accessibility for a few difficult class pairs. These findings demonstrate that layer-wise generative learning can spontaneously uncover and progressively amplify class-related structure in unlabeled data.
Overparameterized neural networks carry far more hidden units than a task nominally requires, raising the question of which neurons are essential and whether that distinction is legible in the representation itself, without labels or gradients. We cast neuron selection as the problem of coarse-graining the hidden layer...
Margherita Mele, Andrea Castagna, R. Menichetti et al.· 0 citations
A boundary-first inference schedule that partitions a model into chunks, first coordinates hidden states at chunk boundaries, and then refines representations within each chunk is proposed, which instantiate in predictive coding networks (PCNs), a local-learning framework in which hidden activities and prediction error...
In this work, we investigate whether the latent representations learned by a Deep Belief Network (DBN) and a Bidirectional Gated Recurrent Unit (Bi-GRU) can discriminate among four dynamically distinct trajectory types in the three-state majority vote model (MV3): approach from disorder, approach from order, departure...
This work proposes an NC-inspired training framework for simplifying deep networks during training, monitoring representation dynamics through the Inverse Fisher Criterion to identify both the split point between feature extraction and classification and the training stage at which simplification becomes viable.
Lorenzo Sciandra, Samuele Fonio, Roberto Esposito· arXiv.org· 0 citations
Extensive experiments conducted on UCI and KEEL benchmark datasets demonstrate the superiority of the proposed IF-dRVFL and IF-edRVFL models over existing SOTA fuzzy and non-fuzzy approaches.
M. Sajid, A. Quadir, A. Rahaman et al.· 0 citations
The Stable Reaction-Diffusion encoder (SRD) provides a trajectory-stabilizing forward evolution mechanism that explicitly controls propagation drift and finite-depth sensitivity, rather than simply stacking additional message-passing layers.
Jia-Jun Lin, Yuxin Tian, Li Feng et al.· Neural Networks· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.