Skip to content

Minimax rates for learning spectral Barron functions by deep ReLU neural networks

Sep 2026 · 0 citations · 55 references
Mathematics Computer Science

TL;DR

It is shown that d-dimensional spectral Barron functions with smoothness index $s>0$ can be approximated by deep ReLU neural networks with approximation rate $\widetilde{\mathcal{O}} (S^{-\frac{1}{2}-\frac{s}{d}})$, and it is proved that this convergence rate is minimax optimal up to logarithmic factors.

Abstract

We study how well deep neural networks approximate and learn spectral Barron functions. Recent studies have shown that these function classes can be efficiently approximated by shallow neural networks without suffering from the curse of dimensionality. We complement these results by providing new approximation bounds for deep networks with ReLU activation and establishing the minimax rates for learning these function classes. Specifically, we show that $d$-dimensional spectral Barron functions with smoothness index $s>0$ can be approximated by deep ReLU neural networks with approximation rate $\widetilde{\mathcal{O}} (S^{-\frac{1}{2}-\frac{s}{d}})$, where $S$ denotes the number of nonzero parameters in the network. Using this approximation result, we further show that deep ReLU neural networks can learn spectral Barron functions in a fast rate $n^{-\frac{d+2s}{2d+2s}}$ with $n$ training samples. Finally, we prove that this convergence rate is minimax optimal up to logarithmic factors.

View source

Similar papers

#machine learning Preprint Oct 2026

Optimal approximation of smooth functions by ReLU neural networks

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 Lipschitz case, existing constructions remain separated from the information-theoretic efficiency limit. This article closes the gap for every $s>0$ and $D\ge1$: networks with wi...

Thomas Nagler · 0 citations
#machine learning Preprint Sep 2026

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

The universal approximation property of dropout neural networks does not by itself describe the network size required for an accurate random realization. In this work, we study approximation of the unit ball of $W^{n,\infty}([0,1]^d)$ by ReLU networks whose edges are retained independently with probability $p$. The app...

Jian Yao · 0 citations
#machine learning Preprint Sep 2026

Shallow neural network approximation in mixed Sobolev spaces

We investigate the best $L_2$ approximation of mixed Sobolev spaces by shallow neural networks with $n$ neurons and general activation functions. We first establish an activation-independent Fourier-block principle: if an activation has univariate approximation order $\rho$ in the sense of the Fourier-block property, t...

Yuwen Li, Guozhi Zhang · 0 citations
Preprint Oct 2026

Fully Deterministic Shallow Neural Networks with Localized Activations. Part II: Condition Number Estimates

We prove positive definiteness and quantitative condition-number bounds for continuous Sobolev Gram matrices of deterministic shallow networks with Gaussian and tanh-difference activations. The prescribed feature families include the optimal Sobolev approximation constructions of Part I. On every fixed nonempty bounded...

R. Bi, Wei-Bing Deng · 0 citations
#machine learning Preprint Sep 2026

Nearly Tight Rademacher Bounds for Sparsely Activated Neural Networks

A spherical-cap construction proves the latter claim without assuming sparsity merely on the sampling support without assuming sparsity merely on the sampling support, and obtains agnostic minimax excess-risk bounds of order up to logarithms.

Xiao-Yu Li, Zhizhou Sha, Jiao-Jiao Jiang et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.