Replacing points by compacta in neural network approximation

Journal of the Franklin Institute

Volumn 341, Issue 4, 2004, Pages 391-399

  Kainen, Paul C ^a  

^a GEORGETOWN UNIVERSITY   (United States)

Author keywords

Approximative compactness; Cartesian product; Distance minimizing sequence; F space; Heaviside neural network; Nonlinear approximation; Pointwise sum; Proximinal set; Regularization; Satisficing; Well posedness

Indexed keywords

APPROXIMATION THEORY; COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; HIERARCHICAL SYSTEMS; LINEAR EQUATIONS; SET THEORY; THEOREM PROVING;

APPROXIMATIVE COMPACTNESS; CARTESIAN PRODUCT; DISTANCE MINIMIZING SEQUENCE; F-SPACE; HEAVISIDE NEURAL NETWORK; NONLINEAR APPROXIMATION; POINTWISE SUM; PROXIMAL SET; REGULARIZATION; WELLPOSEDNESS;

NEURAL NETWORKS;

EID: 2542442747     PISSN: 00160032     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jfranklin.2004.03.001     Document Type: Article

References (21)

1. Dugundji J. Topology. 1966;Allyn and Bacon, Boston.
2. Kainen P.C., Kůrková V., Sanguineti M. Minimization of error functionals over variable basis functions. SIAM J. Optim. 14:2003;732-742.
3. C. Kuratowski, Topology, Vol. I, Academic Press, New York, 1966.
4. Dunford N., Schwartz J.T. Linear Operators, Part I. 1967;Interscience Publication, New York.
5. Gaal S.A. Point Set Topology. 1964;Academic Press, New York.
6. Day M.M. Normed Linear Spaces. 1962;Academic Press, New York.
7. Dontchev A.L., Zolezzi T. Well-Posed Optimization Problems. Lecture Notes in Mathematics. Vol. 1543:1993;Springer, Berlin, Heidelberg.
8. Efimov N.V., Stečkin S.B. Approximative compactness and Čebyshev sets. Dokl. Akad. Nauk SSSR. 140:1961;522-524. (in Russian) (English transl. in Soviet Math. Dokl. 2, 1961).
9. Efimov N.V., Stečkin S.B. Approximative compactness and Čebyshev sets. Dokl. Akad. Nauk SSSR. 140:1961;522-524. (in Russian) (English transl. in Soviet Math. Dokl. 2, 1961).
10. Vlasov L.P. The concept of approximative compactness and its variants. Mat. Zametki. 16:1974;337-348. (English transl. Math Notes 16 (1974) 786-792).
11. Vlasov L.P. The concept of approximative compactness and its variants. Mat. Zametki. 16:1974;337-348. (English transl. Math Notes 16 (1974) 786-792).
12. Deutsch F. Existence of best approximations. J. Approximation Theory. 28:1980;132-154.
13. Akhieser N.I. Theory of Approximation. 1992;Dover, New York. (orig. 1956).
14. Singer I. Best Approximation in Normed Linear Spaces by Elements of Linear Subspaces. 1970;Springer, Berlin.
15. Nicolescu M. Sur la meillieure approximation d'une fonction donnée par les fonctions d'une famille donnée. Bul. Fac. Sti. Cernauti. 12:1938;120-128.
16. Holmes R.B. A Course on Optimization and Best Approximation. Lecture Notes in Mathematics. Vol. 257:1972;Springer, Berlin.
17. Kainen P.C., Kůrková V., Vogt A. Best approximation by Heaviside perceptron networks. Neural Networks. 13:2000;695-697.
18. Kainen P.C., Kůrková V., Vogt A. Best approximation by linear combinations of characteristic functions of half-spaces. J. Approximation Theory. 122:2003;151-159.
19. Poggio T., Smale S. The mathematics of learning. dealing with data Notices Amer. Math. Soc. 50:2003;536-544.
20. V. Kůrková, M. Sanguineti, Learning with generalization capability by kernel methods of bounded complexity. Research report ICS-2003-901, submitted for publication.
21. de Figuierdo R.J.P., Chen G. Optimal disturbance rejection for nonlinear control systems. IEEE Trans. Automat. Control. 34:1989;1242-1248.