Table of Contents
Fetching ...

Neuronal Group Communication for Efficient Neural representation

Zhengqi Pei, Qingming Huang, Shuhui Wang

TL;DR

This paper introduces Neuronal Group Communication (NGC), a framework that reinterprets large neural networks as dynamical systems of interacting neuronal groups, with weights represented by low-rank interactions between embedding-like neuronal states $A$ and $B$ such that $W\approx AB^T$. It formalizes intra- and inter-group communication through a policy that yields a globally contractive, yet externally driven, dynamic system, and defines a Lyapunov-like neuronal stability score to quantify reasoning capability. The methodology includes initializing neuronal states via SVD, enforcing inter-group state sharing, and training only the neuronal states under a stability-regularized objective, enabling substantial compression with improved reasoning benchmarks on open-source LLMs. Empirically, NGC outperforms SVD-based and Basis Sharing baselines at similar compression ratios across multiple tasks, with ablations showing benefits from symmetric, learnable interaction metrics and higher effective latent dimensions. Beyond performance, NGC offers interpretability by exposing modular neuron groups and their communications, linking stability, geometry of state-space, and emergent reasoning to a principled dynamical framework with potential broad applicability to AI systems and cognitive-inspired architectures.

Abstract

The ever-increasing scale of modern neural networks has brought unprecedented performance alongside daunting challenges in efficiency and interpretability. This paper addresses the core question of how to build large neural systems that learn efficient, modular, and interpretable representations. We propose Neuronal Group Communication (NGC), a theory-driven framework that reimagines a neural network as a dynamical system of interacting neuronal groups rather than a monolithic collection of neural weights. Instead of treating each weight as an independent trainable parameter, NGC treats weights as transient interactions between embedding-like neuronal states, with neural computation unfolding through iterative communication among groups of neurons. This low-rank, modular representation yields compact models: groups of neurons exchange low-dimensional signals, enabling intra-group specialization and inter-group information sharing while dramatically reducing redundant parameters. By drawing on dynamical systems theory, we introduce a neuronal stability metric (analogous to Lyapunov stability) that quantifies the contraction of neuron activations toward stable patterns during sequence processing. Using this metric, we reveal that emergent reasoning capabilities correspond to an external driving force or ``potential'', which nudges the neural dynamics away from trivial trajectories while preserving stability. Empirically, we instantiate NGC in large language models (LLMs) and demonstrate improved performance on complex reasoning benchmarks under moderate compression. NGC consistently outperforms standard low-rank approximations and cross-layer basis-sharing methods at comparable compression rates. We conclude by discussing the broader implications of NGC, including how structured neuronal group dynamics might relate to generalization in high-dimensional learning systems.

Neuronal Group Communication for Efficient Neural representation

TL;DR

This paper introduces Neuronal Group Communication (NGC), a framework that reinterprets large neural networks as dynamical systems of interacting neuronal groups, with weights represented by low-rank interactions between embedding-like neuronal states and such that . It formalizes intra- and inter-group communication through a policy that yields a globally contractive, yet externally driven, dynamic system, and defines a Lyapunov-like neuronal stability score to quantify reasoning capability. The methodology includes initializing neuronal states via SVD, enforcing inter-group state sharing, and training only the neuronal states under a stability-regularized objective, enabling substantial compression with improved reasoning benchmarks on open-source LLMs. Empirically, NGC outperforms SVD-based and Basis Sharing baselines at similar compression ratios across multiple tasks, with ablations showing benefits from symmetric, learnable interaction metrics and higher effective latent dimensions. Beyond performance, NGC offers interpretability by exposing modular neuron groups and their communications, linking stability, geometry of state-space, and emergent reasoning to a principled dynamical framework with potential broad applicability to AI systems and cognitive-inspired architectures.

Abstract

The ever-increasing scale of modern neural networks has brought unprecedented performance alongside daunting challenges in efficiency and interpretability. This paper addresses the core question of how to build large neural systems that learn efficient, modular, and interpretable representations. We propose Neuronal Group Communication (NGC), a theory-driven framework that reimagines a neural network as a dynamical system of interacting neuronal groups rather than a monolithic collection of neural weights. Instead of treating each weight as an independent trainable parameter, NGC treats weights as transient interactions between embedding-like neuronal states, with neural computation unfolding through iterative communication among groups of neurons. This low-rank, modular representation yields compact models: groups of neurons exchange low-dimensional signals, enabling intra-group specialization and inter-group information sharing while dramatically reducing redundant parameters. By drawing on dynamical systems theory, we introduce a neuronal stability metric (analogous to Lyapunov stability) that quantifies the contraction of neuron activations toward stable patterns during sequence processing. Using this metric, we reveal that emergent reasoning capabilities correspond to an external driving force or ``potential'', which nudges the neural dynamics away from trivial trajectories while preserving stability. Empirically, we instantiate NGC in large language models (LLMs) and demonstrate improved performance on complex reasoning benchmarks under moderate compression. NGC consistently outperforms standard low-rank approximations and cross-layer basis-sharing methods at comparable compression rates. We conclude by discussing the broader implications of NGC, including how structured neuronal group dynamics might relate to generalization in high-dimensional learning systems.
Paper Structure (26 sections, 8 theorems, 24 equations, 2 figures, 4 tables)

This paper contains 26 sections, 8 theorems, 24 equations, 2 figures, 4 tables.

Key Result

Theorem 1

Let a well-formed neural structure be any finite computation graph whose edges are affine maps and whose nodes apply componentwise nonlinearities. Define the intra-group communication primitive by the similarity where $\sigma$ is either the identity or a componentwise non-polynomial nonlinearity (e.g., $\tanh$), and inter-group communication consists of sharing/alignment of input-side neuronal st

Figures (2)

  • Figure 1: An overview of the Neuronal Group Communication (NGC) pipeline.(a) Neural weights as intra-group dynamical interaction. We reinterpret neural weights as intra-group communication, which are compact bilinear maps (optionally metric-symmetric) that define local dynamics over neuronal states, casting the model as a dynamical system (Section \ref{['subsec: learning neurons not weights']}). (b) Virtual inter-group communication exists everywhere. Groups exchange virtual information through the alignment of their state subspaces; even without a direct pathway, a low-dimensional communication subspace exists. (Section \ref{['subsec: NGC-policy, intra/inter-group Com']}) (c) NGC policy controls communication. An NGC policy determines which neuronal groups share synchronous/asynchronous information exchange (Section \ref{['subsec: dy-Neural system and neuronal stability']}); Any synchronous/asynchronous inter-group NGC among neuronal groups is equivalent to partially aligning their input-side neuronal states (Theorem \ref{['app-thm: shared input neurons simulate any NGC']}). (d) Reasoning corresponds to neuronal stability. Better reasoning is associated with reduced Lyapunov-like scores $\mathcal{S}$ (and surrogate $\mathcal{S}_{\text{approx}}$) under contracting dynamics (Theorem \ref{['app-thm: neuronal stability measures reasoning capacity']}); external potentials $\nabla U$ produce controlled departures that remain stable from input-to-state (Theorems \ref{['app-thm: emergent potential equals non-predictability']}). (e) Enumeration, selection, finetuning, and evaluation of policies. We instantiate a bank of NGC policies from pre-captured activations, select by neuronal stability (low $S$ or $S_{\text{approx}}$), then finetune and evaluate on reasoning benchmarks (Section \ref{['subsec: initialization and training']}).
  • Figure 2: The "root" system (original model) and the "com" system (under an NGC policy) evolve through coupled updates of activations $\mathcal{A}$ and neuronal states $\mathcal{Q}$. Their token and structure-wise evolutions are approximated by linear projections $\mathcal{T}$ and $\mathcal{H}$, yielding a stable discrete update that lets the "com" system follow the "root" trajectory while permitting controlled deviations induced by inter-group communication.

Theorems & Definitions (16)

  • Theorem 1: Intra-group and inter-group communications are sufficient
  • proof : Proof of Theorem \ref{['app-thm: intra/inter-group coms are sufficient']}
  • Theorem 2: Neuronal stability controls divergence and predicts task robustness
  • proof : Proof of Theorem \ref{['app-thm: neuronal stability measures reasoning capacity']}
  • Theorem 3: Shared input neurons simulate delayed/asynchronous inter-group links
  • proof : Proof of Theorem \ref{['app-thm: shared input neurons simulate any NGC']}
  • Theorem 4: External potentials create non-predictable yet stable departures
  • proof : Proof of Theorem \ref{['app-thm: emergent potential equals non-predictability']}
  • Proposition 5: Generalized intra-group communication)
  • proof : Proof of Proposition \ref{['app-prop: C_ij via SVD']}
  • ...and 6 more