{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:13:52Z","timestamp":1725538432743},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642049200"},{"type":"electronic","value":"9783642049217"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04921-7_2","type":"book-chapter","created":{"date-parts":[[2009,9,22]],"date-time":"2009-09-22T07:46:25Z","timestamp":1253605585000},"page":"11-21","source":"Crossref","is-referenced-by-count":2,"title":["On Tractability of Neural-Network Approximation"],"prefix":"10.1007","author":[{"given":"Paul C.","family":"Kainen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u011bra","family":"K\u016frkov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcello","family":"Sanguineti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","volume-title":"Complexity and Information","author":"J.F. Traub","year":"1999","unstructured":"Traub, J.F., Werschulz, A.G.: Complexity and Information. Cambridge University Press, Cambridge (1999)"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1006\/jcom.2001.0601","volume":"17","author":"G.W. Wasilkowski","year":"2001","unstructured":"Wasilkowski, G.W., Wo\u017aniakowski, H.: Complexity of weighted approximation over \n                    \n                      \n                    \n                    $\\Re^d$\n                  . J. of Complexity\u00a017, 722\u2013740 (2001)","journal-title":"J. of Complexity"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1006\/jcom.1994.1004","volume":"10","author":"H. Wo\u017aniakowski","year":"1994","unstructured":"Wo\u017aniakowski, H.: Tractability and strong tractability of linear multivariate problems. J. of Complexity\u00a010, 96\u2013128 (1994)","journal-title":"J. of Complexity"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/j.jco.2003.11.004","volume":"20","author":"H.N. Mhaskar","year":"2004","unstructured":"Mhaskar, H.N.: On the tractability of multivariate integration and approximation by neural networks. J. of Complexity\u00a020, 561\u2013590 (2004)","journal-title":"J. of Complexity"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.jco.2008.08.001","volume":"25","author":"P.C. Kainen","year":"2009","unstructured":"Kainen, P.C., K\u016frkov\u00e1, V., Sanguineti, M.: Complexity of Gaussian radial basis networks approximating smooth functions. J. of Complexity\u00a025, 63\u201374 (2009)","journal-title":"J. of Complexity"},{"key":"2_CR6","doi-asserted-by":"publisher","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 Transactions on Information Theory\u00a039, 930\u2013945 (1993)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/1008328.1008329","volume":"8","author":"D.E. Knuth","year":"1976","unstructured":"Knuth, D.E.: Big omicron and big omega and big theta. SIGACT News\u00a08(2), 18\u201324 (1976)","journal-title":"SIGACT News"},{"key":"2_CR8","volume-title":"Dynamic Programming","author":"R. Bellman","year":"1957","unstructured":"Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jat.2006.12.009","volume":"147","author":"P.C. Kainen","year":"2007","unstructured":"Kainen, P.C., K\u016frkov\u00e1, V., Vogt, A.: A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves. J. of Approximation Theory\u00a0147, 1\u201310 (2007)","journal-title":"J. of Approximation Theory"},{"key":"2_CR10","doi-asserted-by":"publisher","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., Hlav\u00e1\u010dkov\u00e1, K.: Representations and rates of approximation of real\u2013valued Boolean functions by neural networks. Neural Networks\u00a011, 651\u2013659 (1998)","journal-title":"Neural Networks"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-87536-9_2","volume-title":"Artificial Neural Networks - ICANN 2008","author":"B. Beliczynski","year":"2008","unstructured":"Beliczynski, B., Ribeiro, B.: Several enhancements to hermite-based approximation of one-variable functions. In: K\u016frkov\u00e1, V., Neruda, R., Koutn\u00edk, J. (eds.) ICANN 2008, Part I. LNCS, vol.\u00a05163, pp. 11\u201320. Springer, Heidelberg (2008)"},{"key":"2_CR12","unstructured":"Barron, A.R.: Neural net approximation. In: Narendra, K. (ed.) Proc. 7th Yale Workshop on Adaptive and Learning Systems, pp. 69\u201372. Yale University Press (1992)"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1109\/18.256506","volume":"39","author":"L. Breiman","year":"1993","unstructured":"Breiman, L.: Hinging hyperplanes for regression, classification and function approximation. IEEE Transactions on Information Theory\u00a039, 999\u20131013 (1993)","journal-title":"IEEE Transactions on Information Theory"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Darken, C., Donahue, M., Gurvits, L., Sontag, E.: Rate of approximation results motivated by robust neural network learning. In: Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, pp. 303\u2013309. The Association for Computing Machinery, New York (1993)","DOI":"10.1145\/168304.168357"},{"key":"2_CR15","doi-asserted-by":"publisher","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. Annals of Statistics\u00a020, 608\u2013613 (1992)","journal-title":"Annals of Statistics"},{"key":"2_CR16","unstructured":"Pisier, G.: Remarques sur un r\u00e9sultat non publi\u00e9 de B. Maurey. In: S\u00e9minaire d\u2019Analyse Fonctionnelle 1980-1981, \u00c9cole Polytechnique, Centre de Math\u00e9matiques, Palaiseau, France, vol.\u00a0I(12)"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1006\/jcss.1997.1506","volume":"55","author":"L. Gurvits","year":"1997","unstructured":"Gurvits, L., Koiran, P.: Approximation and learning of convex superpositions. J. of Computer and System Sciences\u00a055, 161\u2013170 (1997)","journal-title":"J. of Computer and System Sciences"},{"key":"2_CR18","doi-asserted-by":"publisher","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: Warwick, K., K\u00e1rn\u00fd, M. (eds.) Computer-Intensive Methods in Control and Signal Processing. The Curse of Dimensionality, pp. 261\u2013270. Birkh\u00e4user, Basel (1997)"},{"key":"2_CR19","unstructured":"Kolmogorov, A.N., Fomin, S.V.: Introductory Real Analysis. Dover Publications Inc. (1970)"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1137\/S1052623403426507","volume":"15","author":"V. K\u016frkov\u00e1","year":"2005","unstructured":"K\u016frkov\u00e1, V., Sanguineti, M.: Error estimates for approximate optimization by the extended Ritz method. SIAM J. on Optimization\u00a015, 461\u2013487 (2005)","journal-title":"SIAM J. on Optimization"},{"key":"2_CR21","volume-title":"Singular Integrals and Differentiability Properties of Functions","author":"E.M. Stein","year":"1970","unstructured":"Stein, E.M.: Singular Integrals and Differentiability Properties of Functions. Princeton University Press, Princeton (1970)"},{"key":"2_CR22","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033241","volume-title":"Differential and Integral Calculus","author":"R. Courant","year":"1988","unstructured":"Courant, R.: Differential and Integral Calculus, vol.\u00a0\u00a0II. Wiley-Interscience, Hoboken (1988)"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-1-4612-1996-5_18","volume-title":"Computer-Intensive Methods in Control and Signal Processing. The Curse of Dimensionality","author":"P.C. Kainen","year":"1997","unstructured":"Kainen, P.C.: Utilizing geometric anomalies of high dimension: When complexity makes computation easier. In: Warwick, K., K\u00e1rn\u00fd, M. (eds.) Computer-Intensive Methods in Control and Signal Processing. The Curse of Dimensionality, pp. 283\u2013294. Birkh\u00e4user, Basel (1997)"},{"key":"2_CR24","doi-asserted-by":"publisher","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., Kreinovich, V.: Estimates of the number of hidden units and variation with respect to half-spaces. Neural Networks\u00a010, 1061\u20131068 (1997)","journal-title":"Neural Networks"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00365-005-0624-7","volume":"24","author":"F.J. Narcowich","year":"2006","unstructured":"Narcowich, F.J., Ward, J.D., Wendland, H.: Sobolev error estimates and a Bernstein inequality for scattered data interpolation via radial basis functions. Constructive Approximation\u00a024, 175\u2013186 (2006)","journal-title":"Constructive Approximation"}],"container-title":["Lecture Notes in Computer Science","Adaptive and Natural Computing Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04921-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T18:57:12Z","timestamp":1552157832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04921-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642049200","9783642049217"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04921-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}