TY - JOUR

T1 - Capturing Ridge Functions in High Dimensions from Point Queries

AU - Cohen, Albert

AU - Daubechies, Ingrid

AU - DeVore, Ronald

AU - Kerkyacharian, Gerard

AU - Picard, Dominique

N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledged KAUST grant number(s): KUS-C1-016-04
Acknowledgements: This research was supported by the Office of Naval Research Contracts ONR-N00014-08-1-1113, ONR N00014-09-1-0107; the AFOSR Contract FA95500910500; the ARO/DoD Contract W911NF-07-1-0185; the NSF Grant DMS 0915231; the French-German PROCOPE contract 11418YB; the Agence Nationale de la Recherche (ANR) project ECHANGE (ANR-08-EMER-006); the excellence chair of the Fondation "Sciences Mathematiques de Paris" held by Ronald DeVore. This publication is based on work supported by Award No. KUS-C1-016-04, made by King Abdullah University of Science and Technology (KAUST).
This publication acknowledges KAUST support, but has no KAUST affiliated authors.

PY - 2011/12/21

Y1 - 2011/12/21

N2 - Constructing a good approximation to a function of many variables suffers from the "curse of dimensionality". Namely, functions on ℝ N with smoothness of order s can in general be captured with accuracy at most O(n -s/N) using linear spaces or nonlinear manifolds of dimension n. If N is large and s is not, then n has to be chosen inordinately large for good accuracy. The large value of N often precludes reasonable numerical procedures. On the other hand, there is the common belief that real world problems in high dimensions have as their solution, functions which are more amenable to numerical recovery. This has led to the introduction of models for these functions that do not depend on smoothness alone but also involve some form of variable reduction. In these models it is assumed that, although the function depends on N variables, only a small number of them are significant. Another variant of this principle is that the function lives on a low dimensional manifold. Since the dominant variables (respectively the manifold) are unknown, this leads to new problems of how to organize point queries to capture such functions. The present paper studies where to query the values of a ridge function f(x)=g(a · x) when both a∈ℝ N and g ∈ C[0,1] are unknown. We establish estimates on how well f can be approximated using these point queries under the assumptions that g ∈ C s[0,1]. We also study the role of sparsity or compressibility of a in such query problems. © 2011 Springer Science+Business Media, LLC.

AB - Constructing a good approximation to a function of many variables suffers from the "curse of dimensionality". Namely, functions on ℝ N with smoothness of order s can in general be captured with accuracy at most O(n -s/N) using linear spaces or nonlinear manifolds of dimension n. If N is large and s is not, then n has to be chosen inordinately large for good accuracy. The large value of N often precludes reasonable numerical procedures. On the other hand, there is the common belief that real world problems in high dimensions have as their solution, functions which are more amenable to numerical recovery. This has led to the introduction of models for these functions that do not depend on smoothness alone but also involve some form of variable reduction. In these models it is assumed that, although the function depends on N variables, only a small number of them are significant. Another variant of this principle is that the function lives on a low dimensional manifold. Since the dominant variables (respectively the manifold) are unknown, this leads to new problems of how to organize point queries to capture such functions. The present paper studies where to query the values of a ridge function f(x)=g(a · x) when both a∈ℝ N and g ∈ C[0,1] are unknown. We establish estimates on how well f can be approximated using these point queries under the assumptions that g ∈ C s[0,1]. We also study the role of sparsity or compressibility of a in such query problems. © 2011 Springer Science+Business Media, LLC.

UR - http://hdl.handle.net/10754/597725

UR - http://link.springer.com/10.1007/s00365-011-9147-6

UR - http://www.scopus.com/inward/record.url?scp=84857356357&partnerID=8YFLogxK

U2 - 10.1007/s00365-011-9147-6

DO - 10.1007/s00365-011-9147-6

M3 - Article

VL - 35

SP - 225

EP - 243

JO - Constructive Approximation

JF - Constructive Approximation

SN - 0176-4276

IS - 2

ER -