On best approximation by multivariate ridge functions with applications to generalized translation networks
Abstract
In this paper, we prove sharp upper and lower bounds for the approximation of Sobolev functions by sums of multivariate ridge functions, i.e., for approximation by functions of the form Rd x Σk=1n k(Ak x) ∈ R with k : R R and Ak ∈ R × d. We show that the order of approximation asymptotically behaves as n-r/(d-), where r is the regularity (order of differentiability) of the Sobolev functions to be approximated. Our lower bound even holds when approximating L∞-Sobolev functions of regularity r with error measured in L1, while our upper bound applies to the approximation of Lp-Sobolev functions in Lp for any 1 ≤ p ≤ ∞. These bounds generalize well-known results regarding the approximation properties of univariate ridge functions to the multivariate case. We use our results to obtain sharp asymptotic bounds for the approximation of Sobolev functions using generalized translation networks and complex-valued neural networks.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.