A General Method for Proving Networks Universal Approximation Property
Wei Wang

TL;DR
This paper introduces a unified, modular framework for proving the universal approximation property of diverse neural network architectures, simplifying and generalizing previous architecture-specific proofs.
Contribution
It proposes the Universal Approximation Module (UAM) as a fundamental building block, enabling a general proof of universal approximation for any network composed of these modules.
Findings
Unified framework for universal approximation proofs
Any network built from UAMs retains universal approximation
Provides a step-by-step interpretative process for network expressiveness
Abstract
Deep learning architectures are highly diverse. To prove their universal approximation properties, existing works typically rely on model-specific proofs. Generally, they construct a dedicated mathematical formulation for each architecture (e.g., fully connected networks, CNNs, or Transformers) and then prove their universal approximability. However, this approach suffers from two major limitations: first, every newly proposed architecture often requires a completely new proof from scratch; second, these proofs are largely isolated from one another, lacking a common analytical foundation. This not only incurs significant redundancy but also hinders unified theoretical understanding across different network families. To address these issues, this paper proposes a general and modular framework for proving universal approximation. We define a basic building block (comprising one or…
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 Graph Neural Networks · Generative Adversarial Networks and Image Synthesis · Advanced Neural Network Applications
