Replacing points by compacta in neural network approximation

DOI10.1016/j.jfranklin.2004.03.001zbMath1075.54013OpenAlexW2077948866MaRDI QIDQ705939

Paul C. Kainen

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

zbMATH Keywords

Cartesian productnonlinear approximationapproximative compactnessproximinal setF-spaceHeaviside neural network

Mathematics Subject Classification ID

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

Related Items (3)

Best approximation on probabilistic normed spaces ⋮ On best approximation in fuzzy metric spaces ⋮ Approximative compactness of linear combinations of characteristic functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Well-posed optimization problems
• Existence of best approximations
• The concept of approximative compactness and alternative versions of it
• Best approximation by linear combinations of characteristic functions of half-spaces.
• Optimal disturbance rejection for nonlinear control systems
• Minimization of Error Functionals over Variable-Basis Functions

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