An elementary proof of a universal approximation theorem
In this short note, we give an elementary proof of a universal approximation theorem for neural networks with three hidden layers and increasing, continuous, bounded activation function. The result is weaker than the best known results, but the proof is elementary in the sense that no machinery beyond undergraduate analysis is used.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Qualitative neural network approximation over R and C: Elementary proofs for analytic and polynomial activation
In this article, we prove approximation theorems in classes of deep and shallow neural networks with analytic activation functions by elementary arguments. We prove for both real and complex networks with non-polynomial …
Towards Autoformalization of Mathematics and Code Correctness: Experiments with Elementary Proofs
The ever-growing complexity of mathematical proofs makes their manual verification by mathematicians very cognitively demanding. Autoformalization seeks to address this by translating proofs written in natural language i…
Mathematical ProofsSemantic ParsingA note on Cybenko's Universal Approximation Theorem
In this short note, we point out a mistake in G.Cybenko's proof of his version of the universal approximation theorem which has been widely cited. This mistake might not be easily fixable along the idea of his proof and …
Automated Planning Techniques for Elementary Proofs in Abstract Algebra
This paper explores the application of automated planning to automated theorem proving, which is a branch of automated reasoning concerned with the development of algorithms and computer programs to construct mathematica…
Abstract AlgebraAutomated Theorem ProvingMathematical ProofsInput convex neural networks: universal approximation theorem and implementation for isotropic polyconvex hyperelastic energies
This paper presents a novel framework of neural networks for isotropic hyperelasticity that enforces necessary physical and mathematical constraints while simultaneously satisfying the universal approximation theorem. Th…