The results support the common principle that explicit regulation of neuron utilization and effective connectivity can improve the emergence of generalizable internal computation and motivate broader investigation of biologically inspired activity regulation and adaptive sparsification, including in large language models.
Abstract
Grokking is a delayed transition from memorization to generalization that is often accompanied by substantial reorganization of internal representations. This paper studies whether biologically inspired mechanisms, many of which are not commonly incorporated into artificial neural networks, can actively promote this transition by regulating hidden-layer computation at the levels of neuronal activity, response, and effective connectivity. We augment a multilayer perceptron with input gating, structural plasticity, gain modulation, threshold modulation, homeostasis, lateral inhibition, and activation decorrelation, and evaluate these mechanisms through systematic ablations on two established grokking benchmarks: sparse parity and noisy XOR classification. The results show that the mechanisms contribute unequally to generalization. Homeostasis provides the strongest and most consistent benefit, while structural sparsification emerges as the second major mechanism. The remaining biologically inspired mechanisms have smaller or less consistent effects in the present experiments. For both problems, the results support the common principle that explicit regulation of neuron utilization and effective connectivity can improve the emergence of generalizable internal computation. These findings motivate broader investigation of biologically inspired activity regulation and adaptive sparsification, including in large language models, where they may accelerate the development of generalizable representations and reduce the optimization time required for robust generalization.
This work introduces a biologically motivated neural architecture in which both neural activations and learning signals are represented by non-negative activity, and synapses have fixed sign, while still supporting backpropagation-like learning.
An artificial neural manifold based on Mott memristors is constructed, enabling accurate and robust prediction while reducing the number of required samples, and a memory factor is introduced to modify the STI equation, which improves prediction accuracy and robustness.
Rui Wang, Guo-Lei Liu, Sai-Sai Wang et al.· Nature Communications· 0 citations
A Decomposable Spiking Neural Network (D-SNN) is reported that eliminates global synaptic entanglement by structurally isolating classification pathways into independent experts, establishing an efficient foundation for deploying deterministic neuromorphic intelligence in resource-constrained edge environments.
Maksim Bazhenov, S. Grubas, V. Putkaradze· 0 citations
This work introduces Meta Neural Cellular Automata (MetaNCA), a framework that learns local rules which self-organize the weights of artificial neural networks, and shows that MetaNCA generalizes to architectures not seen during meta-training, and that architectural diversity in the training phase strengthens this gene...
Meet Barot, Daniel Berenberg, Sina Khajehabdollahi· IEEE Symposium on Artificial...· 0 citations
It is found that dimensionality collapse consistently precedes the onset of grokking in all evaluated settings, and Geometric Dimensionality Regularization (GeomDR), a simple spectral regularizer that modifies the effective dimensionality of hidden representations during training is introduced.
It is shown that GABA co-release is sufficient to produce temporal difference (TD)-like transformations of input activity, computations commonly used for reinforcement learning and behavioral optimization, and evolutionary expansion of glutamate/GABA co-release expanded across vertebrate evolution.
Natalia Rodríguez-Sosa, Lupita Rios, You-Hsin Lin et al.· bioRxiv· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 15, 2026
A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.
Microsoft Research Blog· microsoft.comOct 15, 2026
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.