arXiv Machine Learning September 11, 2026 By Tong Mao, Jinchao Xu

Configuration-Dependent Lower Bounds for Approximation by Shallow ReLU$^k$ Networks on the Sphere

Read the original on arXiv Machine Learning →

arXiv:2510. 04060v3 Announce Type: replace-cross Abstract: We establish two related but logically distinct results for shallow ReLU$^k$ neural networks on the unit sphere $\SS^d$.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jul 14

Approximation of Analytic Functions by ReLU Neural Networks with Adjustable Depth and Width

arXiv:2607. 10589v1 Announce Type: cross Abstract: In contrast to most studies on neural network approximation theory that characterize results through a single parameter, such as the total number of network parameters, \cite{shen2020deep} pioneered the characterization of approximation rates as a joint function of the width parameter $N$ and the depth parameter $L$, thereby granting greater architectural flexibility.

By Yanming Lai, Defeng Sun, Yang Wang

arXiv Machine Learning

Oct 19

Optimal approximation of smooth functions by ReLU neural networks

arXiv:2610.22693v1 Announce Type: cross Abstract: We study uniform approximation of the H\"older ball $\mathcal H_1^s([0,1]^D)$ by fully connected ReLU networks. Except in the one-dimensional Lipschi...

By Thomas Nagler

Hugging Face Trending Papers

Sep 17

Error bounds in Sobolev norms for approximations with norm constrained ReLU neural networks

Recent studies have shown that smooth functions can be well approximated by ReLU neural networks with path norm constraint on the weights. We extend these results from uniform approximation to approximation in Sobolev norm.

arXiv Machine Learning

Sep 18

Error bounds in Sobolev norms for approximations with norm constrained ReLU neural networks

arXiv:2609. 19937v1 Announce Type: cross Abstract: Recent studies have shown that smooth functions can be well approximated by ReLU neural networks with path norm constraint on the weights.

By Xianjun Li, Yunfei Yang

arXiv Statistics ML

6d ago

Sharp Generalization for Nonparametric Regression in Interpolation Space by Over-Parameterized Neural Networks Trained with Preconditioned Gradient Descent and Early Stopping

arXiv:2407.11353v5 Announce Type: replace Abstract: We study nonparametric regression using an over-parameterized two-layer neural network trained with algorithmic guarantees in this paper. We consid...

By Yingzhen Yang, Ping Li

arXiv Machine Learning

Oct 5

Approximation Property of Dropout Neural Networks: Sobolev Rates and Confidence Bounds

arXiv:2610.02253v1 Announce Type: new Abstract: The universal approximation property of dropout neural networks does not by itself describe the network size required for an accurate random realizatio...

By Jia-He Yao

One email a morning, machine-written

Related stories

Approximation of Analytic Functions by ReLU Neural Networks with Adjustable Depth and Width

Optimal approximation of smooth functions by ReLU neural networks

Error bounds in Sobolev norms for approximations with norm constrained ReLU neural networks

Error bounds in Sobolev norms for approximations with norm constrained ReLU neural networks

Sharp Generalization for Nonparametric Regression in Interpolation Space by Over-Parameterized Neural Networks Trained with Preconditioned Gradient Descent and Early Stopping

Approximation Property of Dropout Neural Networks: Sobolev Rates and Confidence Bounds