{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T14:51:39Z","timestamp":1761922299630,"version":"build-2065373602"},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2001,5,19]],"date-time":"2001-05-19T00:00:00Z","timestamp":990230400000},"content-version":"vor","delay-in-days":413,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Neural Networks"],"published-print":{"date-parts":[[2000,4]]},"DOI":"10.1016\/s0893-6080(00)00015-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:36:39Z","timestamp":1027636599000},"page":"365-375","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":26,"title":["Information complexity of neural networks"],"prefix":"10.1016","volume":"13","author":[{"given":"M.A.","family":"Kon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Plaskota","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0893-6080(00)00015-0_BIB1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1090\/S0002-9947-1950-0051437-7","article-title":"Theory of reproducing kernels","volume":"68","author":"Aronszain","year":"1950","journal-title":"Transactions of the American Mathematical Society"},{"key":"10.1016\/S0893-6080(00)00015-0_BIB2","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1109\/18.256500","article-title":"Universal approximation bounds for superposition of a sigmoidal function","volume":"39","author":"Barron","year":"1993","journal-title":"IEEE Transactions in Information Theory"},{"key":"10.1016\/S0893-6080(00)00015-0_BIB3","first-page":"289","article-title":"Neural networks for localized approximation","author":"Chui","year":"1993","journal-title":"Center for Approximation Theory Report"},{"key":"10.1016\/S0893-6080(00)00015-0_BIB4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF02124745","article-title":"Limitations of the approximation capabilities of neural networks with one hidden layer","volume":"5","author":"Chui","year":"1996","journal-title":"Advances in Computational Mathematics"},{"key":"10.1016\/S0893-6080(00)00015-0_BIB5","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0021-9045(92)90081-X","article-title":"Approximation by ridge functions and neural networks with one hidden layer","volume":"70","author":"Chui","year":"1992","journal-title":"Journal of Approximation Theory"},{"key":"10.1016\/S0893-6080(00)00015-0_BIB6","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF00195855","article-title":"Networks and the best approximation property","volume":"63","author":"Girosi","year":"1990","journal-title":"Biological Cybernetics"},{"key":"10.1016\/S0893-6080(00)00015-0_BIB7","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/0716007","article-title":"Optimal estimation of linear operators in Hilbert spaces from inaccurate data","volume":"16","author":"Melkman","year":"1979","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"10.1016\/S0893-6080(00)00015-0_BIB8","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1016\/0893-6080(95)00125-5","article-title":"Neural networks and approximation theory","volume":"9","author":"Mhaskar","year":"1996","journal-title":"Neural Networks"},{"key":"10.1016\/S0893-6080(00)00015-0_BIB9","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1016\/0196-8858(92)90016-P","article-title":"Approximation by superposition of sigmoidal and radial basis functions","volume":"13","author":"Mhaskar","year":"1992","journal-title":"Advances in Applied Mathematics"},{"key":"10.1016\/S0893-6080(00)00015-0_BIB10","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1147\/rd.383.0277","article-title":"Dimension independent bounds on the degree of approximation by neural networks","volume":"38","author":"Mhaskar","year":"1994","journal-title":"IBM Journal of Research and Development"},{"key":"10.1016\/S0893-6080(00)00015-0_BIB11","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1006\/aama.1995.1008","article-title":"Degree of approximation by neural and translation networks with a single hidden layer","volume":"161","author":"Mhaskar","year":"1995","journal-title":"Advances in Applied Mathematics"},{"key":"10.1016\/S0893-6080(00)00015-0_BIB12","article-title":"How to choose an activation function","volume":"5","author":"Mhaskar","year":"1993"},{"key":"10.1016\/S0893-6080(00)00015-0_BIB13","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1017\/S0305004100071000","article-title":"On radial basis approximation on periodic grids","volume":"112","author":"Micchelli","year":"1992","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"year":"1985","series-title":"n-Widths in approximation theory","author":"Pinkus","key":"10.1016\/S0893-6080(00)00015-0_BIB14"},{"year":"1996","series-title":"Noisy information and computational complexity","author":"Plaskota","key":"10.1016\/S0893-6080(00)00015-0_BIB15"},{"key":"10.1016\/S0893-6080(00)00015-0_BIB16","doi-asserted-by":"crossref","first-page":"978","DOI":"10.1126\/science.247.4945.978","article-title":"Regularization algorithms for learning that are equivalent to multilayer networks","volume":"247","author":"Poggio","year":"1990","journal-title":"Science"},{"key":"10.1016\/S0893-6080(00)00015-0_BIB17","unstructured":"Poggio, T., & Girosi, F. (1989). A theory of networks for approximation and learning, Artificial Intelligence Memoirs, 1140, MIT AI Lab."},{"year":"1988","series-title":"Information-based complexity","author":"Traub","key":"10.1016\/S0893-6080(00)00015-0_BIB18"}],"container-title":["Neural Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893608000000150?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893608000000150?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T01:26:30Z","timestamp":1760232390000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893608000000150"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0893608000000150"],"URL":"https:\/\/doi.org\/10.1016\/s0893-6080(00)00015-0","relation":{},"ISSN":["0893-6080"],"issn-type":[{"type":"print","value":"0893-6080"}],"subject":[],"published":{"date-parts":[[2000,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Information complexity of neural networks","name":"articletitle","label":"Article Title"},{"value":"Neural Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0893-6080(00)00015-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier Science Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}