Coarse-Graining Hidden Representations: Unsupervised Neuron Selection via Mapping Entropy

• URL: http://arxiv.org/abs/2609.05126v1
• Date: Fri, 04 Sep 2026 13:25:58 GMT
• Title: Coarse-Graining Hidden Representations: Unsupervised Neuron Selection via Mapping Entropy
• Abstract summary: In teacher-student networks, ME recovers the minimal teacher-consistent representation and retains extra units.<n>In a non-linear Gaussian process task, ME selects coherent functional-class mappings whose preferred class shifts across training.<n>On this task and on translation-augmented MNIST, ME-selectedworks outperform random subsets of equal size.
• Score: 37.56003520528009
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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 by retaining a subset of its neurons, and score each putative selection by the mapping entropy (ME). This quantity measures the loss of discriminatory power inherent in discarding part of the network neurons, and the selection that minimises the ME is taken as particularly informative. This criterion is fully unsupervised, in that it depends only on hidden-activation statistics. In teacher-student networks, ME optimisation recovers the minimal teacher-consistent representation and retains extra units in proportion to the hidden layer's residual variability; in a non-linear Gaussian process task, it selects coherent functional-class mappings whose preferred class shifts across training. On this task and on translation-augmented MNIST, ME-selected subnetworks outperform random subsets of equal size, most clearly under strong compression - linking configurational distinguishability to predictive performance.

Related papers

• Sparse Inter-Layer Dependencies of Transformer FFN Neurons [32.00544060412007]
  We study whether the activation of an FFN neuron can be explained by a sparse set of preceding neuron activations and attention outputs.<n>We introduce a training-free attribution method that estimates the relative influence of upstream neurons and attention outputs on a target neuron's activation.
  arXiv  Detail & Related papers  (2026-07-13T15:04:50Z)
• Optimization of randomized neural networks for transfer operator approximation [0.5027571997864707]
  RaNNDy is a randomized neural network architecture for the data-driven approximation of transfer operators.<n>The weights and biases of the hidden layers of the network are randomly and kept fixed, only the output layer is trained.<n>This has several advantages over fully optimized neural networks, notably a closed-form solution for the output layer.
  arXiv  Detail & Related papers  (2026-05-22T14:47:17Z)
• Unveiling the Power of Sparse Neural Networks for Feature Selection [60.50319755984697]
  Sparse Neural Networks (SNNs) have emerged as powerful tools for efficient feature selection. We show that SNNs trained with dynamic sparse training (DST) algorithms can achieve, on average, more than $50%$ memory and $55%$ FLOPs reduction. Our findings show that feature selection with SNNs trained with DST algorithms can achieve, on average, more than $50%$ memory and $55%$ FLOPs reduction.
  arXiv  Detail & Related papers  (2024-08-08T16:48:33Z)
• Coding schemes in neural networks learning classification tasks [52.22978725954347]
  We investigate fully-connected, wide neural networks learning classification tasks. We show that the networks acquire strong, data-dependent features. Surprisingly, the nature of the internal representations depends crucially on the neuronal nonlinearity.
  arXiv  Detail & Related papers  (2024-06-24T14:50:05Z)
• Much Easier Said Than Done: Falsifying the Causal Relevance of Linear Decoding Methods [1.3999481573773074]
  Linear classifier probes identify highly selective units as the most important for network function. In spite of the absence of ablation effects for selective neurons, linear decoding methods can be effectively used to interpret network function. More specifically, we find that an interaction between selectivity and the average activity of the unit better predicts ablation performance deficits for groups of units in AlexNet, VGG16, MobileNetV2, and ResNet101.
  arXiv  Detail & Related papers  (2022-11-08T16:43:02Z)
• Redundant representations help generalization in wide neural networks [71.38860635025907]
  We study the last hidden layer representations of various state-of-the-art convolutional neural networks. We find that if the last hidden representation is wide enough, its neurons tend to split into groups that carry identical information, and differ from each other only by statistically independent noise.
  arXiv  Detail & Related papers  (2021-06-07T10:18:54Z)
• And/or trade-off in artificial neurons: impact on adversarial robustness [91.3755431537592]
  Presence of sufficient number of OR-like neurons in a network can lead to classification brittleness and increased vulnerability to adversarial attacks. We define AND-like neurons and propose measures to increase their proportion in the network. Experimental results on the MNIST dataset suggest that our approach holds promise as a direction for further exploration.
  arXiv  Detail & Related papers  (2021-02-15T08:19:05Z)
• Self-Organized Operational Neural Networks with Generative Neurons [87.32169414230822]
  ONNs are heterogenous networks with a generalized neuron model that can encapsulate any set of non-linear operators. We propose Self-organized ONNs (Self-ONNs) with generative neurons that have the ability to adapt (optimize) the nodal operator of each connection.
  arXiv  Detail & Related papers  (2020-04-24T14:37:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.