Minimum Width for Deep, Narrow MLP: A Diffeomorphism Approach
Geonho Hwang

TL;DR
This paper establishes a geometric framework to determine the minimum width of deep, narrow MLPs needed for universal approximation, using diffeomorphism approximation and the Whitney embedding theorem.
Contribution
It introduces a purely geometrical function to compute the minimum width for universality in deep MLPs based on input and output dimensions.
Findings
Upper bound for minimum width: max(2d_x+1, d_y) + alpha(sigma)
Lower bound for width when d_x = d_y = 2: at least 4
Deep MLPs can approximate C^2-diffeomorphisms with small additional width.
Abstract
Recently, there has been a growing focus on determining the minimum width requirements for achieving the universal approximation property in deep, narrow Multi-Layer Perceptrons (MLPs). Among these challenges, one particularly challenging task is approximating a continuous function under the uniform norm, as indicated by the significant disparity between its lower and upper bounds. To address this problem, we propose a framework that simplifies finding the minimum width for deep, narrow MLPs into determining a purely geometrical function denoted as . This function relies solely on the input and output dimensions, represented as and , respectively. Two key steps support this framework. First, we demonstrate that deep, narrow MLPs, when provided with a small additional width, can approximate a -diffeomorphism. Subsequently, using this result, we prove that…
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 · Blind Source Separation Techniques · Sparse and Compressive Sensing Techniques
MethodsFocus
