{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T07:12:10Z","timestamp":1763017930461,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T00:00:00Z","timestamp":1534464000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["GA15-18108S","GA18-23827S"],"award-info":[{"award-number":["GA15-18108S","GA18-23827S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s00521-018-3680-1","type":"journal-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T12:16:30Z","timestamp":1534508190000},"page":"1783-1792","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Limitations of shallow networks representing finite mappings"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8181-2128","authenticated-orcid":false,"given":"V\u011bra","family":"K\u016frkov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,17]]},"reference":[{"key":"3680_CR1","first-page":"1","volume-title":"Advances in neural information processing systems","author":"LJ Ba","year":"2014","unstructured":"Ba LJ, Caruana R (2014) Do deep networks really need to be deep? In: Ghahrani Z (ed) Advances in neural information processing systems, vol 27. MIT Press, Cambridge, pp 1\u20139"},{"key":"3680_CR2","first-page":"1","volume-title":"Flavors of geometry","author":"K Ball","year":"1997","unstructured":"Ball K (1997) An elementary introduction to modern convex geometry. In: Levy S (ed) Flavors of geometry. Cambridge University Press, Cambridge, pp 1\u201358"},{"key":"3680_CR3","unstructured":"Barron AR (1992) Neural net approximation. In: Narendra KS (ed) Proceedings of 7th Yale workshop on adaptive and learning systems. Yale University Press, New Haven, pp 69\u201372"},{"key":"3680_CR4","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1109\/18.256500","volume":"39","author":"AR Barron","year":"1993","unstructured":"Barron AR (1993) Universal approximation bounds for superpositions of a sigmoidal function. IEEE Trans Inf Theory 39:930\u2013945","journal-title":"IEEE Trans Inf Theory"},{"key":"3680_CR5","volume-title":"Dynamic programming","author":"R Bellman","year":"1957","unstructured":"Bellman R (1957) Dynamic programming. Princeton University Press, Princeton"},{"key":"3680_CR6","volume-title":"Large-scale kernel machines","author":"Y Bengio","year":"2007","unstructured":"Bengio Y, LeCun Y (2007) Scaling learning algorithms towards AI. In: Bottou L, Chapelle O, DeCoste D, Weston J (eds) Large-scale kernel machines. MIT Press, Cambridge"},{"key":"3680_CR7","first-page":"107","volume-title":"Advances in neural information processing systems","author":"Y Bengio","year":"2006","unstructured":"Bengio Y, Delalleau O, Roux NL (2006) The curse of highly variable functions for local kernel machines. In: Weiss Y, Sch\u00f6lkopf B, Platt J (eds) Advances in neural information processing systems, vol 18. MIT Press, Cambridge, pp 107\u2013114"},{"key":"3680_CR8","doi-asserted-by":"publisher","first-page":"1553","DOI":"10.1109\/TNNLS.2013.2293637","volume":"25","author":"M Bianchini","year":"2014","unstructured":"Bianchini M, Scarselli F (2014) On the complexity of neural network classifiers: a comparison between shallow and deep architectures. IEEE Trans Neural Netw Learn Syst 25:1553\u20131565","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"3680_CR9","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/j.crma.2008.03.014","volume":"I 346","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s EJ (2008) The restricted isometric property and its implications for compressed sensing. C R Acad Sci Paris I 346:589\u2013592","journal-title":"C R Acad Sci Paris"},{"key":"3680_CR10","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1109\/18.59944","volume":"36","author":"JT Coffey","year":"1990","unstructured":"Coffey JT, Goodman RM (1990) Any code of which we cannot think is good. IEEE Trans Inf Theor 36:1453\u20131461","journal-title":"IEEE Trans Inf Theor"},{"key":"3680_CR11","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1109\/PGEC.1965.264137","volume":"14","author":"T Cover","year":"1965","unstructured":"Cover T (1965) Geometrical and statistical properties of systems of linear inequalities with applictions in pattern recognition. IEEE Trans Electron Comput 14:326\u2013334","journal-title":"IEEE Trans Electron Comput"},{"key":"3680_CR12","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/BF01171759","volume":"63","author":"RA DeVore","year":"1989","unstructured":"DeVore RA, Howard R, Micchelli C (1989) Optimal nonlinear approximation. Manuscr Math 63:469\u2013478","journal-title":"Manuscr Math"},{"key":"3680_CR13","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1002\/cpa.20132","volume":"59","author":"D Donoho","year":"2006","unstructured":"Donoho D (2006) For most large underdetermined systems of linear equations the minimal \n                    \n                      \n                    \n                    $$\\ell _1$$\n                    \n                      \n                        \n                          \u2113\n                          1\n                        \n                      \n                    \n                  -norm solution is also the sparsest solution. Commun Pure Appl Math 59:797\u2013829","journal-title":"Commun Pure Appl Math"},{"key":"3680_CR14","doi-asserted-by":"publisher","first-page":"4789","DOI":"10.1109\/TIT.2008.929958","volume":"54","author":"DL Donoho","year":"2008","unstructured":"Donoho DL, Tsaig Y (2008) Fast solution of 1-norm minimization problems when the solution may be sparse. IEEE Trans Inf Theory 54:4789\u20134812","journal-title":"IEEE Trans Inf Theory"},{"key":"3680_CR15","volume-title":"Feedforward neural network methodology","author":"TL Fine","year":"1999","unstructured":"Fine TL (1999) Feedforward neural network methodology. Springer, Berlin"},{"key":"3680_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10287-008-0072-5","volume":"6","author":"G Gnecco","year":"2009","unstructured":"Gnecco G, Sanguineti M (2009) The weight-decay technique in learning from data: an optimization point of view. Comput Manag Sci 6:53\u201379","journal-title":"Comput Manag Sci"},{"key":"3680_CR17","doi-asserted-by":"publisher","first-page":"3320","DOI":"10.1109\/TIT.2003.820031","volume":"49","author":"R Gribonval","year":"2003","unstructured":"Gribonval R, Nielsen M (2003) Sparse representations in unions of bases. IEEE Trans Inf Theory 49:3320\u20133325","journal-title":"IEEE Trans Inf Theory"},{"key":"3680_CR18","first-page":"69","volume":"17","author":"Y Ito","year":"1992","unstructured":"Ito Y (1992) Finite mapping by neural networks and truth functions. Math Sci 17:69\u201377","journal-title":"Math Sci"},{"key":"3680_CR19","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0925-2312(99)00111-3","volume":"29","author":"PC Kainen","year":"1999","unstructured":"Kainen PC, K\u016frkov\u00e1 V, Vogt A (1999) Approximation by neural networks is not continuous. Neurocomputing 29:47\u201356","journal-title":"Neurocomputing"},{"key":"3680_CR20","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1006\/jath.2000.3467","volume":"105","author":"PC Kainen","year":"2000","unstructured":"Kainen PC, K\u016frkov\u00e1 V, Vogt A (2000) Geometry and topology of continuous best and near best approximations. J Approx Theory 105:252\u2013262","journal-title":"J Approx Theory"},{"key":"3680_CR21","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1010916406274","volume":"101","author":"PC Kainen","year":"2001","unstructured":"Kainen PC, K\u016frkov\u00e1 V, Vogt A (2001) Continuity of approximation by neural networks in \n                    \n                      \n                    \n                    $${L}_p$$\n                    \n                      \n                        \n                          L\n                          p\n                        \n                      \n                    \n                  -spaces. Ann Oper Res 101:143\u2013147","journal-title":"Ann Oper Res"},{"key":"3680_CR22","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1109\/TIT.2011.2169531","volume":"58","author":"PC Kainen","year":"2012","unstructured":"Kainen PC, K\u016frkov\u00e1 V, Sanguineti M (2012) Dependence of computational models on input dimension: tractability of approximation and optimization tasks. IEEE Trans Inf Theory 58:1203\u20131214","journal-title":"IEEE Trans Inf Theory"},{"key":"3680_CR23","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","author":"V K\u016frkov\u00e1","year":"1997","unstructured":"K\u016frkov\u00e1 V (1997) Dimension-independent rates of approximation by neural networks. In: Warwick K, K\u00e1rn\u00fd M (eds) Computer-intensive methods in control and signal processing. Birkh\u00e4user, Boston, pp 261\u2013270 The Curse of Dimensionality"},{"key":"3680_CR24","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 (2012) Complexity estimates based on integral transforms induced by computational units. Neural Netw 33:160\u2013167","journal-title":"Neural Netw"},{"key":"3680_CR25","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-319-65172-9_29","volume-title":"Engineering applications of neural networks","author":"V K\u016frkov\u00e1","year":"2017","unstructured":"K\u016frkov\u00e1 V (2017) Sparsity of shallow networks representing finite mappings. In: Boracchi G (ed) Engineering applications of neural networks, vol CCIS 744. Springer, Berlin, pp 337\u2013348"},{"key":"3680_CR26","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 (2018) Constructive lower bounds on model complexity of shallow perceptron networks. Neural Comput Appl 29:305\u2013315","journal-title":"Neural Comput Appl"},{"key":"3680_CR27","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1287\/moor.1080.0317","volume":"33","author":"V K\u016frkov\u00e1","year":"2008","unstructured":"K\u016frkov\u00e1 V, Sanguineti M (2008) Approximate minimization of the regularized expected error over kernel models. Math Oper Res 33:747\u2013756","journal-title":"Math Oper Res"},{"key":"3680_CR28","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 PC (2014) Comparing fixed and variable-width Gaussian networks. Neural Netw 57:23\u201328","journal-title":"Neural Netw"},{"key":"3680_CR29","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 (2016) Model complexities of shallow networks representing highly varying functions. Neurocomputing 171:598\u2013604","journal-title":"Neurocomputing"},{"key":"3680_CR30","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 (1998) Representations and rates of approximation of real-valued Boolean functions by neural networks. Neural Networks 11:651\u2013659","journal-title":"Neural Networks"},{"key":"3680_CR31","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.neunet.2017.04.003","volume":"91","author":"V K\u016frkov\u00e1","year":"2017","unstructured":"K\u016frkov\u00e1 V, Sanguineti M (2017) Probabilistic lower bounds for approximation by shallow perceptron network. Neural Netw 91:34\u201341","journal-title":"Neural Netw"},{"key":"3680_CR32","doi-asserted-by":"publisher","first-page":"1870","DOI":"10.1126\/science.1089662","volume":"301","author":"SB Laughlin","year":"2003","unstructured":"Laughlin SB, Sejnowski TJ (2003) Communication in neural networks. Science 301:1870\u20131874","journal-title":"Science"},{"key":"3680_CR33","volume-title":"The theory of error-correcting codes","author":"F MacWilliams","year":"1977","unstructured":"MacWilliams F, Sloane NA (1977) The theory of error-correcting codes. North Holland Publishing Co., New York"},{"key":"3680_CR34","unstructured":"Mhaskar H, Liao Q, Poggio T (2016) Learning functions: when is deep better than shallow. CBMM Memo No. 045, May 31, 2016. \n                    https:\/\/arxiv.org\/pdf\/1603.00988v4.pdf\n                    \n                  . Accessed 29 May 2016"},{"key":"3680_CR35","unstructured":"Mhaskar H, Liao Q, Poggio T (2016) Learning real and Boolean functions: when is deep better than shallow. CBMM Memo No. 45, March 4, 2016. \n                    https:\/\/arxiv.org\/pdf\/1603.00988v1.pdf\n                    \n                  . Accessed 3 Mar 2016"},{"key":"3680_CR36","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1017\/S0962492900002919","volume":"8","author":"A Pinkus","year":"1999","unstructured":"Pinkus A (1999) Approximation theory of the MLP model in neural networks. Acta Numer 8:143\u2013195","journal-title":"Acta Numer"},{"key":"3680_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/s11633-017-1054-2","author":"T Poggio","year":"2017","unstructured":"Poggio T, Mhaskar H, Rosasco L, Miranda B, Liao Q (2017) Why and when can deep-but not shallow-networks avoid the curse of dimensionality: a review. Int J Autom Comput. \n                    https:\/\/doi.org\/10.1007\/s11633-017-1054-2","journal-title":"Int J Autom Comput"},{"key":"3680_CR38","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-1-4615-2696-4_1","volume-title":"Theoretical advances in neural computation and learning","author":"V Roychowdhury","year":"1994","unstructured":"Roychowdhury V, Siu KY, Orlitsky A (1994) Neural models and spectral methods. In: Roychowdhury V, Siu K, Orlitsky A (eds) Theoretical advances in neural computation and learning. Springer, New York, pp 3\u201336"},{"key":"3680_CR39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-5118-3","volume-title":"Theorie der Vielfachen Kontinuit\u00e4t","author":"L Schl\u00e4fli","year":"1901","unstructured":"Schl\u00e4fli L (1901) Theorie der Vielfachen Kontinuit\u00e4t. Z\u00fcrcher & Furrer, Z\u00fcrich"},{"key":"3680_CR40","volume-title":"Number theory in science and communication","author":"M Schroeder","year":"2009","unstructured":"Schroeder M (2009) Number theory in science and communication. Springer, Berlin"},{"key":"3680_CR41","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1109\/LSP.2014.2345761","volume":"22","author":"A Tillmann","year":"2015","unstructured":"Tillmann A (2015) On the computational intractability of exact and approximate dictionary learning. IEEE Signal Process Lett 22:45\u201349","journal-title":"IEEE Signal Process Lett"},{"key":"3680_CR42","doi-asserted-by":"publisher","first-page":"2001","DOI":"10.1109\/TIT.2012.2233859","volume":"59","author":"S Vaiter","year":"2013","unstructured":"Vaiter S, Peyre G, Dossal C, Fadili J (2013) Robust sparse analysis regularization. IEEE Trans Inf Theory 59:2001\u20132016","journal-title":"IEEE Trans Inf Theory"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3680-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-018-3680-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3680-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T05:59:21Z","timestamp":1569391161000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-018-3680-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,17]]},"references-count":42,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["3680"],"URL":"https:\/\/doi.org\/10.1007\/s00521-018-3680-1","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2018,8,17]]},"assertion":[{"value":"8 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The author declares that she has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}