In this paper, we consider Barron functions of smoothness , which are functions that can be written as For , 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 point samples of an unknown Barron function of smoothness , how well can be recovered from these samples, for an optimal choice of the sampling points and the reconstruction procedure? Denoting the optimal reconstruction error measured in by , we show that where the implied constants only depend on and and where stays bounded as .

生成讲解博客的中文版本

生成AI智能校验的中文版本