PubMed Health⌕ Search

Biomedical subjects

H N Mhaskar

Publications and source records attributed to H N Mhaskar.

3 recordsLinked to original sources

When is approximation by Gaussian networks necessarily a linear process?

Let s > or = 1 be an integer. A Gaussian network is a function on Rs of the form [Formula: see text]. The minimal separation among the centers, defined by (1/2) min(1 < or = j not = k < or = N) [Formula: see text], is an important characteristic of the network that determines the stability of interpolation by Gaussian networks, the degree of approximation by such networks, etc. Let (within this abstract only) the set of all Gaussian networks with minimal separation exceeding 1/m be denoted by Gm. We prove that for functions [Formula: see text] such that [Formula: see text], if the degree of L2(nonlinear) approximation of [Formula: see text] from Gm is [Formula: see text] then necessarily the degree of approximation of [Formula: see text] by (rectangular) partial sums of degree m2 of the Hermite expansion of [Formula: see text] is also [Formula: see text]. Moreover, Gaussian networks in Gm having fixed centers in a ball of radius [Formula: see text] and coefficients being linear functionals of [Formula: see text] can be constructed to yield the same degree of approximation. Similar results are proved for the Lp norms, 1 < or = p < or =[Formula: see text] but with the condition that the number of neurons N, should satisfy logN = [Formula: see text](m2).

Humans↗

Zonal function network frames on the sphere.

We introduce a class of zonal function network frames suitable for analyzing data collected at scattered sites on the surface of the unit sphere of a Euclidean space. Our frames consist of zonal function networks and are well localized. The frames belonging to higher and higher scale wavelet spaces have more and more vanishing polynomial moments. The main technique is applicable in the general setting of separable Hilbert spaces, in which context, we study the construction of new frames by perturbing an orthonormal basis.

Neural Networks, Computer↗

Neural networks for functional approximation and system identification.

We construct generalized translation networks to approximate uniformly a class of nonlinear, continuous functionals defined on Lp ([-1, 1]s) for integer s > or = 1, 1 < or = p < infinity, or C ([-1, 1]s). We obtain lower bounds on the possible order of approximation for such functionals in terms of any approximation process depending continuously on a given number of parameters. Our networks almost achieve this order of approximation in terms of the number of parameters (neurons) involved in the network. The training is simple and noniterative; in particular, we avoid any optimization such as that involved in the usual backpropagation.

Algorithms↗