A ZeNN architecture to avoid the Gaussian trap
Lu\'is Carvalho, Jo\~ao L. Costa, Jos\'e Mour\~ao, Gon\c{c}alo Oliveira

TL;DR
The paper introduces ZeNN, a novel neural network architecture inspired by harmonic analysis principles, designed to overcome key limitations of traditional MLPs, especially in learning high-frequency features and maintaining non-Gaussian attributes.
Contribution
ZeNN architecture is a new neural network design that enforces convergence, introduces frequency scaling, and uses orthogonal activation functions to improve feature learning and overcome Gaussian limitations.
Findings
ZeNNs converge pointwise in the infinite width limit.
ZeNNs retain non-Gaussian attributes and enable feature learning.
ZeNNs excel at learning high-frequency features in low-dimensional domains.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
