mlsanityData to 7 Oct 2026

Isotropic Activation Functions Enable Deindividuated Neurons and Adaptive Topologies

arXiv 2602.23405 ↗First posted 26 Feb 2026cs.NE cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Introduced is a methodology for adapting the topology of dense neural networks, enabled by isotropic activation functions. Achieved through prescribed reparameterisation symmetries and singular-value decomposition of affine maps, this diagonalises layers into one-to-one, ordered connections. This makes it simpler to assess the impact of individual connections on the function. Low-impact neurons can be removed (neurodegeneration), and a thresholded buffer of largely inactive 'scaffold' neurons is maintained (neurogenesis). These symmetry-led diagonalisation and structural changes are function-invariant, demonstrated to be computationally identical during neurogenesis, arbitrarily well approximated during neurodegeneration, and enable asymptotic 50% parameter sparsification of dense networks with identically preserved function. Thus, real-time restructuring of the architecture in response to task demands, task appending, removal or changes is shown. The approach is conceptually centred on primitive symmetry-prescriptions, through which isotropic functions are derived that feature explicit basis independence and a loss in the individuation of neurons implicit in typical elementwise functional forms. Hence, this allows freedom in the basis to which layers are decomposed and interpreted as individual artificial neurons, directly enabling this adaptive topology approach. Additionally, a new tunable model parameter, the 'intrinsic length', is introduced to improve this analytical invariance, alongside a generalised isotropic-perceptron architecture that enables parallel precomputation of all matrix-vector products and displays a nested functional class. Diagonalisation is suggested to offer new possibilities for interpretability and monitoring of isotropic networks.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 20 of its 55 references that are in the map. First posted on arXiv 26 Feb 2026.

Builds on

20 of 55 references.

References · 20

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
  3. 2016Layer Normalizationcited by 5,579
  4. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  5. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  6. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  7. 2019Root Mean Square Layer Normalizationcited by 1,425
  8. 2022Toy Models of Superpositioncited by 928
  9. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  10. 2017Network Dissection: Quantifying Interpretability of Deep Visual Representationscited by 703
  11. 2017Dynamic Routing Between Capsulescited by 689
  12. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
8 more
  1. 2015Net2Net: Accelerating Learning via Knowledge Transfercited by 245
  2. 2016Dynamic Network Surgery for Efficient DNNscited by 233
  3. 2016Network Morphismcited by 63
  4. 2022On the Symmetries of Deep Learning Models and their Internal Representationscited by 63
  5. 2024The Empirical Impact of Neural Parameter Symmetries, or Lack Thereofcited by 21
  6. 2015Understanding symmetries in deep networkscited by 17
  7. 2025The Spotlight Resonance Method: Resolving the Alignment of Embedded Activationscited by 3
  8. 2025Emergence of Quantised Representations Isolated to Anisotropic Functionscited by 2

Built on by

Not cited yet.