"More Is Different'' in Neural Circuits: Algebraic Emergence of Effective Theories in Canonical Recurrent Motifs of Biological Neuronal Networks

• URL: http://arxiv.org/abs/2608.30231v1
• Date: Mon, 31 Aug 2026 04:36:37 GMT
• Title: "More Is Different'' in Neural Circuits: Algebraic Emergence of Effective Theories in Canonical Recurrent Motifs of Biological Neuronal Networks
• Abstract summary: We represent Canonical neural circuit motifs and their compositions as finite transformation systems.<n>We analyze the transition monoids generated by their input-conditioned updates.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Canonical neural circuit motifs are usually described functionally: divisive normalization rescales population activity by a pooled signal, and winner-take-all competition selects one pattern through recurrent excitation and shared inhibition. We represent them, and their compositions, algebraically as finite transformation systems and analyze the transition monoids generated by their input-conditioned updates, distinguishing structure already present in a generator from structure that appears only through composition, and, on a joint state space, structure inherited from one factor from structure that lives on a joint configuration. Individually aperiodic updates can generate non-aperiodic monoids. In the WTA, every frozen-drive generator collapses to fixed points, yet short input sequences create local cycles of winner-dependent inhibitory gating: globally dissipative dynamics with a reversible action. The strongest result arises in WTA-to-DN composition. The composed monoid then contains a genuinely composite local cycle in which normalization state and the winner's gating state change together, although every primitive generator is aperiodic. Holonomy analysis certifies this as a group component of the Krohn-Rhodes cascade rather than an incidental cycle, and finds most group-carrying image sets on joint configurations, whereas the uncoupled product has none. An exhaustive interface sweep shows that the composite cycle is a property of the coupling rather than of a chosen map. If motifs are building blocks of neural computation, composing them is a form of programming: one chooses primitives and interfaces so that the generated algebra has the intended repertoire. The transition monoid is that repertoire - what a primitive presents to any later construction. Recurrent circuits are compositional transformation systems; their algebra constrains what they can be programmed to compute.

Related papers

• ModularPhaseNet: Finite-Cyclic Phase Geometry for Computable Semantic Hierarchy, Direction, and Context Consistency in Standard Transformers [0.0]
  We propose a discretization of the continuous complex phase geometry introduced in QuantumPhaseNet.<n>No quantum hardware, complex-valued matrix multiplication, or discrete-logarithm computation is required.
  arXiv  Detail & Related papers  (2026-09-05T10:02:23Z)
• Algebraic Operator Decomposition: A Partitioned Architecture for Noise-Resilient Quantum Computing [0.0]
  We present an operator-decomposition architecture that mathematically maps a global operator into independently executable local operators.<n>AOD complements quantum error correction and error-mitigation approaches by performing algebraic decomposition before quantum execution.
  arXiv  Detail & Related papers  (2026-09-03T16:44:39Z)
• Cycle-Structure Generating Functions for Special Breakpoint Graphs [0.0]
  Breakpoint graphs originate in comparative genomics, where their alternating cycles encode relationships between genomes.<n>We study a constrained class of three-colored breakpoint graphs associated with permutations and develop cycle-refined generating functions for two extremal families.<n>The results determine the leading and constant-order moments entering the Rényi entropy expansion, with the projective-plane contribution giving the finite-size constant correction.
  arXiv  Detail & Related papers  (2026-08-31T13:29:37Z)
• Learning to Tessellate: Point Cloud Generation via Recursive Spectral Partitioning [58.130498928480456]
  We present PointRSP, an autoregressive framework that reformulates point cloud generation as a topology-preserving tessellation process.<n>PointRSP achieves state-of-the-art performance in generation quality and diversity, demonstrating strong generalization across complex 3D topologies.
  arXiv  Detail & Related papers  (2026-08-03T16:11:43Z)
• Neural Networks Provably Learn Spectral Representations for Group Composition [51.637084292404616]
  We study how structured internal structure emerges during neural network training.<n>We prove that the training dynamics are governed by a gradient ascent on a representation-theoretic energy functional.<n>This framework provides a representation-theoretic account of feature learning and characterizes a novel low-rank compression phenomenon.
  arXiv  Detail & Related papers  (2026-06-02T01:04:21Z)
• Primitive Recursion without Composition: Dynamical Characterizations, from Neural Networks to Polynomial ODEs [0.0]
  We study computation-real-valued states evolved by real-valued dynamics.<n>All three operate over continuum-real-valued states evolved by real-valued dynamics.
  arXiv  Detail & Related papers  (2026-04-27T11:48:49Z)
• On the Mechanism and Dynamics of Modular Addition: Fourier Features, Lottery Ticket, and Grokking [49.1352577985191]
  We present a comprehensive analysis of how two-layer neural networks learn features to solve the modular addition task.<n>Our work provides a full mechanistic interpretation of the learned model and a theoretical explanation of its training dynamics.
  arXiv  Detail & Related papers  (2026-02-18T20:25:13Z)
• Memory as Structured Trajectories: Persistent Homology and Contextual Sheaves [5.234742752529437]
  We introduce the delta-homology analogy, which formalizes memory as a set of sparse, topologically irreducible attractors.<n>A Dirac delta-like memory trace is identified with a nontrivial homology generator on a latent manifold of cognitive states.<n>We interpret these delta-homology generators as the low-entropy content variable, while the high-entropy context variable is represented dually as a filtration, cohomology class, or sheaf.
  arXiv  Detail & Related papers  (2025-08-01T23:03:13Z)
• What is Memory? A Homological Perspective [6.0044467881527614]
  We introduce the delta-homology model of memory, in which recall, learning, and prediction emerge from cycle closure.<n>A Dirac-like memory trace corresponds to a nontrivial homology generator, representing a sparse, irreducible attractor.<n>We formalize this mechanism through the Context-Content Uncertainty Principle (CCUP), which states that cognition minimizes joint uncertainty between a high-entropy context variable and a low-entropy content variable.
  arXiv  Detail & Related papers  (2023-03-07T19:47:01Z)
• Learning Algebraic Recombination for Compositional Generalization [71.78771157219428]
  We propose LeAR, an end-to-end neural model to learn algebraic recombination for compositional generalization. Key insight is to model the semantic parsing task as a homomorphism between a latent syntactic algebra and a semantic algebra. Experiments on two realistic and comprehensive compositional generalization demonstrate the effectiveness of our model.
  arXiv  Detail & Related papers  (2021-07-14T07:23:46Z)
• LieTransformer: Equivariant self-attention for Lie Groups [49.9625160479096]
  Group equivariant neural networks are used as building blocks of group invariant neural networks. We extend the scope of the literature to self-attention, that is emerging as a prominent building block of deep learning models. We propose the LieTransformer, an architecture composed of LieSelfAttention layers that are equivariant to arbitrary Lie groups and their discrete subgroups.
  arXiv  Detail & Related papers  (2020-12-20T11:02:49Z)
• Graph Gamma Process Generalized Linear Dynamical Systems [60.467040479276704]
  We introduce graph gamma process (GGP) linear dynamical systems to model real multivariate time series. For temporal pattern discovery, the latent representation under the model is used to decompose the time series into a parsimonious set of multivariate sub-sequences. We use the generated random graph, whose number of nonzero-degree nodes is finite, to define both the sparsity pattern and dimension of the latent state transition matrix.
  arXiv  Detail & Related papers  (2020-07-25T04:16:34Z)
• Combinatory Chemistry: Towards a Simple Model of Emergent Evolution [0.0]
  Combinatory Chemistry is an Algorithmic Artificial Chemistry based on a minimalistic computational paradigm named Combinatory Logic. Our experiments show that a single run of this dynamical system with no external intervention discovers a wide range of emergent patterns.
  arXiv  Detail & Related papers  (2020-03-17T19:55:58Z)

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.