LpL^p sampling numbers for the Fourier-analytic Barron space

preprint2022arXivOpen access

Abstract

In this paper, we consider Barron functions f:[0,1]d→Rf : [0,1]^d \to \mathbb{R} of smoothness σ>0σ> 0, which are functions that can be written as f(x)=∫RdF(ξ) e2πi⟨x,ξ⟩ dξwith∫Rd∣F(ξ)∣⋅(1+∣ξ∣)σ dξ<∞. f(x) = \int_{\mathbb{R}^d} F(ξ) \, e^{2 πi \langle x, ξ\rangle} \, d ξ \quad \text{with} \quad \int_{\mathbb{R}^d} |F(ξ)| \cdot (1 + |ξ|)^σ \, d ξ< \infty. For σ=1σ= 1, these functions play a prominent role in machine learning, since they can be efficiently approximated by (shallow) neural networks without suffering from the curse of dimensionality. For these functions, we study the following question: Given mm point samples f(x1),…,f(xm)f(x_1),\dots,f(x_m) of an unknown Barron function f:[0,1]d→Rf : [0,1]^d \to \mathbb{R} of smoothness σσ, how well can ff be recovered from these samples, for an optimal choice of the sampling points and the reconstruction procedure? Denoting the optimal reconstruction error measured in LpL^p by sm(σ;Lp)s_m (σ; L^p), we show that m−1max⁡{p,2}−σd≲sm(σ;Lp)≲(ln⁡(e+m))α(σ,d)/p⋅m−1max⁡{p,2}−σd, m^{- \frac{1}{\max \{ p,2 \}} - \fracσ{d}} \lesssim s_m(σ;L^p) \lesssim (\ln (e + m))^{α(σ,d) / p} \cdot m^{- \frac{1}{\max \{ p,2 \}} - \fracσ{d}} , where the implied constants only depend on σσ and dd and where α(σ,d)α(σ,d) stays bounded as d→∞d \to \infty.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.