{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T12:18:37Z","timestamp":1773058717961,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030014230","type":"print"},{"value":"9783030014247","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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":[[2018]]},"DOI":"10.1007\/978-3-030-01424-7_52","type":"book-chapter","created":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T17:07:37Z","timestamp":1538413657000},"page":"534-543","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Sparsity and Complexity of Networks Computing Highly-Varying Functions"],"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":[[2018,9,27]]},"reference":[{"key":"52_CR1","volume-title":"Large-Scale Kernel Machines","author":"Y Bengio","year":"2007","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)"},{"key":"52_CR2","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":"52_CR3","volume-title":"Dynamic Programming","author":"R Bellman","year":"1957","unstructured":"Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)"},{"key":"52_CR4","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. Manuscripta Mathematica 63, 469\u2013478 (1989)","journal-title":"Manuscripta Mathematica"},{"issue":"5","key":"52_CR5","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s11633-017-1054-2","volume":"14","author":"Tomaso Poggio","year":"2017","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. https:\/\/doi.org\/10.1007\/s11633-017-1054-2","journal-title":"International Journal of Automation and Computing"},{"issue":"1-3","key":"52_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0925-2312(99)00111-3","volume":"29","author":"Paul C. Kainen","year":"1999","unstructured":"Kainen, P.C., \n                    \n                  , V., Vogt, A.: Approximation by neural networks is not continuous. Neurocomputing 29, 47\u201356 (1999)","journal-title":"Neurocomputing"},{"issue":"2","key":"52_CR7","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1006\/jath.2000.3467","volume":"105","author":"Paul C. Kainen","year":"2000","unstructured":"Kainen, P.C., \n                    \n                  , V., Vogt, A.: Geometry and topology of continuous best and near best approximations. J. Approx. Theor. 105, 252\u2013262 (2000)","journal-title":"Journal of Approximation Theory"},{"key":"52_CR8","doi-asserted-by":"crossref","unstructured":"Kainen, P.C., \n                    \n                  , V., Vogt, A.: Continuity of approximation by neural networks in $${L}_p$$-spaces. Ann. Oper. Res. 101, 143\u2013147 (2001)","DOI":"10.1023\/A:1010916406274"},{"key":"52_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, Cambridge (2006)"},{"key":"52_CR10","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1016\/j.neucom.2015.07.014","volume":"171","author":"V\u011bra K\u016frkov\u00e1","year":"2016","unstructured":", V., Sanguineti, M.: Model complexities of shallow networks representing highly varying functions. Neurocomputing 171, 598\u2013604 (2016)","journal-title":"Neurocomputing"},{"key":"52_CR11","unstructured":"Barron, A.R.: Neural net approximation. In: Narendra, K.S. (ed.) Proceedings of 7th Yale Workshop on Adaptive and Learning Systems, pp. 69\u201372. Yale University Press (1992)"},{"key":"52_CR12","doi-asserted-by":"crossref","unstructured":", 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":"52_CR13","doi-asserted-by":"crossref","unstructured":", V.: Complexity estimates based on integral transforms induced by computational units. Neural Netw. 33, 160\u2013167 (2012)","DOI":"10.1016\/j.neunet.2012.05.002"},{"key":"52_CR14","doi-asserted-by":"crossref","unstructured":", V., Sanguineti, M.: Probabilistic lower bounds for approximation by shallow perceptron networks. Neural Netw. 91, 34\u201341 (2017)","DOI":"10.1016\/j.neunet.2017.04.003"},{"key":"52_CR15","doi-asserted-by":"crossref","unstructured":", V.: Constructive lower bounds on model complexity of shallow perceptron networks. Neural Comput. Appl. 29, 305\u2013315 (2018)","DOI":"10.1007\/s00521-017-2965-0"},{"key":"52_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/b97705","volume-title":"Feedforward Neural Network Methodology","author":"TL Fine","year":"1999","unstructured":"Fine, T.L.: Feedforward Neural Network Methodology. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/b97705"},{"key":"52_CR17","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":"52_CR18","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":"52_CR19","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":"52_CR20","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). https:\/\/doi.org\/10.1007\/978-1-4613-0039-7"},{"key":"52_CR21","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":"52_CR22","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. Theor. 85, 98\u2013109 (1996)","journal-title":"J. Approx. Theor."},{"issue":"2","key":"52_CR23","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. Theor. A 69(2), 217\u2013232 (1995)","journal-title":"J. Comb. Theor. A"},{"issue":"3","key":"52_CR24","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0893-9659(93)90023-G","volume":"6","author":"Paul C. Kainen","year":"1993","unstructured":"Kainen, P.C., \n                    \n                  , V.: Quasiorthogonal dimension of Euclidean spaces. Appl. Math. Lett. 6(3), 7\u201310 (1993)","journal-title":"Applied Mathematics Letters"},{"key":"52_CR25","unstructured":"Kainen, P.C., \n                    \n                  , 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 (2018, to appear)"},{"key":"52_CR26","doi-asserted-by":"publisher","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. Roy. Stat. Soc. B 58, 267\u2013288 (1996)","journal-title":"J. Roy. Stat. Soc. B"}],"container-title":["Lecture Notes in Computer Science","Artificial Neural Networks and Machine Learning \u2013 ICANN 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01424-7_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T09:34:36Z","timestamp":1773048876000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-01424-7_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030014230","9783030014247"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01424-7_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"27 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICANN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Neural Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rhodes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icann2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/e-nns.org\/icann2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easyacademia.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"360","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"139","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"In addition there are 41 full poster papers and 11 short poster papers included in the proceedings","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}