Pith. sign in

REVIEW 4 major objections 4 minor 63 references

Critical Organization of Deep Neural Networks, and p-Adic Statistical Field Theories

T0 review · 4 major / 4 minor · reviewed 2026-08-03 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The paper argues that the true infinite-width limit of deep sigmoid networks is a single integral equation over p-adic integers, and that this equation displays a bifurcation where a unique hidden state becomes infinitely many states.

desk verdict A clean fixed-point theorem for a p-adic integral equation is buried under an unproven 'thermodynamic limit' framing; the advertised critical bifurcation is only proven in a toy model. read the letter →

arxiv 2601.19070 v2 pith:CGRSEV6S submitted 2026-01-27 cs.LG

W. A. Zúñiga-Galindo This is my paper · ORCID
classification cs.LG MSC 68T0711S8046S10
keywords deepneuralnetworksthermodynamiclimitp-adicintegershierarchicaltreestructurescriticalorganizationbifurcationrandomnetworkprior
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper tries to establish that the thermodynamic limit of deep sigmoid networks is not a Euclidean continuum but an integral equation over p-adic integers, numbers organized as an infinite rooted tree. In the region where the activation growth constant times the L2 norm of the weight kernel is below 1, the paper proves a unique hidden state exists and depends continuously on the parameters. Outside that region, the paper argues the unique state gives way to infinitely many states, a bifurcation it identifies with the critical organization seen in neural systems near phase transitions. It also derives a network prior for random infinite-width networks: a power-series expansion whose leading term is Gaussian. If right, this would give a rigorous framework for phase transitions and criticality in deep learning.

What carries the argument

The load-bearing object is the p-adic continuous DNN defined in Definition 2: one integral equation on Z_p in which the kernel W plays the role of all weight matrices and the activation φ is applied inside the integral. The finite analogues live on quotient trees G_l = Z_p/p^lZ_p, and the discretization lemma shows the finite recursion is exactly the integral equation evaluated at tree nodes with a scale factor. The uniqueness proof is a Banach contraction argument on L^2: the fixed-point map for the hidden state contracts when the product of the activation's growth bound and the kernel norm is below 1. In the toy model, the state space for a>1 is parametrized by pairs of subsets (I+, I−) an

What would settle it

Check a concrete infinite sequence of finite sigmoid networks with fixed p-adic tree wiring and widths going to infinity, and see whether the hidden states converge in L^2 to the unique fixed point of the integral equation in the stable region; if some sequence fails to converge or converges elsewhere, the thermodynamic-limit ansatz is wrong. For the multiplicity claim, exhibit two different L^2 solutions of the fixed-point equation for a single parameter set with ∥φ∥∞∥W∥_2 > 1.

Watch

Extended reading notes

Core claim

The paper's central claim is that the thermodynamic limit of a deep or recurrent network with sigmoid activations is a single nonlinear integral equation over the ring of p-adic integers Z_p, h(x)=∫ W(x,y)φ(h(y))dy + ∫ W_in(x,y)x(y)dy + ξ(x). Z_p is described as the leaves of an infinite rooted tree, so the layers of a DNN become levels of the tree and the matrix products of the discrete recursion become kernel composition over the tree. The paper proves (Theorem 1) that when ∥φ∥∞∥W∥_2 < 1 the equation has a unique hidden state in L^2(Z_p), depending continuously on parameters and input, and that this state is approximated by discrete p-adic networks. It then argues that when the inequality

Load-bearing premise

The load-bearing premise is the paper's ansatz—stated but not proven—that when the number of neurons per layer tends to infinity, the discrete network dynamics converge to the continuum p-adic integral equation; if that convergence fails, the critical bifurcation picture does not follow.

Editorial extensions

If this is right

  • If the ansatz holds, infinite-width sigmoid networks have a well-defined continuum state whenever the weight kernel is small enough, and the state is stable under small parameter changes.
  • The threshold ∥φ∥∞∥W∥_2 = 1 becomes a predicted phase transition: below it the input determines the output uniquely, above it the network hosts many states.
  • Because any discrete DNN or RNN with sigmoids can be re-expressed as a p-adic tree network without adding parameters, hierarchical architectures are the natural setting for the thermodynamic limit, not a special case.
  • The random-network calculation yields an explicit prior for infinite width: the output distribution is a power series whose constant term is Gaussian, giving a concrete interface with statistical field theory.
  • The same bifurcation analysis extends formally to the partition function of the corresponding field theory, so the critical organization is a property of the whole network family.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • One testable prediction is that as finite-width sigmoid networks approach the threshold, collective fluctuations of the hidden state should slow down or diverge; this can be probed in ordinary training runs without p-adic machinery.
  • The p-adic tree structure suggests a natural renormalization-group operation: truncating the p-adic expansion coarse-grains the network, and critical exponents for the bifurcation could be extracted from how the kernel transforms under this operation.
  • The exclusion of ReLU matters: the contraction machinery depends on bounded activations with φ(0)=0; if a ReLU analogue has different limits, the p-adic thermodynamic limit may be specific to sigmoidal networks.
  • The lattice of states in the toy model implies a concrete signature for edge detectors: at criticality, the output depends on the choice of I±, making the network sensitive to initial conditions in a way that could be tested on grayscale images.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The paper proposes a p-adic continuous DNN described by the integral equation h(x)=∫ W(x,y)ϕ(h(y))dy+∫ W_in(x,y)x(y)dy+ξ(x) and claims this is the thermodynamic limit of finite DNNs/RNNs with sigmoid activations. It proves uniqueness and continuous dependence of the L^2 solution in the region 0<L_ϕ‖W‖_2<1 by a contraction argument (Proposition 1, Theorem 1(i)), and shows that Picard iterates of the continuous equation can be realized by p-adic discrete DNNs (Theorem 1(ii)). It gives an algorithm to recast finite DNNs as p-adic discrete DNNs, and analyzes a toy-model edge detector for which the set of states is classified and exhibits a lattice structure. The second half develops a random version with generalized Gaussian parameters and derives formal finite-dimensional path-integral formulas and a power expansion for the output distribution.

Significance. The paper contains several genuinely useful explicit pieces: the contraction fixed-point theorem is clean; Lemma 4 gives an explicit discretization of the p-adic integral equation; Section 6.3 provides a constructive embedding of finite layered networks into p-adic tree structures; Section 8's toy model yields a complete, explicit classification of stationary states and their partial order; and Sections 10-11 compute the marginal network prior under stated Gaussian assumptions. If the thermodynamic-limit identification (1.1)→(1.2) were actually proved, the paper would establish a new bridge between DNNs and p-adic statistical field theories. However, that identification is introduced as an ansatz and never proved, the general infinite-state bifurcation is not proved, and the 'infinite-width' random prior is finite-dimensional. The significance is therefore prospective; the paper does not currently deliver the advertised theory.

major comments (4)
  1. [§1, Eq. (1.2); §6.3–6.4; Theorem 1] The central premise of the paper, stated in the abstract and Introduction, is that Eq. (1.2) is the thermodynamic limit of the finite DNN (1.1) as layer widths tend to infinity. This is introduced only as 'We propose the ansatz' (Section 1). Theorem 1(ii) goes in the opposite direction: it shows that Picard iterates of the continuous equation (1.2) can be realized by p-adic discrete DNNs with finite L and Δ. It does not show that forward passes of (1.1) converge to any solution of (1.2) in any topology as widths grow. Section 6.3 fixes a prime p>N and embeds the finite network into G_{L+Δ}; p depends on N and no N→∞ limit is taken. Section 6.4 asserts that because Z is dense in Z_p 'there are continuous functions' interpolating the matrices; denseness alone is insufficient for continuous extension of arbitrary discrete data and, even with an extension, does not imply convergence of the d
  2. [Abstract; §7 (after Theorem 1); Theorem 2] The abstract and §7 claim that outside X_stable the unique state 'breaks into an infinite number of states'. For the general p-adic continuous DNN of Definition 2 no theorem in the paper establishes this. After Theorem 1 the paper defines constant-state sets X_α, conjectures chaotic behavior, and states that 'a precise study of the dynamics of the mentioned map is an open problem' (end of §7). The only rigorous infinite-state result is the toy model (8.3) for a>1, whose classification is quoted as Theorem 2 from the author's [26]. The general bifurcation from a unique state to infinitely many states is therefore not proven; this is a central advertised claim.
  3. [Definition 1; Theorem 1(i); Eq. (7.1)] Definition 1 sets L_ω=‖ω‖_∞ whenever ω(0)=0. This equality is false for standard sigmoidal activations: for ω(s)=tanh(s/2), which is Lipschitz with constant 1/2 and satisfies ω(0)=0, one has ‖ω‖_∞=1. Consequently the stable region X_stable in Theorem 1(i), defined as {0<‖ϕ‖_∞‖W‖_2<1}, is not the contraction region for such activations; it is unnecessarily restrictive. The contraction argument in Proposition 1 is valid with the true Lipschitz constant L_ϕ, so the statement should use 0<L_ϕ‖W‖_2<1. The current mis-statement affects the parameter region that the paper calls critical.
  4. [§9.2–§11; Theorem 4; Remark 8] Section 9.2 is titled 'DNNs with infinite-width', but the integrals defining the prior in Theorem 4 are taken over D_{L+Δ}(Z_p), a space of dimension p^{L+Δ} (piecewise-constant functions on p^{-(L+Δ)}-balls). The fields h, e h, e y in the path integral are therefore finite-dimensional; no limit L+Δ→∞ is taken. Extending the parameter spaces W, W_in, ... to L^2(Z_p×Z_p) does not make the integration over h and y infinite-dimensional. Thus the 'power-type expansion' in §11 is an expansion of a finite-dimensional Gaussian-type integral, and the claim of an infinite-width network prior is not supported. This undermines the random-part portion of the abstract.
minor comments (4)
  1. [Eq. (5.2)] In the W_in term the notation 'Λ_{+∆,L}' appears; this should presumably be Λ_{L+∆,L}.
  2. [§6.3 heading] The heading 'The p-adic three-like structures are universal architectures' contains a typo: 'three' should be 'tree'.
  3. [Theorem 1(ii) proof] The proof says 'there exists n0+1 such that ∥h−h_{n0+1}∥<ε'; the notation is confusing. It should be written as 'there exists n_0 such that ∥h−h_{n_0+1}∥<ε' with n_0 defined clearly.
  4. [Remark 9] The ansatz in Remark 9 writes ϕ(h(x)) inside the integral over y; this should be ϕ(h(y)) for consistency with Eq. (1.2).

Circularity Check

0 steps flagged · score 2.0 of 10

No circular reduction in the mathematical core; the thermodynamic-limit bridge is an explicitly admitted ansatz, and the main fixed-point theorem is self-contained.

full rationale

Proposition 1 / Theorem 1(i) prove existence and uniqueness of a fixed point of the continuous p-adic DNN equation under the stated contraction condition; this is a direct Banach-fixed-point argument and does not presuppose the conclusion. Theorem 1(ii) shows that Picard iterates of that equation can be represented as p-adic discrete DNNs; this is a discretization direction, not a claim that finite DNNs converge to it, and the paper explicitly labels the opposite direction an 'ansatz': 'We propose the ansatz that at the limit when the number of neurons at all layers tends to infinity, (1.1) becomes (1.2)'. Thus the missing width-to-continuum limit is an unproven premise or correctness gap, not a definitional identity. The paper also explicitly defers the hard dynamical questions: 'A precise study of the dynamics of the mentioned map is an open problem' and 'The study of the critical organization as a phase-transition phenomenon remains an open problem.' The toy-model infinite-state classification is imported from the authors' prior [26] with explicit theorem citations; this is non-independent support but not a fitted-input or ansatz-smuggling reduction. Section 6.4's denseness argument ('Z is dense in Z_p, and thus there are continuous functions...') is a mathematical gap, but gaps in an application argument are not circularity. Definition 1's identification L_phi = ||phi||_inf is inaccurate for general sigmoids, but this is a correctness issue in the stated stable region, not a circularity. Score 2 reflects the presence of noticeable self-citation and an asserted thermodynamic-limit premise; no step reduces an output to an input by construction.

Assumptions & free parameters 0 free parameters · 6 assumptions · 2 invented entities

The central claim rests primarily on the ansatz that the p-adic integral equation is the thermodynamic limit, on the (incorrect for general sigmoids) equality of Lipschitz constant and sup norm, on standard Gaussian-measure assumptions, and on formal measure assumptions in the SFT section. No empirical free parameters are fitted.

assumptions (6)
  • ad hoc to paper The continuum integral equation (1.2) is the thermodynamic limit of discrete DNNs (1.1) as neuron counts tend to infinity.
    Introduced as 'We propose the ansatz' in Section 1 and used as the definition of p-adic continuous DNN; no convergence theorem is supplied.
  • ad hoc to paper For a Lipschitz activation with ω(0)=0, the Lipschitz constant equals the L∞ norm, L_ω=∥ω∥∞.
    Used in Definition 1, Proposition 1 and Theorem 1 to set the stable region Xstable by ∥ϕ∥∞∥W∥_2<1. Not true for general sigmoids; e.g., tanh(a s) has L=a, sup norm 1.
  • domain assumption Network parameters W, W_in, W_out, ξ, ξ_out are realizations of Gaussian measures on L^2 with trace-class integral covariance operators.
    Assumed in Section 10.1 following Gaussian-measure theory and QFT practice; standard but an input, not derived.
  • domain assumption The formal measure dh on L^2(Ω) defining the SFT partition function exists.
    Section 12 says 'We now assume the existence of a measure dh on L^2(Ω)' and appeals to Bochner-Minlos; this makes the SFT correspondence formal.
  • ad hoc to paper A function defined on the dense subset Z⊂Z_p extends to a continuous function on Z_p.
    Used in Section 6.4 to pass from discrete W,h,ξ values indexed by integers to continuous kernels; false without uniform continuity.
  • standard math D(Z_p) (finite linear combinations of ball indicators) is dense in L^2(Z_p).
    Used in Theorem 1(ii) to approximate the fixed point by discrete test functions; standard p-adic analysis.
invented entities (2)
  • p-adic continuous DNN with state h∈L^2(Z_p)
    purpose: to model the thermodynamic limit and hierarchical organization of DNNs/RNNs
    It is defined in Definition 2 and justified by an ansatz, not by a proven limit from standard architectures; no falsifiable prediction is attached.
  • strange attractor in the p-adic state space
    purpose: proposed description of critical organization for the toy edge detector
    Mentioned in Section 8 and Introduction as a proposal; no attractor is constructed or measured.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Critical Organization of Deep Neural Networks, and p-Adic Statistical Field Theories." pith.science (2026). https://pith.science/paper/CGRSEV6S

@misc{pith2026260119070,
  author       = {Pith},
  title        = {Pith review of: Critical Organization of Deep Neural Networks, and p-Adic Statistical Field Theories},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/CGRSEV6S}},
  note         = {Machine review of arXiv:2601.19070}
}
read the original abstract

We rigorously study the thermodynamic limit of deep neural networks (DNNS) and recurrent neural networks (RNNs), assuming that the activation functions are sigmoids. A thermodynamic limit is a continuous neural network, where the neurons form a continuous space with infinitely many points. We show that such a network admits a unique state in a certain region of the parameter space, which depends continuously on the parameters. This state breaks into an infinite number of states outside the mentioned region of parameter space. Then, the critical organization is a bifurcation in the parameter space, where a network transitions from a unique state to infinitely many states. We use p-adic integers to codify hierarchical structures. Indeed, we present an algorithm that recasts the hierarchical topologies used in DNNs and RNNs as p-adic tree-like structures. In this framework, the hierarchical and the critical organizations are connected. We study rigorously the critical organization of a toy model, a hierarchical edge detector for grayscale images based on p-adic cellular neural networks. The critical organization of such a network can be described as a strange attractor. In the second part, we study random versions of DNNs and RNNs. In this case, the network parameters are generalized Gaussian random variables in a space of quadratic integrable functions. We compute the probability distribution of the output given the input, in the infinite-width case. We show that it admits a power-type expansion, where the constant term is a Gaussian distribution.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

63 extracted references · 10 canonical work pages

  1. [26]

    B. A. Zambrano-Luna, W. A. Z´ u˜ niga-Galindo.p-adic cellular neural networks: applications to image processing. Phys. D 446 (2023), Paper No. 133668, 11 pp

    2023

  2. [1]

    Bullmore, & O

    E. Bullmore, & O. Sporns . (2009). Complex brain networks: graph theory and connectomics. Nature Reviews Neuroscience, 10(3), 186-198

    2009

  3. [2]

    Hilgetag, Alexandros Goulas

    Claus C. Hilgetag, Alexandros Goulas. ‘Hierarchy’ in the organization of brain net- works. Philos Trans R Soc Lond B Biol Sci 13 April 2020; 375 (1796): 20190319. https://doi.org/10.1098/rstb.2019.0319

    arXiv 2020

  4. [3]

    Bornholdt, T

    S. Bornholdt, T. R¨ ohl. Self-organized critical neural networks. Phys Rev E Stat Nonlin Soft Matter Phys. 2003 Jun; 67(6 Pt 2):066118. doi: 10.1103/PhysRevE.67.066118

    work page doi:10.1103/physreve.67.066118 2003

  5. [4]

    Self-organized criticality in neural networks

    Mikhail I. Katsnelson, Vitaly Vanchurin, Tom Westerhout. Self-organized criticality in neural networks. https://doi.org/10.48550/arXiv.2107.03402

    work page Pith review arXiv doi:10.48550/arxiv.2107.03402

  6. [5]

    Critical dynamics governs deep learning

    Simon Vock, Christian Meisel. Critical dynamics governs deep learning. https://doi.org/10.48550/arXiv.2507.08527

    doi:10.48550/arxiv.2507.08527

  7. [6]

    Critical Points of Neural Networks: Analytical Forms and Landscape Properties

    Yi Zhou, Yingbin Liang. Critical Points of Neural Networks: Analytical Forms and Landscape Properties. https://doi.org/10.48550/arXiv.1710.11205

    arXiv doi:10.48550/arxiv.1710.11205

  8. [7]

    Statistical Field Theory for Neural Networks

    Moritz Helias, David Dahmen. Statistical Field Theory for Neural Networks. Lecture Notes in Physics 970, Springer Cham, 2020. DOI: https://doi.org/10.1007/978-3-030-46444-8

    doi:10.1007/978-3-030-46444-8 2020

Show all 63 references
  1. [8]

    Buice, Jack D

    Michael A. Buice, Jack D. Cowan. Field-theoretic approach to fluctuation effects in neural networks. Phys. Rev. E (3) 75 (2007), no. 5, 051919, 14 pp

    2007

  2. [9]

    Buice, J.D

    M.A. Buice, J.D. Cowan, Statistical mechanics of the neocortex. Progress in Biophysics and Molecular Biology. 2009 Feb-Apr;99(2-3):53-86. DOI: 10.1016/j.pbiomolbio.2009.07.003

    2009 doi

  3. [10]

    Chow and M

    C. Chow and M. Buice. Path Integral Methods for Stochastic Differential Equations. J. Math. Neurosci. 5, 8 (2015)

    2015

  4. [11]

    K. T. Grosvenor, R. Jefferson. The edge of chaos: quantum field theory and deep neural networks. SciPost Phys., 12, [81] (2022). https://doi.org/10.21468/SciPostPhys.12.3.081

    2022 doi

  5. [12]

    Halverson, A

    J. Halverson, A. Maiti and K. Stoner. Neural networks and quantum field theory. Mach. Learn.: Sci. Technol. 2, 035002 (2021), doi:10.1088/2632-2153/abeca3

    2021 doi

  6. [14]

    W. A. Z´ u˜ niga-Galindo. Dynamic mean-field theory for continuous random networks. J. Phys. A 58 (2025), no. 12, Paper No. 125201, 89 pp

    2025

  7. [15]

    W. A. Z´ u˜ niga-Galindo, C. He, B. A. Zambrano-Luna.p-adic statistical field theory and convolutional deep Boltzmann machines. PTEP. Prog. Theor. Exp. Phys. (2023), no. 6, Paper No. 063A01, 17 pp

    2023

  8. [16]

    Z´ u˜ niga-Galindo

    Wilson A. Z´ u˜ niga-Galindo. A correspondence between deep Boltzmann machines andp-adic statistical field theories. Adv. Theor. Math. Phys. 28 (2024), no. 2, 679–741

    2024

  9. [17]

    A.Z´ u˜ niga-Galindo.p-adic statistical field theory and deep belief networks

    W. A.Z´ u˜ niga-Galindo.p-adic statistical field theory and deep belief networks. Phys. A 612 (2023), Paper No. 128492, 23 pp

    2023

  10. [18]

    Roberts, Sho Yaida

    Daniel A. Roberts, Sho Yaida. The Principles of Deep Learning Theory: An Effective Theory Approach to Understanding Neural Networks. Cambridge University Press, 2022

    2022

  11. [19]

    Unified field theoretical approach to deep and recurrent neuronal networks

    Kai Segadlo, Bastian Epping, Alexander van Meegen, David Dahmen, Michael Kr¨ amer and Moritz Helias. Unified field theoretical approach to deep and recurrent neuronal networks. J. Stat. Mech. (2022) 103401. p-ADIC NUMBERS, CRITICALLY IN DNNS 43

    2022

  12. [20]

    Schoenholz, Jeffrey Pennington, Jascha Narain Sohl-Dickstein

    Samuel S. Schoenholz, Jeffrey Pennington, Jascha Narain Sohl-Dickstein. A Cor- respondence Between Random Neural Networks and Statistical Field Theory. https://doi.org/10.48550/arXiv.1710.06570

    doi arXiv

  13. [21]

    Iordache

    O. Iordache. Non-Archimedean Analysis. In: Modeling Multi-Level Systems. Understanding Complex Systems, vol 70. Springer, Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3- 642-17946-4 13

    2011 doi

  14. [22]

    Andrei Khrennikov, Sergei Kozyrev, W. A. Z´ u˜ niga-Galindo. Ultrametric Equations and its Applications. Encyclopedia of Mathematics and its Applications 168. Cambridge, Cambridge University Press, 2018

    2018

  15. [23]

    Khrennikov Andrei, Information dynamics in cognitive, psychological, social and anomalous phenomena. Fund. Theories Phys., 138. Kluwer Academic Publishers Group, Dordrecht, 2004

    2004

  16. [24]

    W. A. Z´ u˜ niga-Galindo, B. A. Zambrano-Luna, Baboucarr Dibba. Hierarchical neural net- works, p -adic PDEs, and applications to image processing. J. Nonlinear Math. Phys. 31 (2024), no. 1, Paper No. 63, 40 pp

    2024

  17. [25]

    B. A. Zambrano-Luna, W. A. Z´ u˜ niga-Galindo.p-adic cellular neural networks, J. Nonlinear Math. Phys. 30 (2023), no. 1, 34–70

    2023

  18. [27]

    W. A. Z´ u˜ niga-Galindo. Deep Neural Networks: A Formulation Via Non-Archimedean Anal- ysis. https://doi.org/10.48550/arXiv.2402.00094

    doi

  19. [28]

    Chua, Tamas Roska

    Leon O. Chua, Tamas Roska. Cellular neural networks and visual computing: foundations and applications, Cambridge university press, 2002

    2002

  20. [29]

    Cellular neural networks: dynamics and modelling

    Angela Slavova. Cellular neural networks: dynamics and modelling. Mathematical modelling: theory and applications, 16. Kluwer Academic Publishers, Dordrecht, 2003

    2003

  21. [30]

    W. A. Z´ u˜ niga-Galindo, B. A. Zambrano-Luna. 2023. Hierarchical Wilson–Cowan Models and Connection Matrices. Entropy 25, no. 6: 949. https://doi.org/10.3390/e25060949

    2023 doi

  22. [31]

    Khona, I

    M. Khona, I. R. Fiete. Attractor and integrator networks in the brain. Nat Rev Neurosci 23, 744–766 (2022). https://doi.org/10.1038/s41583-022-00642-0

    2022 doi

  23. [32]

    Gilpin, Y

    W. Gilpin, Y. Huang, Y., D. B. Forger. (2020). Deep reconstruction of strange attractors from time series. Advances in Neural Information Processing Systems (NeurIPS), 33, 16864–16875

    2020

  24. [33]

    George J. Mpitsos. Attractors: Architects of Network Organization?. Brain Behav Evol. 1 May 2000; 55 (5): 256–277. https://doi.org/10.1159/000006660

    2000 doi

  25. [34]

    Tozzi, M

    A. Tozzi, M. Zare, M., J.F. Peters. (2023). Fractal basins as a mechanism for the nimble brain. Scientific Reports, 13, 20853

    2023

  26. [35]

    B. U. Kesgin, U. Te˘ gin, U. Implementing the analogous neural network using chaotic strange attractors. Commun Eng 3, 99 (2024). https://doi.org/10.1038/s44172-024-00242-z

    2024 doi

  27. [36]

    Luonan Chen and K. Aihara. Strange attractors in chaotic neural networks. IEEE Transac- tions on Circuits and Systems I: Fundamental Theory and Applications, vol. 47, no. 10, pp. 1455-1468, Oct. 2000, doi: 10.1109/81.886976

    doi

  28. [37]

    Villegas

    P. Villegas. (2025). Strange Attractors in Complex Networks. Phys. Rev. E 111, L042301 & arXiv:2504.08629

    2025 arXiv

  29. [38]

    An introduction to infinite-dimensional analysis

    Giuseppe Da Prato. An introduction to infinite-dimensional analysis. Universitext. Springer- Verlag, Berlin, 2006

    2006

  30. [39]

    Gel’fand, N.Y

    I.M. Gel’fand, N.Y. Vilenkin. Generalized Functions. Applications of Harmonic Analysis, vol

  31. [40]

    Academic Press, New York, 1964

    1964

  32. [41]

    White noise

    Takeyuki Hida, Hui-Hsiung Kuo, J¨ urgen Potthoff, LudwigStreit. White noise. An Infinite Dimensional Calculus. Math. Appl., 253. Kluwer Academic Publishers Group, Dordrecht, 1993

    1993

  33. [42]

    Introduction to infinite dimensional stochastic analysis

    Zhi-yuan Huang, Jia-an Yan. Introduction to infinite dimensional stochastic analysis. Math. Appl., 502. Kluwer Academic Publishers, Dordrecht; Science Press Beijing, Beijing, 2000

    2000

  34. [43]

    White noise calculus and Fock space

    Nobuaki Obata. White noise calculus and Fock space. Lecture Notes in Math., 1577 Springer- Verlag, Berlin, 1994

    1994

  35. [44]

    Zinn-Justin

    J. Zinn-Justin. Quantum field theory and critical phenomena. Internat. Ser. Monogr. Phys., 77 Oxford Sci. Publ. The Clarendon Press, Oxford University Press, New York, 1993

    1993

  36. [45]

    Martin, E

    P. Martin, E. Siggia, and H. Rose. Statistical Dynamics of Classical Systems. Phys. Rev. A 8, 423 (1973)

    1973

  37. [46]

    De Dominicis and L

    C. De Dominicis and L. Peliti. Field-Theory Renormalization and Critical Dynamics above Tc: Helium, Antiferromagnets, and Liquid-Gas Systems. Phys. Rev. B 18, 353 (1978). 44 W. A. Z ´U ˜NIGA-GALINDO

    1978

  38. [47]

    M´ ezard, G

    M. M´ ezard, G. Parisi, G., M. A. Virasoro.Spin Glass Theory and Beyond: An Introduction to the Replica Method and Its Applications. World Scientific, 1987

    1987

  39. [48]

    E. E. Perepelkin, B. I. Sadovnikov, N. G. Inozemtseva, et al. From Spin Glasses to Learning of Neural Networks. Phys. Part. Nuclei 53, 834–847 (2022). https://doi.org/10.1134/S1063779622040128

    2022 doi

  40. [49]

    An Introduction to the Theory of Spin Glasses and Neural Networks

    Viktor Dotsenko. An Introduction to the Theory of Spin Glasses and Neural Networks. World Scientific Publishing Co., Inc., 1994

    1994

  41. [50]

    Khrennikov, M

    A.Y. Khrennikov, M. Nilson. (2004).p-Adic Neural Networks. In: P-adic Deterministic and Random Dynamics. Mathematics and Its Applications, vol 574. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-2660-7 8

    2004 doi

  42. [51]

    Sergio Albeverio, Andrei Khrennikov, Brunello Tirozzi.p-Adic dynamical systems and neural networks. Math. Models Methods Appl. Sci. 9 (1999), no. 9, 1417–1437

    1999

  43. [52]

    Learning of p-adic neural networks

    Andrei Khrennikov, Brunello Tirozzi. Learning of p-adic neural networks. Stochastic pro- cesses, physics and geometry: new interplays, II (Leipzig, 1999), 395–401. CMS Conf. Proc., 29 American Mathematical Society, Providence, RI, 2000

    1999

  44. [53]

    Deep Learning on Lie Groups for Skeleton-Based Action Recognition

    Zhiwu Huang, Chengde Wan, Thomas Probst, Luc Van Gool. Deep Learning on Lie Groups for Skeleton-Based Action Recognition. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2017, pp. 6099-6108

    2017

  45. [54]

    Parhi, P

    R. Parhi, P. Bohra, A. El Biari, M. Pourya, M. Unser. Random ReLU Neural Networks as Non-Gaussian Processes. Journal of Machine Learning Research, 26(19), 1-31. (2025). http://jmlr.org/papers/v26/24-0737.html

    2025

  46. [55]

    W. Gu, A. Tandon, YY Ahn, et al. Principled approach to the selection of the embedding dimension of networks. Nat Commun 12, 3772 (2021). https://doi.org/10.1038/s41467-021- 23795-5

    2021 doi

  47. [56]

    Bogu˜ n´ a, I

    M. Bogu˜ n´ a, I. Bonamassa, M. De Domenico, et al. Network geometry. Nat Rev Phys 3, 114–135 (2021). https://doi.org/10.1038/s42254-020-00264-4

    2021 doi

  48. [57]

    W. A. Z´ u˜ niga-Galindo. Reaction-diffusion equations on complex networks and Turing pat- terns, viap-adic analysis. J. Math. Anal. Appl. 491 (2020), no. 1, 124239, 39 pp

    2020

  49. [58]

    W. A. Z´ u˜ niga-Galindo. Ultrametric diffusion, rugged energy landscapes and transition net- works. Phys. A 597 (2022), Paper No. 127221, 19 pp

    2022

  50. [59]

    W. A. Z´ u˜ niga-Galindo.p-Adic Analysis: Stochastic Processes and Pseudo-Differential Equa- tions, De Gruyter, 2025

    2025

  51. [60]

    Albeverio, A

    S. Albeverio, A. Yu. Khrennikov, V. M. Shelkovich. Theory ofp-adicdistributions: linear and nonlinear models. Cambridge University Press, 2010

    2010

  52. [61]

    V. S. Vladimirov, I. V. Volovich, E. I. Zelenov.p-Adic analysis and mathematical physics. Singapore, World Scientific, 1994

    1994

  53. [62]

    M. H. Taibleson. Fourier analysis on local fields.Princeton University Press, 1975

    1975

  54. [63]

    Robert B. Ash. Measure, integration, and functional analysis. Academic Press, New York- London, 1972

    1972

  55. [64]

    Bogachev

    Vladimir I. Bogachev. Gaussian measures. Math. Surveys Monogr., 62. American Mathemat- ical Society, P rovidence, RI, 1998. University of Texas Rio Grande V alley, School of Mathematical & Statistical Sci- ences, One West University Blvd, Brownsville, TX 78520, United States E...

    1998

Pith tools

Reviewed August 3, 2026 · model on record in the stance chip above.