Replacing points by compacta in neural network approximation

DOI10.1016/J.JFRANKLIN.2004.03.001MaRDI QIDQ705939zbMATH OpenOpenAlexFDO

Publication date 16 February 2005

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jfranklin.2004.03.001

approximative compactness Cartesian product F-space Heaviside neural network nonlinear approximation proximinal set

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Product spaces in general topology (54B10) Metric spaces, metrizability (54E35) Learning and adaptive systems in artificial intelligence (68T05)

Review text

Dugundji remarks that in Hausdorff spaces, ``the compact subsets behave as points do and have the same separation properties. That is, compacta can replace points in some mathematical assertions. In the paper under review this paradigm of Dugundji is applied to some problems which arise in nonlinear approximation. The author prove statements about realization of distances by pairs of points in metric spaces, about approximative compactness in Cartesian products of metric spaces, about various type of compactness of sums of two sets in linear metric spaces. A typical result is Theorem~5.1: Let \(S\) and \(P\) be nonempty subsets of metric spaces \(X\) and \(Y\), respectively. Suppose that \(P\) is compact. If \(S\) is boundedly compact or approximatively compact, then so is \({S\times P}\). Applications are given to approximation of \({L_p}\)-functions on the \(d\)-dimensional cube, \({1\leq p<\infty}\), by linear combinations of half-space characteristic functions; i.e., by Heaviside perceptron networks.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: Replacing points by compacta in neural network approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705939)