English
Related papers

Related papers: Sharp uniform approximation for spectral Barron fu…

200 papers

We prove the sharp embedding between the spectral Barron space and the Besov space with embedding constants independent of the input dimension. Given the spectral Barron space as the target function space, we prove a dimension-free…

Numerical Analysis · Mathematics 2025-07-16 Yulei Liao , Pingbing Ming

We establish in this work approximation results of deep neural networks for smooth functions measured in Sobolev norms, motivated by recent development of numerical solvers for partial differential equations using deep neural networks. {Our…

Numerical Analysis · Mathematics 2022-07-25 Sean Hon , Haizhao Yang

This paper investigates the approximation properties of shallow neural networks with activation functions that are powers of exponential functions. It focuses on the dependence of the approximation rate on the dimension and the smoothness…

Machine Learning · Computer Science 2025-10-22 Jian Lu , Xiaohuang Huang

Universal approximation theorems show that neural networks can approximate any continuous function; however, the number of parameters may grow exponentially with the ambient dimension, so these results do not fully explain the practical…

Machine Learning · Computer Science 2026-01-15 Changhoon Song , Seungchan Ko , Youngjoon Hong

We study the approximation properties of shallow neural networks with an activation function which is a power of the rectified linear unit. Specifically, we consider the dependence of the approximation rate on the dimension and the…

Numerical Analysis · Mathematics 2021-12-23 Jonathan W. Siegel , Jinchao Xu

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

We study the power of deep neural networks (DNNs) with sigmoid activation function. Recently, it was shown that DNNs approximate any $d$-dimensional, smooth function on a compact set with a rate of order $W^{-p/d}$, where $W$ is the number…

Machine Learning · Computer Science 2020-10-12 Sophie Langer

Constructing neural networks for function approximation is a classical and longstanding topic in approximation theory. In this paper, we aim at constructing deep neural networks (deep nets for short) with three hidden layers to approximate…

Information Theory · Computer Science 2020-01-14 Xia Liu

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

Approximation capabilities of shallow neural networks (SNNs) form an integral part in understanding the properties of deep neural networks (DNNs). In the study of these approximation capabilities some very popular classes of target…

Machine Learning · Computer Science 2023-12-15 Ahmed Abdeljawad , Thomas Dittrich

In this paper, we establish a neural network to approximate functionals, which are maps from infinite dimensional spaces to finite dimensional spaces. The approximation error of the neural network is $O(1/\sqrt{m})$ where $m$ is the size of…

Numerical Analysis · Mathematics 2023-01-02 Yahong Yang , Yang Xiang

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

We study approximation and statistical learning properties of deep ReLU networks under structural assumptions that mitigate the curse of dimensionality. We prove minimax-optimal uniform approximation rates for $s$-H\"older smooth functions…

Statistics Theory · Mathematics 2026-02-06 Thomas Nagler , Sophie Langer

This paper investigates the approximation properties of deep neural networks with piecewise-polynomial activation functions. We derive the required depth, width, and sparsity of a deep neural network to approximate any H\"{o}lder smooth…

Numerical Analysis · Mathematics 2022-12-06 Denis Belomestny , Alexey Naumov , Nikita Puchkin , Sergey Samsonov

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

Neural networks are widely used to approximate unknown functions in control. A common neural network architecture uses a single hidden layer (i.e. a shallow network), in which the input parameters are fixed in advance and only the output…

Machine Learning · Computer Science 2024-10-08 Andrew Lamperski , Siddharth Salapaka

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

In this work, we consider the approximation capabilities of shallow neural networks in weighted Sobolev spaces for functions in the spectral Barron space. The existing literature already covers several cases, in which the spectral Barron…

Machine Learning · Computer Science 2024-11-07 Ahmed Abdeljawad , Thomas Dittrich

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 examine the necessary and sufficient complexity of neural networks to approximate functions from different smoothness spaces under the restriction of encodable network weights. Based on an entropy argument, we start by proving lower…

Functional Analysis · Mathematics 2020-09-21 Ingo Gühring , Mones Raslan
‹ Prev 1 2 3 10 Next ›