{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T04:46:34Z","timestamp":1751517994490,"version":"3.40.3"},"publisher-location":"Cham","reference-count":61,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030438821"},{"type":"electronic","value":"9783030438838"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43883-8_6","type":"book-chapter","created":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T09:30:03Z","timestamp":1589880603000},"page":"129-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Limitations of Shallow Networks"],"prefix":"10.1007","author":[{"given":"V\u011bra","family":"K\u016frkov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,4]]},"reference":[{"issue":"7","key":"6_CR1","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1016\/S0893-6080(09)80007-5","volume":"6","author":"F Albertini","year":"1993","unstructured":"Albertini, F., Sontag, E.: For neural networks, function determines form. Neural Netw. 6(7), 975\u2013990 (1993)","journal-title":"Neural Netw."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Anguita, D., Ghio, A., Oneto, L., Ridella, S.: Selecting the hypothesis space for improving the generalization ability of support vector machines. In: IEEE International Joint Conference on Neural Networks (2011)","DOI":"10.1109\/IJCNN.2011.6033356"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"357","DOI":"10.2748\/tmj\/1178243286","volume":"19","author":"K Azuma","year":"1967","unstructured":"Azuma, K.: Weighted sums of certain dependent random variables. Tohoku Math. J. 19, 357\u2013367 (1967)","journal-title":"Tohoku Math. J."},{"key":"6_CR4","unstructured":"Ba, L.J., Caruana, R.: Do deep networks really need to be deep? In: Ghahramani, Z. et al. (eds.) Advances in Neural Information Processing Systems, vol. 27, pp. 1\u20139 (2014)"},{"key":"6_CR5","unstructured":"Ball, K.: An elementary introduction to modern convex geometry. In: Levy, S. (ed.) Flavors of Geometry, pp. 1\u201358. Cambridge University Press, Cambridge (1997)"},{"key":"6_CR6","unstructured":"Barron, A.R.: Neural net approximation. In: Narendra, K.S. (ed.) Proceedings of the 7th Yale Workshop on Adaptive and Learning Systems, pp. 69\u201372. Yale University Press (1992)"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1109\/18.256500","volume":"39","author":"AR Barron","year":"1993","unstructured":"Barron, A.R.: Universal approximation bounds for superpositions of a sigmoidal function. IEEE Trans. Inf. Theory 39, 930\u2013945 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR8","unstructured":"Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Bengio, Y., LeCun, Y.: Scaling learning algorithms towards AI. In: Bottou, L., Chapelle, O., DeCoste, D., Weston, J. (eds.) Large-Scale Kernel Machines. MIT Press, Cambridge (2007)","DOI":"10.7551\/mitpress\/7496.003.0016"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000006","volume":"2","author":"Y Bengio","year":"2009","unstructured":"Bengio, Y.: Learning deep architectures for AI. Found. Trends Mach. Learn. 2, 1\u2013127 (2009)","journal-title":"Found. Trends Mach. Learn."},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H Chernoff","year":"1952","unstructured":"Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23, 493\u2013507 (1952)","journal-title":"Ann. Math. Stat."},{"issue":"6","key":"6_CR12","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1109\/18.59944","volume":"25","author":"JT Coffrey","year":"1990","unstructured":"Coffrey, J.T., Goodman, R.Y.: Any code of which we cannot think is good. IEEE Trans. Inf. Theory 25(6), 1453\u20131461 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1109\/PGEC.1965.264137","volume":"14","author":"T Cover","year":"1965","unstructured":"Cover, T.: Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition. IEEE Trans. Electron. Comput. 14, 326\u2013334 (1965)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/BF01171759","volume":"63","author":"RA DeVore","year":"1989","unstructured":"DeVore, R.A., Howard, R., Micchelli, C.: Optimal nonlinear approximation. Manuscr. Math. 63, 469\u2013478 (1989)","journal-title":"Manuscr. Math."},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1002\/cpa.20132","volume":"59","author":"D Donoho","year":"2006","unstructured":"Donoho, D.: For most large underdetermined systems of linear equations the minimal $$\\ell _1$$-norm solution is also the sparsest solution. Commun. Pure Appl. Math. 59, 797\u2013829 (2006)","journal-title":"Commun. Pure Appl. Math."},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"4789","DOI":"10.1109\/TIT.2008.929958","volume":"54","author":"DL Donoho","year":"2008","unstructured":"Donoho, D.L., Tsaig, Y.: Fast solution of 1-norm minimization problems when the solution may be sparse. IEEE Trans. Inf. Theory 54, 4789\u20134812 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR17","unstructured":"Erd\u00f6s, P., Spencer, H.: Probabilistic Methods in Combinatorics. Academic, Cambridge (1974)"},{"key":"6_CR18","volume-title":"Feedforward Neural Network Methodology","author":"TL Fine","year":"1999","unstructured":"Fine, T.L.: Feedforward Neural Network Methodology. Springer, Berlin (1999)"},{"issue":"2","key":"6_CR19","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0097-3165(95)90052-7","volume":"69","author":"D Haussler","year":"1995","unstructured":"Haussler, D.: Sphere packing numbers for subsets of the Boolean n-cube with bounded Vapnik-Chervonenkis dimension. J. Comb. Theory A 69(2), 217\u2013232 (1995)","journal-title":"J. Comb. Theory A"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1162\/neco.2006.18.7.1527","volume":"18","author":"GE Hinton","year":"2006","unstructured":"Hinton, G.E., Osindero, S., Teh, Y.W.: A fast learning algorithm for deep belief nets. Neural Comput. 18, 1527\u20131554 (2006)","journal-title":"Neural Comput."},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58, 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"6_CR22","first-page":"69","volume":"17","author":"Y Ito","year":"1992","unstructured":"Ito, Y.: Finite mapping by neural networks and truth functions. Math. Sci. 17, 69\u201377 (1992)","journal-title":"Math. Sci."},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Kainen, P.C., K\u016frkov\u00e1, V., Sanguineti, M.: Dependence of computational models on input dimension: tractability of approximation and optimization tasks. IEEE Trans. Inf. Theory 58, (2012)","DOI":"10.1109\/TIT.2011.2169531"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Kainen, P.C., K\u016frkov\u00e1, V.: Quasiorthogonal dimension. In: Kosheleva, O., Shary, S., Xiang, G., Zapatrin, R. (eds.) Beyond Traditional Probabilistic Data Processing Techniques: Interval, Fuzzy, etc. Methods and Their Applications. Springer, Berlin (2020, to appear)","DOI":"10.1007\/978-3-030-31041-7_35"},{"issue":"3","key":"6_CR25","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0893-9659(93)90023-G","volume":"6","author":"PC Kainen","year":"1993","unstructured":"Kainen, P.C., K\u016frkov\u00e1, V.: Quasiorthogonal dimension of Euclidean spaces. Appl. Math. Lett. 6(3), 7\u201310 (1993)","journal-title":"Appl. Math. Lett."},{"issue":"3","key":"6_CR26","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1162\/neco.1994.6.3.543","volume":"6","author":"P Kainen","year":"1994","unstructured":"Kainen, P., K\u016frkov\u00e1, V.: Functionally equivalent feedforward neural network. Neural Comput. 6(3), 543\u2013558 (1994)","journal-title":"Neural Comput."},{"issue":"2","key":"6_CR27","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0893-9659(96)00008-0","volume":"9","author":"P Kainen","year":"1996","unstructured":"Kainen, P., K\u016frkov\u00e1, V.: Singularities of finite scaling functions. Appl. Math. Lett. 9(2), 33\u201337 (1996)","journal-title":"Appl. Math. Lett."},{"key":"6_CR28","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0925-2312(99)00111-3","volume":"29","author":"PC Kainen","year":"1999","unstructured":"Kainen, P.C., K\u016frkov\u00e1, V., Vogt, A.: Approximation by neural networks is not continuous. Neurocomputing 29, 47\u201356 (1999)","journal-title":"Neurocomputing"},{"key":"6_CR29","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1006\/jath.2000.3467","volume":"105","author":"PC Kainen","year":"2000","unstructured":"Kainen, P.C., K\u016frkov\u00e1, V., Vogt, A.: Geometry and topology of continuous best and near best approximations. J. Approx. Theory 105, 252\u2013262 (2000)","journal-title":"J. Approx. Theory"},{"key":"6_CR30","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1010916406274","volume":"101","author":"PC Kainen","year":"2001","unstructured":"Kainen, P.C., K\u016frkov\u00e1, V., Vogt, A.: Continuity of approximation by neural networks in $${L}_p$$-spaces. Ann. Oper. Res. 101, 143\u2013147 (2001)","journal-title":"Ann. Oper. Res."},{"key":"6_CR31","volume-title":"Learning and Soft Computing","author":"V Kecman","year":"2001","unstructured":"Kecman, V.: Learning and Soft Computing. MIT Press, Cambridge (2001)"},{"key":"6_CR32","first-page":"585","volume":"108","author":"A Kolmogorov","year":"1956","unstructured":"Kolmogorov, A.: Asymptotic characteristics of some completely bounded metric spaces. Dokl. Akad. Nauk. SSSR 108, 585\u2013589 (1956)","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"6_CR33","unstructured":"K\u016frkov\u00e1, V., Sanguineti, M.: Classification by sparse neural networks. IEEE Trans. Neural Netw. Learn. Syst. 30(9), 2746\u20132754 (2019)"},{"key":"6_CR34","doi-asserted-by":"crossref","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, Boston (1997)","DOI":"10.1007\/978-1-4612-1996-5_16"},{"key":"6_CR35","unstructured":"K\u016frkov\u00e1, V.: High-dimensional approximation and optimization by neural networks. In: Suykens, J. et al. (eds.) Advances in Learning Theory: Methods, Models, and Applications (NATO Science Series III: Computer & Systems Sciences, vol. 190), pp. 69\u201388. IOS Press, Amsterdam (2003)"},{"key":"6_CR36","doi-asserted-by":"crossref","unstructured":"K\u016frkov\u00e1, V.: Sparsity and complexity of networks computing highly-varying functions. In: International Conference on Artificial Neural Networks, pp. 534\u2013543 (2018)","DOI":"10.1007\/978-3-030-01424-7_52"},{"key":"6_CR37","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.neunet.2012.05.002","volume":"33","author":"V K\u016frkov\u00e1","year":"2012","unstructured":"K\u016frkov\u00e1, V.: Complexity estimates based on integral transforms induced by computational units. Neural Netw. 33, 160\u2013167 (2012)","journal-title":"Neural Netw."},{"key":"6_CR38","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s00521-017-2965-0","volume":"29","author":"V K\u016frkov\u00e1","year":"2018","unstructured":"K\u016frkov\u00e1, V.: Constructive lower bounds on model complexity of shallow perceptron networks. Neural Comput. Appl. 29, 305\u2013315 (2018)","journal-title":"Neural Comput. Appl."},{"issue":"10","key":"6_CR39","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.neunet.2014.05.005","volume":"57","author":"V K\u016frkov\u00e1","year":"2014","unstructured":"K\u016frkov\u00e1, V., Kainen, P.C.: Comparing fixed and variable-width Gaussian networks. Neural Netw. 57(10), 23\u201328 (2014)","journal-title":"Neural Netw."},{"key":"6_CR40","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1016\/j.neucom.2015.07.014","volume":"171","author":"V K\u016frkov\u00e1","year":"2016","unstructured":"K\u016frkov\u00e1, V., Sanguineti, M.: Model complexities of shallow networks representing highly varying functions. Neurocomputing 171, 598\u2013604 (2016)","journal-title":"Neurocomputing"},{"key":"6_CR41","unstructured":"LeCun, Y., et al.: Handwritten digit recognition with a back-propagation network. In: Proceedings of Advances in Neural Information Processing Systems, pp. 396\u2013404 (1990)"},{"key":"6_CR42","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y LeCun","year":"1998","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proc. IEEE 86, 2278\u20132324 (1998)","journal-title":"Proc. IEEE"},{"key":"6_CR43","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Y LeCun","year":"2015","unstructured":"LeCun, Y., Bengio, Y., Hinton, G.: Deep learning. Nature 521, 436\u2013444 (2015)","journal-title":"Nature"},{"key":"6_CR44","volume-title":"Probl\u00e8mes concrets d\u2019analyse fonctionelle","author":"P L\u00e9vy","year":"1951","unstructured":"L\u00e9vy, P.: Probl\u00e8mes concrets d\u2019analyse fonctionelle. Gauthier Villards, Paris (1951)"},{"key":"6_CR45","unstructured":"MacWilliams, F., Sloane, N.A.: The Theory of Error-Correcting Codes. North Holland Publishing Co., Amsterdam (1977)"},{"key":"6_CR46","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1023\/A:1018993908478","volume":"13","author":"VE Maiorov","year":"2000","unstructured":"Maiorov, V.E., Meir, R.: On the near optimality of the stochastic approximation of smooth functions by neural networks. Adv. Comput. Math. 13, 79\u2013103 (2000)","journal-title":"Adv. Comput. Math."},{"key":"6_CR47","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0925-2312(98)00111-8","volume":"25","author":"VE Maiorov","year":"1999","unstructured":"Maiorov, V.E., Pinkus, A.: Lower bounds for approximation by MLP neural networks. Neurocomputing 25, 81\u201391 (1999)","journal-title":"Neurocomputing"},{"key":"6_CR48","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1006\/jath.1996.0031","volume":"85","author":"Y Makovoz","year":"1996","unstructured":"Makovoz, Y.: Random approximants and neural networks. J. Approx. Theory 85, 98\u2013109 (1996)","journal-title":"J. Approx. Theory"},{"key":"6_CR49","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Springer, New York (2002)"},{"key":"6_CR50","unstructured":"Mhaskar, H.N., Liao, Q., Poggio, T.: Learning functions: when is deep better than shallow. Center for Brains, Minds & Machines, pp. 1\u201312 (2016)"},{"issue":"1","key":"6_CR51","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10994-015-5540-x","volume":"103","author":"L Oneto","year":"2015","unstructured":"Oneto, L., Ridella, S., Anguita, D.: Tikhonov, Ivanov and Morozov regularization for support vector machine learning. Mach. Learn. 103(1), 103\u2013136 (2015)","journal-title":"Mach. Learn."},{"key":"6_CR52","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1002\/cpa.21442","volume":"66","author":"Y Plan","year":"2013","unstructured":"Plan, Y., Vershynin, R.: One-bit compressed sensing by linear programming. Commun. Pure Appl. Math. 66, 1275\u20131297 (2013)","journal-title":"Commun. Pure Appl. Math."},{"key":"6_CR53","doi-asserted-by":"publisher","unstructured":"Poggio, T., Mhaskar, H., Rosasco, L., Miranda, B., Liao, Q.: Why and when can deep-but not shallow-networks avoid the curse of dimensionality: a review. Int. J. Autom. Comput. 14 (5), 503\u2013519 (2017). https:\/\/doi.org\/10.1007\/s11633-017-1054-2","DOI":"10.1007\/s11633-017-1054-2"},{"key":"6_CR54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-4118-4","volume-title":"Gesamelte Mathematische Abhandlungen","author":"L Schl\u00e4fli","year":"1950","unstructured":"Schl\u00e4fli, L.: Gesamelte Mathematische Abhandlungen, vol. 1. Birkh\u00e4user, Basel (1950)"},{"key":"6_CR55","volume-title":"Number Theory in Science and Communication","author":"M Schr\u00f6der","year":"2009","unstructured":"Schr\u00f6der, M.: Number Theory in Science and Communication. Springer, New York (2009)"},{"key":"6_CR56","unstructured":"Sloane, N.A.: A library of Hadamard matrices. http:\/\/www.research.att.com\/~njas\/hadamard\/"},{"issue":"4","key":"6_CR57","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/S0893-6080(05)80037-1","volume":"5","author":"HJ Sussman","year":"1992","unstructured":"Sussman, H.J.: Uniqueness of the weights for minimal feedforward nets with a given input-output map. Neural Netw. 5(4), 589\u2013593 (1992)","journal-title":"Neural Netw."},{"key":"6_CR58","unstructured":"Sylvester, J.J.: Thoughts on inverse orthogonal matrices, simultaneous sign successions, and tessellated pavements in two or more colours, with applications to Newton\u2019s rule, ornamental tile-work, and the theory of numbers. Philos. Mag. 34, 461\u2013475 (1867)"},{"key":"6_CR59","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the Lasso. J. R. Stat. Soc. B 58, 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. B"},{"key":"6_CR60","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1109\/LSP.2014.2345761","volume":"22","author":"A Tillmann","year":"2015","unstructured":"Tillmann, A.: On the computational intractability of exact and approximate dictionary learning. IEEE Signal Process. Lett. 22, 45\u201349 (2015)","journal-title":"IEEE Signal Process. Lett."},{"key":"6_CR61","doi-asserted-by":"crossref","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(67), (1997)","DOI":"10.1109\/4235.585893"}],"container-title":["Studies in Computational Intelligence","Recent Trends in Learning From Data"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43883-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T00:29:03Z","timestamp":1722904143000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43883-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030438821","9783030438838"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43883-8_6","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}