{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:20:53Z","timestamp":1743121253865,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319651712"},{"type":"electronic","value":"9783319651729"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-65172-9_29","type":"book-chapter","created":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T04:38:54Z","timestamp":1501562334000},"page":"337-348","source":"Crossref","is-referenced-by-count":1,"title":["Sparsity of Shallow Networks Representing Finite Mappings"],"prefix":"10.1007","author":[{"given":"V\u011bra","family":"K\u016frkov\u00e1","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,2]]},"reference":[{"key":"29_CR1","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":"29_CR2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1017\/S0962492900002919","volume":"8","author":"A Pinkus","year":"1999","unstructured":"Pinkus, A.: Approximation theory of the MLP model in neural networks. Acta Numerica 8, 143\u2013195 (1999)","journal-title":"Acta Numerica"},{"key":"29_CR3","volume-title":"Feedforward Neural Network Methodology","author":"TL Fine","year":"1999","unstructured":"Fine, T.L.: Feedforward Neural Network Methodology. Springer, Heidelberg (1999)"},{"key":"29_CR4","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 (2007)","DOI":"10.7551\/mitpress\/7496.003.0016"},{"key":"29_CR5","unstructured":"Ba, L.J., Caruana, R.: Do deep networks really need to be deep? In: Ghahrani, Z., et al. (eds.) Advances in Neural Information Processing Systems, vol. 27, pp. 1\u20139 (2014)"},{"key":"29_CR6","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/TIT.2011.2169531","volume":"58","author":"PC Kainen","year":"2012","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, 1203\u20131214 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"29_CR7","doi-asserted-by":"crossref","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":"29_CR8","doi-asserted-by":"crossref","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":"29_CR9","unstructured":"Bengio, Y., Delalleau, O., Roux, N.L.: The curse of highly variable functions for local kernel machines. In: Advances in Neural Information Processing Systems, vol. 18, pp. 107\u2013114. MIT Press (2006)"},{"key":"29_CR10","doi-asserted-by":"crossref","first-page":"1553","DOI":"10.1109\/TNNLS.2013.2293637","volume":"25","author":"M Bianchini","year":"2014","unstructured":"Bianchini, M., Scarselli, F.: On the complexity of neural network classifiers: a comparison between shallow and deep architectures. IEEE Trans. Neural Netw. Learn. Syst. 25, 1553\u20131565 (2014)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"29_CR11","doi-asserted-by":"crossref","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":"29_CR12","series-title":"Communications in Computer and Information Sciences","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/978-3-319-44188-7_21","volume-title":"Engineering Applications of Neural Networks","author":"V K\u016frkov\u00e1","year":"2016","unstructured":"K\u016frkov\u00e1, V.: Lower bounds on complexity of shallow perceptron networks. In: Jayne, C., Iliadis, L. (eds.) EANN 2016. CCIS, vol. 629, pp. 283\u2013294. Springer, Heidelberg (2016)"},{"key":"29_CR13","doi-asserted-by":"publisher","unstructured":"K\u016frkov\u00e1, V.: Constructive lower bounds on model complexity of shallow perceptron networks. Neural Comput. Appl. (2017). doi: 10.1007\/s00521-017-2965-0","DOI":"10.1007\/s00521-017-2965-0"},{"key":"29_CR14","doi-asserted-by":"crossref","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.: Approximate minimization of the regularized expected error over kernel models. Math. Oper. Res. 33, 747\u2013756 (2008)","journal-title":"Math. Oper. Res."},{"key":"29_CR15","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":"29_CR16","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":"29_CR17","doi-asserted-by":"crossref","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":"29_CR18","doi-asserted-by":"crossref","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":"29_CR19","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., Hlav\u00e1\u010dkov\u00e1, K.: Representations and rates of approximation of real-valued Boolean functions by neural networks. Neural Netw. 11, 651\u2013659 (1998)","journal-title":"Neural Netw."},{"key":"29_CR20","unstructured":"Ball, K.: An elementary introduction to modern convex geometry. In: Levy, S. (ed.) Flavors of Geometry, pp. 1\u201358. Cambridge University Press (1997)"},{"key":"29_CR21","doi-asserted-by":"crossref","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":"29_CR22","doi-asserted-by":"crossref","unstructured":"Schl\u00e4fli, L.: Theorie der Vielfachen Kontinuit\u00e4t. Z\u00fcrcher & Furrer, Z\u00fcrich (1901)","DOI":"10.1007\/978-3-0348-5118-3"},{"key":"29_CR23","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1109\/PGEC.1965.264137","volume":"14","author":"TM Cover","year":"1965","unstructured":"Cover, T.M.: Geometrical and statistical properties of systems of linear inequalities with applictions in pattern recognition. IEEE Trans. Electron. Comput. 14, 326\u2013334 (1965)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"29_CR24","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/j.crma.2008.03.014","volume":"I 346","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E.J.: The restricted isometric property and its implications for compressed sensing. C. R. Acad. Sci. Paris I 346, 589\u2013592 (2008)","journal-title":"C. R. Acad. Sci. Paris"},{"key":"29_CR25","doi-asserted-by":"crossref","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, K.Y., Orlitsky, A.: Neural models and spectral methods. In: Roychowdhury, V., Siu, K., Orlitsky, A. (eds.) Theoretical Advances in Neural Computation and Learning, pp. 3\u201336. Springer, New York (1994)"},{"key":"29_CR26","doi-asserted-by":"crossref","first-page":"1870","DOI":"10.1126\/science.1089662","volume":"301","author":"SB Laughlin","year":"2003","unstructured":"Laughlin, S.B., Sejnowski, T.J.: Communication in neural networks. Science 301, 1870\u20131874 (2003)","journal-title":"Science"}],"container-title":["Communications in Computer and Information Science","Engineering Applications of Neural Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-65172-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T19:52:52Z","timestamp":1692906772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-65172-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319651712","9783319651729"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-65172-9_29","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]}}}