1999
DOI: 10.1006/jath.1998.3304
|View full text |Cite
|
Sign up to set email alerts
|

On Best Approximation by Ridge Functions

Abstract: We consider best approximation of some function classes by the manifold M n consisting of sums of n arbitrary ridge functions. It is proved that the deviation of the Sobolev class W r, d 2 from the manifold M n in the space L 2 behaves asymptotically as n &rÂ(d&1) .

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
65
0

Year Published

1999
1999
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 104 publications
(65 citation statements)
references
References 13 publications
0
65
0
Order By: Relevance
“…In [13] (see also [18] for the case d"2) are determined upper and lower bounds on the degree of approximation from M L to some Sobolev-type spaces of functions with derivatives of all orders up to r in¸, de"ned on the unit ball in 1B. Without going into the details, as they are not relevant in what follows, they prove that for all functions in this set one can approximate in the¸norm from M L to within approximation error c n\P B\ , where c is some constant independent of n. It is also proven that for each n there exists a function in the set for which one cannot approximate from M L with approximation error less than c n\P B\ for some other constant c independent of n. In [14] it is shown that the set of functions for which this lower bound holds is of large measure.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…In [13] (see also [18] for the case d"2) are determined upper and lower bounds on the degree of approximation from M L to some Sobolev-type spaces of functions with derivatives of all orders up to r in¸, de"ned on the unit ball in 1B. Without going into the details, as they are not relevant in what follows, they prove that for all functions in this set one can approximate in the¸norm from M L to within approximation error c n\P B\ , where c is some constant independent of n. It is also proven that for each n there exists a function in the set for which one cannot approximate from M L with approximation error less than c n\P B\ for some other constant c independent of n. In [14] it is shown that the set of functions for which this lower bound holds is of large measure.…”
Section: Introductionmentioning
confidence: 99%
“…Without going into the details, as they are not relevant in what follows, they prove that for all functions in this set one can approximate in the¸norm from M L to within approximation error c n\P B\ , where c is some constant independent of n. It is also proven that for each n there exists a function in the set for which one cannot approximate from M L with approximation error less than c n\P B\ for some other constant c independent of n. In [14] it is shown that the set of functions for which this lower bound holds is of large measure. See [13,14] for details. The point we wish to make here is twofold.…”
Section: Introductionmentioning
confidence: 99%
“…This is closely related to the estimation of the number of connected components of polynomial manifolds as is done for instance in [2,7,13,14]. Let p be a real polynomial from the space P ν s , i.e., a polynomial on ν variables of degree at most s. The set of points x ∈ R ν on which a polynomial p vanishes will be denoted by Z ( p).…”
Section: The Entropy Of Polynomial Manifoldsmentioning
confidence: 99%
“…Let n > s d−1 . Denote by Q d s the subspace in P d s consisting of all homogeneous polynomials of degree s. We know (see [7]) that…”
Section: Proposition 42 Consider In the Set R Ns The Subsetmentioning
confidence: 99%
“…Models such as perceptrons, falling in the class of so-called ridge constructions, achieve this statistical modeling goal with several well-known interesting properties. Let us just mention the density or universal approximation property [Cybenko, 1989;Lin and Pinkus, 1993], and the results related to the approximation rate, including the dimension-independent upper bound [Barron, 1993;Burger and Neubauer, 2001;Makovoz, 1998], and the asymptotic expression obtained by Maiorov [1999].…”
Section: Introductionmentioning
confidence: 99%