The minimal width of universal $p$-adic ReLU neural networks
S\'andor Z. Kiss, Ambrus P\'al

TL;DR
This paper establishes the smallest width required for $p$-adic ReLU neural networks to universally approximate continuous functions over compact sets, extending neural network theory into the $p$-adic number domain.
Contribution
It determines the minimal width of $p$-adic neural networks with universal approximation capabilities, a novel extension of neural network theory to $p$-adic analysis.
Findings
Identifies the minimal width for $p$-adic neural networks to approximate functions.
Provides conditions under which $p$-adic ReLU networks are universal.
Extends neural network approximation theory into the $p$-adic setting.
Abstract
We determine the minimal width of -adic neural networks with the universal approximation property for continuous -valued functions on compact open subsets with respect to the norms and the norm, where the activation function is a natural -adic analogue of the ReLU function.
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
Topicsadvanced mathematical theories · Polynomial and algebraic computation · Stochastic processes and statistical mechanics
