A ZeNN architecture to avoid the Gaussian trap
Not on the map. Why?
Abstract (arXiv)
We propose a new simple architecture, Zeta Neural Networks (ZeNNs), in order to overcome several shortcomings of standard multi-layer perceptrons (MLPs). Namely, in the large width limit, MLPs are non-parametric, they do not have a well-defined pointwise limit, they lose non-Gaussian attributes and become unable to perform feature learning; moreover, finite width MLPs perform poorly in learning high frequencies. The new ZeNN architecture is inspired by three simple principles from harmonic analysis: i) Enumerate the perceptons and introduce a non-learnable weight to enforce convergence; ii) Introduce a scaling (or frequency) factor; iii) Choose activation functions that lead to near orthogonal systems. We will show that these ideas allow us to fix the referred shortcomings of MLPs. In fact, in the infinite width limit, ZeNNs converge pointwise, they exhibit a rich asymptotic structure beyond Gaussianity, and perform feature learning. Moreover, when appropriate activation functions are chosen, (finite width) ZeNNs excel at learning high-frequency features of functions with low dimensional domains.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 20 of its 26 references that are in the map. First posted on arXiv 26 May 2025.
Builds on
20 of 26 references.
References · 20
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2020Implicit Neural Representations with Periodic Activation Functionscited by 2,238
- 2020Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domainscited by 2,200
- 2018On the Spectral Bias of Neural Networkscited by 1,341
- 2024KAN: Kolmogorov-Arnold Networkscited by 649
- 2017Deep Neural Networks as Gaussian Processescited by 622
- 2019On Exact Computation with an Infinitely Wide Neural Netcited by 573
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 566
- 2020On the eigenvector bias of Fourier feature networks: From regression to solving multi-scale PDEs with physics-informed neural networkscited by 284
- 2019Towards Understanding the Spectral Bias of Deep Learningcited by 174
- 2020Finite Versus Infinite Neural Networks: an Empirical Studycited by 157
- 2019Scaling Limits of Wide Neural Networks with Weight Sharing: Gaussian Process Behavior, Gradient Independence, and Neural Tangent Kernel Derivationcited by 149
8 more
- 2020Multi-scale Deep Neural Network (MscaleDNN) for Solving Poisson-Boltzmann Equation in Complex Domainscited by 79
- 2019Why bigger is not always better: on finite and infinite neural networkscited by 41
- 2023Generalization Ability of Wide Neural Networks on ℝcited by 30
- 2021The Limitations of Large Width in Neural Networks: A Deep Gaussian Process Perspectivecited by 21
- 2022Physics-Informed Neural Networks for Quantum Eigenvalue Problemscited by 18
- 2020Unsupervised Neural Networks for Quantum Eigenvalue Problemscited by 15
- 2023Wide neural networks: From non-gaussian random fields at initialization to the NTK geometry of trainingcited by 3
- 2022An Empirical Analysis of the Advantages of Finite- v.s. Infinite-Width Bayesian Neural Networkscited by 1
Built on by
Not cited yet.