vix.ing · top · new · best · stats · spec

Minimum Width of Deep Narrow Networks for Universal Approximation

2025/11/10 by Yang, Xiao-Song, Zhou, Qi, Zhou, Xuan
Computer Science · #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning and ELM #Neural Networks and Applications #Stochastic Gradient Optimization Techniques

paper · doi:10.48550/arxiv.2511.06837

openalex publication_date 2025/11/10 · openalex created_date 2025/11/12 · openalex updated_date 2026/07/28

Abstract

Determining the minimum width of fully connected neural networks has become a fundamental problem in recent theoretical studies of deep neural networks. In this paper, we study the lower bounds and upper bounds of the minimum width required for fully connected neural networks in order to have universal approximation capability, which is important in network design and training. We show that wmin≤max(2dx+1, dy) also holds true for networks with ELU, SELU activation functions, and the upper bound of this inequality is attained when dy=2dx, where dx, dy denote the input and output dimensions, respectively. Besides, we show that dx+1≤ wmin≤ dx+dy for networks with LeakyReLU, ELU, CELU, SELU, Softplus activation functions, by proving that ReLU activation function can be approximated by these activation functions. In addition, in the case that the activation function is injective or can be uniformly approximated by a sequence of injective functions (e.g., ReLU), we present a new proof of the inequality wmin≥ dy+1_dx

Citations

Related