{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T15:08:42Z","timestamp":1649084922174},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,10,26]],"date-time":"2005-10-26T00:00:00Z","timestamp":1130284800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2005,12,8]]},"DOI":"10.1007\/s10852-005-1625-z","type":"journal-article","created":{"date-parts":[[2005,10,26]],"date-time":"2005-10-26T07:58:26Z","timestamp":1130313506000},"page":"355-368","source":"Crossref","is-referenced-by-count":2,"title":["Rates of Minimization of Error Functionals over Boolean Variable-Basis Functions"],"prefix":"10.1007","volume":"4","author":[{"given":"P. C.","family":"Kainen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"K??rkov??","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Sanguineti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,10,26]]},"reference":[{"key":"11625_CR1","volume-title":"Sobolev Spaces","author":"R. A. Adams","year":"1975","unstructured":"Adams, R. A.: Sobolev Spaces, Academic Press, New York, 1975."},{"key":"11625_CR2","unstructured":"Barron, A. R.: Neural net approximation, in K. Narendra (ed.), Proc. 7th Yale Workshop on Adaptive and Learning Systems, Yale University Press, 1992, pp. 69\u201372."},{"key":"11625_CR3","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1109\/18.256500","volume":"39","author":"A. R. Barron","year":"1993","unstructured":"Barron, A. R.: Universal approximation bounds for superpositions of a sigmoidal function, IEEE Trans. on Inform. Theory 39 (1993), 930\u2013945.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"11625_CR4","volume-title":"Dynamic Programming","author":"R. Bellman","year":"1957","unstructured":"Bellman, R.: Dynamic Programming, Princeton University Press, Princeton, NJ, 1957."},{"key":"11625_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-01-00923-5","volume":"39","author":"F. Cucker","year":"2001","unstructured":"Cucker, F. and Smale, S.: On the mathematical foundations of learning, Bull. Amer. Math. Soc. 39 (2001), 1\u201349.","journal-title":"Bull. Amer. Math. Soc."},{"key":"11625_CR6","volume-title":"The Approximate Minimization of Functionals","author":"J. W. Daniel","year":"1971","unstructured":"Daniel, J. W.: The Approximate Minimization of Functionals, Prentice-Hall, Englewood Cliffs, NJ, 1971."},{"key":"11625_CR7","series-title":"Lecture Notes in Math.","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0084195","volume-title":"Well-Posed Optimization Problems","author":"A. L. Dontchev","year":"1993","unstructured":"Dontchev, A. L. and Zolezzi, T.: Well-Posed Optimization Problems, Lecture Notes in Math. 1543, Springer-Verlag, Berlin, 1993."},{"key":"11625_CR8","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02678464","volume":"13","author":"M. J. Donahue","year":"1997","unstructured":"Donahue, M. J., Gurvits, L., Darken, C. and Sontag, E.: Rates of convex approximation in non-Hilbert spaces, Constr. Approx. 13 (1997), 187\u2013220.","journal-title":"Constr. Approx."},{"key":"11625_CR9","volume-title":"Calculus of Variations","author":"I. M. Gelfand","year":"1963","unstructured":"Gelfand, I. M. and Fomin, S. V.: Calculus of Variations, Prentice-Hall, Englewood Cliffs, NJ, 1963."},{"key":"11625_CR10","first-page":"97","volume-title":"Artificial Neural Networks for Speech and Vision","author":"F. Girosi","year":"1993","unstructured":"Girosi, F. and Anzellotti, G.: Rates of convsergence for radial basis functions and neural networks, in R. J. Mammone (ed.), Artificial Neural Networks for Speech and Vision, Chapman & Hall, London, 1993, pp. 97\u2013114."},{"key":"11625_CR11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1006\/jcss.1997.1506","volume":"55","author":"L. Gurvits","year":"1997","unstructured":"Gurvits, L. and Koiran, P.: Approximation and learning of convex superpositions, J. Comput. System Sci. 55 (1997), 161\u2013170.","journal-title":"J. Comput. System Sci."},{"key":"11625_CR12","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1214\/aos\/1176348546","volume":"20","author":"L. K. Jones","year":"1992","unstructured":"Jones, L. K.: A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training, Ann. Statist. 20 (1992), 608\u2013613.","journal-title":"Ann. Statist."},{"key":"11625_CR13","doi-asserted-by":"crossref","first-page":"732","DOI":"10.1137\/S1052623402401233","volume":"14","author":"P. C. Kainen","year":"2003","unstructured":"Kainen, P. C., K\u016frkov\u00e1, V. and Sanguineti, M.: Minimization of error functionals over variable-basis functions, SIAM J. Optim. 14 (2003), 732\u2013742.","journal-title":"SIAM J. Optim."},{"key":"11625_CR14","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1010916406274","volume":"101","author":"P. C. Kainen","year":"2001","unstructured":"Kainen, P. C., K\u016frkov\u00e1, V. and Vogt, A.: Continuity of approximation by neural networks in \u2112p-spaces, Ann. Oper. Res. 101 (2001), 143\u2013147.","journal-title":"Ann. Oper. Res."},{"key":"11625_CR15","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/978-1-4612-1996-5_16","volume-title":"Computer-Intensive Methods in Control and Signal Processing. The Curse of Dimensionality","author":"V. K\u016frkov\u00e1","year":"1997","unstructured":"K\u016frkov\u00e1, V.: Dimension-independent rates of approximation by neural networks, in K. Warwick and M. K\u00e1rn\u00fd (eds), Computer-Intensive Methods in Control and Signal Processing. The Curse of Dimensionality, Birkh\u00e4user, Boston, MA, 1997, pp. 261\u2013270."},{"key":"11625_CR16","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1016\/S0893-6080(97)00028-2","volume":"10","author":"V. K\u016frkov\u00e1","year":"1997","unstructured":"K\u016frkov\u00e1, V., Kainen, P. C. and Kreinovich, V.: Estimates of the number of hidden units and variation with respect to half-spaces, Neural Networks 10 (1997), 1061\u20131068.","journal-title":"Neural Networks"},{"key":"11625_CR17","doi-asserted-by":"crossref","first-page":"2659","DOI":"10.1109\/18.945285","volume":"47","author":"V. K\u016frkov\u00e1","year":"2001","unstructured":"K\u016frkov\u00e1, V. and Sanguineti, M.: Bounds on rates of variable-basis and neural-network approximation, IEEE Trans. on Inform. Theory 47 (2001), 2659\u20132665.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"11625_CR18","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1109\/18.971754","volume":"48","author":"V. K\u016frkov\u00e1","year":"2002","unstructured":"K\u016frkov\u00e1, V. and Sanguineti, M.: Comparison of worst case errors in linear and neural network approximation, IEEE Trans. on Inform. Theory 48 (2002), 264\u2013275.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"11625_CR19","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1137\/S1052623403426507","volume":"15","author":"V. K\u016frkov\u00e1","year":"2005","unstructured":"K\u016frkov\u00e1, V. and Sanguineti, M.: Error estimates for approximate optimization by the extended Ritz method, SIAM J. Optim. 15 (2005), 461\u2013487.","journal-title":"SIAM J. Optim."},{"key":"11625_CR20","doi-asserted-by":"crossref","unstructured":"K\u016frkov\u00e1, V. and Sanguineti, M.: Learning with generalization capability by kernel methods of bounded complexity, J. Complexity, in press.","DOI":"10.1016\/j.jco.2004.11.002"},{"key":"11625_CR21","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/S0893-6080(98)00039-2","volume":"11","author":"V. K\u016frkov\u00e1","year":"1998","unstructured":"K\u016frkov\u00e1, V., Savick\u00fd, P. and Hlav\u00e1\u010dkov\u00e1, K.: Representations and rates of approximation of real-valued Boolean functions by neural networks, Neural Networks 11 (1998), 651\u2013659.","journal-title":"Neural Networks"},{"key":"11625_CR22","doi-asserted-by":"crossref","first-page":"1331","DOI":"10.1137\/0222080","volume":"22","author":"E. Kushilevicz","year":"1993","unstructured":"Kushilevicz, E. and Mansour, Y.: Learning decision trees using the Fourier spectrum, SIAM J. Comput. 22 (1993), 1331\u20131348.","journal-title":"SIAM J. Comput."},{"key":"11625_CR23","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1016\/S0893-6080(05)80131-5","volume":"6","author":"M. Leshno","year":"1993","unstructured":"Leshno, M., Pinkus, A. and Schocken, S.: Multilayer feedforward networks with a nonpolynomial activation function can approximate any function, Neural Networks 6 (1993), 861\u2013867.","journal-title":"Neural Networks"},{"key":"11625_CR24","doi-asserted-by":"crossref","unstructured":"Lorentz, G. G., v. Golitschek, M. and Makovoz, Y.: Constructive Approximation. Advanced Problems, Springer-Verlag, 1996.","DOI":"10.1007\/978-3-642-60932-9"},{"key":"11625_CR25","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1006\/jath.1997.3217","volume":"95","author":"Y. Makovoz","year":"1998","unstructured":"Makovoz, Y.: Uniform approximation by neural networks, J. Approx. Theory 95 (1998), 215\u2013228.","journal-title":"J. Approx. Theory"},{"key":"11625_CR26","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1147\/rd.383.0277","volume":"38","author":"H. N. Mhaskar","year":"1994","unstructured":"Mhaskar, H. N. and Micchelli, C. A.: Dimension-independent bounds on the degree of approximation by neural networks, IBM J. Res. Devel. 38 (1994), 277\u2013283.","journal-title":"IBM J. Res. Devel."},{"key":"11625_CR27","series-title":"Nato Science Series","volume-title":"Advances in Learning Theory: Methods, Models, and Applications","author":"C. A. Micchelli","year":"2003","unstructured":"Micchelli, C. A., Xu, Y. and Ye, P.: Cucker Smale learning theory in Besov spaces, in J. Suykens, G. Horv\u00e1th, S. Basu, C. Micchelli and J. Vanderwalle (eds), Advances in Learning Theory: Methods, Models, and Applications, Nato Science Series, IOS Press, Amsterdam, 2003."},{"key":"11625_CR28","first-page":"37","volume":"15","author":"K. S. Narendra","year":"1995","unstructured":"Narendra, K. S., Balakrishnan, J. and Ciliz, K. M.: Adaptation and learning using multiple models, switching, and tuning, IEEE Control Systems Magazine 15 (1995), 37\u201351.","journal-title":"IEEE Control Systems Magazine"},{"key":"11625_CR29","volume-title":"Seminaire d'Analyse Fonctionelle, vol. I, no. 12","author":"G. Pisier","year":"1980\u201381","unstructured":"Pisier, G.: Remarques sur un resultat non publi\u00e9 de B. Maurey, in Seminaire d'Analyse Fonctionelle, vol. I, no. 12, \u00c9cole Polytechnique, Centre de Math\u00e9matiques, Palaiseau, France, 1980\u201381."},{"key":"11625_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-41583-2","volume-title":"Best Approximation in Normed Linear Spaces by Elements of Linear Subspaces","author":"I. Singer","year":"1970","unstructured":"Singer, I.: Best Approximation in Normed Linear Spaces by Elements of Linear Subspaces, Springer-Verlag, Berlin, 1970."},{"key":"11625_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0219530503000089","volume":"1","author":"S. Smale","year":"2003","unstructured":"Smale, S. and Zhou, D.-X.: Estimating the approximation error in learning theory, Analysis and Applications 1 (2003), 1\u201325.","journal-title":"Analysis and Applications"},{"key":"11625_CR32","volume-title":"Applications of Discrete and Continuous Fourier Analysis","author":"H. J. Weaver","year":"1983","unstructured":"Weaver, H. J.: Applications of Discrete and Continuous Fourier Analysis, Wiley, New York, 1983."},{"key":"11625_CR33","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1023\/A:1013662124879","volume":"112","author":"R. Zoppoli","year":"2002","unstructured":"Zoppoli, R., Sanguineti, M. and Parisini, T.: Approximating networks and extended Ritz method for the solution of functional optimization problems, J. Optim. Theory Appl. 112 (2002), 403\u2013440.","journal-title":"J. Optim. Theory Appl."}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-005-1625-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-005-1625-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-005-1625-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T13:50:02Z","timestamp":1586526602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-005-1625-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,26]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,12,8]]}},"alternative-id":["1625"],"URL":"https:\/\/doi.org\/10.1007\/s10852-005-1625-z","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10,26]]}}}