English
Related papers

Related papers: Simultaneous Neural Network Approximation for Smoo…

200 papers

This paper establishes the (nearly) optimal approximation error characterization of deep rectified linear unit (ReLU) networks for smooth functions in terms of both width and depth simultaneously. To that end, we first prove that…

Machine Learning · Computer Science 2021-11-03 Jianfeng Lu , Zuowei Shen , Haizhao Yang , Shijun Zhang

Smooth activation functions are ubiquitous in modern deep learning, yet their theoretical advantages over non-smooth counterparts remain poorly understood. In this work, we study both approximation and statistical properties of neural…

Machine Learning · Statistics 2026-03-03 Yuhao Liu , Zilin Wang , Lei Wu , Shaobo Zhang

There has been a growing interest in expressivity of deep neural networks. However, most of the existing work about this topic focuses only on the specific activation function such as ReLU or sigmoid. In this paper, we investigate the…

Machine Learning · Statistics 2019-07-24 Ilsang Ohn , Yongdai Kim

We analyze approximation rates of deep ReLU neural networks for Sobolev-regular functions with respect to weaker Sobolev norms. First, we construct, based on a calculus of ReLU networks, artificial neural networks with ReLU activation…

Functional Analysis · Mathematics 2019-02-22 Ingo Gühring , Gitta Kutyniok , Philipp Petersen

Deep neural networks with rectified linear units (ReLU) are getting more and more popular due to their universal representation power and successful applications. Some theoretical progress regarding the approximation power of deep ReLU…

Numerical Analysis · Mathematics 2020-02-28 Bo Li , Shanshan Tang , Haijun Yu

In this paper it is shown that $C_\beta$-smooth functions can be approximated by deep neural networks with ReLU activation function and with parameters $\{0,\pm \frac{1}{2}, \pm 1, 2\}$. The $l_0$ and $l_1$ parameter norms of considered…

Machine Learning · Statistics 2021-07-26 Aleksandr Beknazaryan

This paper studies the problem of how efficiently functions in the Sobolev spaces $\mathcal{W}^{s,q}([0,1]^d)$ and Besov spaces $\mathcal{B}^s_{q,r}([0,1]^d)$ can be approximated by deep ReLU neural networks with width $W$ and depth $L$,…

Machine Learning · Statistics 2025-07-21 Yunfei Yang

We study the expressive power of deep ReLU neural networks for approximating functions in dilated shift-invariant spaces, which are widely used in signal processing, image processing, communications and so on. Approximation error bounds are…

Machine Learning · Computer Science 2023-12-05 Yunfei Yang , Zhen Li , Yang Wang

This paper quantitatively characterizes the approximation power of deep feed-forward neural networks (FNNs) in terms of the number of neurons. It is shown by construction that ReLU FNNs with width $\mathcal{O}\big(\max\{d\lfloor…

Numerical Analysis · Mathematics 2021-01-15 Zuowei Shen , Haizhao Yang , Shijun Zhang

This paper concentrates on the approximation power of deep feed-forward neural networks in terms of width and depth. It is proved by construction that ReLU networks with width $\mathcal{O}\big(\max\{d\lfloor N^{1/d}\rfloor,\, N+2\}\big)$…

Machine Learning · Computer Science 2021-12-15 Zuowei Shen , Haizhao Yang , Shijun Zhang

This work explores the neural network approximation capabilities for functions within the spectral Barron space $\mathscr{B}^s$, where $s$ is the smoothness index. We demonstrate that for functions in $\mathscr{B}^{1/2}$, a shallow neural…

Numerical Analysis · Mathematics 2025-07-10 Yulei Liao , Pingbing Ming , Hao Yu

We study expressive power of shallow and deep neural networks with piece-wise linear activation functions. We establish new rigorous upper and lower bounds for the network complexity in the setting of approximations in Sobolev spaces. In…

Machine Learning · Computer Science 2017-05-02 Dmitry Yarotsky

Neural networks activated by the rectified linear unit (ReLU) play a central role in the recent development of deep learning. The topic of approximating functions from H\"older spaces by these networks is crucial for understanding the…

Machine Learning · Computer Science 2023-07-25 Tong Mao , Ding-Xuan Zhou

This paper establishes the nearly optimal rate of approximation for deep neural networks (DNNs) when applied to Korobov functions, effectively overcoming the curse of dimensionality. The approximation results presented in this paper are…

Numerical Analysis · Mathematics 2023-11-09 Yahong Yang , Yulong Lu

We consider approximations of general continuous functions on finite-dimensional cubes by general deep ReLU neural networks and study the approximation rates with respect to the modulus of continuity of the function and the total number of…

Neural and Evolutionary Computing · Computer Science 2018-06-08 Dmitry Yarotsky

We study the necessary and sufficient complexity of ReLU neural networks---in terms of depth and number of weights---which is required for approximating classifier functions in $L^2$. As a model class, we consider the set $\mathcal{E}^\beta…

Functional Analysis · Mathematics 2018-05-23 Philipp Petersen , Felix Voigtlaender

Recently there has been much interest in understanding why deep neural networks are preferred to shallow networks. We show that, for a large class of piecewise smooth functions, the number of neurons needed by a shallow network to…

Machine Learning · Computer Science 2017-03-07 Shiyu Liang , R. Srikant

We study the computation complexity of deep ReLU (Rectified Linear Unit) neural networks for the approximation of functions from the H\"older-Zygmund space of mixed smoothness defined on the $d$-dimensional unit cube when the dimension $d$…

Numerical Analysis · Mathematics 2021-07-26 Dinh Dũng , Van Kien Nguyen

We consider the approximation rates of shallow neural networks with respect to the variation norm. Upper bounds on these rates have been established for sigmoidal and ReLU activation functions, but it has remained an important open problem…

Machine Learning · Statistics 2021-09-10 Jonathan W. Siegel , Jinchao Xu

We present SiLU network constructions whose approximation efficiency depends critically on proper hyperparameter tuning. For the square function $x^2$, with optimally chosen shift $a$ and scale $\beta$, we achieve approximation error…

Machine Learning · Computer Science 2026-02-24 Koffi O. Ayena
‹ Prev 1 2 3 10 Next ›