cs.LGJan 27, 2026

Critical Organization of p-Adic Deep Neural Networks

Authors: W. A. Zúñiga-Galindo

Abstract

We study continuous neural networks whose neurons are the points of the ring of p-adic integers, a fractal tree-like space that encodes hierarchical architectures. The hidden states solve a nonlinear integral equation, which describes the equilibria of recurrent networks and deep equilibrium models; feedforward architectures appear as the special case of kernels without feedback. We prove that the state is unique and depends Lipschitz-continuously on the parameters whenever the product of the Lipschitz constant of the activation function and the operator norm of the connectivity is less than one, and that, when the parameters are locally constant, every state is exactly the state of a finite network with a tree-like topology. We introduce p-adic discrete deep networks, whose layers are the levels of the tree and whose weights are coarse-grainings of a single kernel, and show that, in the stable region, they converge to the continuous network as the depth tends to infinity. Feedforward networks always have a unique state; hence a multiplicity of states, and therefore critical organization in our sense, requires recurrence. For recurrent networks with radial kernels we prove a sharp transition: the zero state is the only state if and only if the total coupling does not exceed one. For hierarchical kernels, above the threshold, the states are indexed by sign patterns on the leaves of the tree, their number is computed exactly, and they form a tree-indexed partially ordered set graded by instability. Numerical experiments illustrate these results and test conjectures on general radial kernels and on random recurrent networks on the tree. Finally, we interpret the critical organization hypothesis for deep neural networks, originally formulated for brain organization, through the lens of multistability, and we discuss the continuous limits of families of finite networks.

Figures & tables

Explore similar work

Mar 31, 2026

pp-adic Character Neural Network

We propose a new frame work of pp-adic neural network. Unlike the original pp-adic neural network by S.\ Albeverio, A.\ Khrennikov, and B.\ Tirrozi using a family of characteristic functions indexed by hyperparameters of precision as activation functions, we use a single injective pp-adic character on the topological Abelian group Zp\mathbb{Z}_p of pp-adic integers as an activation function. We prove the pp-adic universal approximation theorem for this formulation of pp-adic neural network, and reduce it to the feasibility problem of polynomial equations over the finite ring of integers modulo a power of pp.
Jun 26, 2026

Singular Learning and Occam's Razor in Deep Monomial Networks

In the optimization of neural networks, gradient dynamics are influenced by critical points that arise from the model's architecture. These critical points occur where the Jacobian of the model's parametrization is rank-deficient, and are the most pronounced singularities studied in Singular Learning Theory. We investigate such points in deep fully-connected networks with monomial activations via tools from polynomial algebra such as Mason's Theorem. We show that, for sufficiently large activation degree, criticality occurs precisely at subnetworks, i.e., at parameter configurations where some neurons are inactive or redundant. This offers a mathematical perspective on the implicit bias in deep neural networks, explaining the tendency of these models to converge toward simpler functions.