{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:08:41Z","timestamp":1743048521136,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031442063"},{"type":"electronic","value":"9783031442070"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-44207-0_40","type":"book-chapter","created":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T14:03:51Z","timestamp":1695305031000},"page":"483-490","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation of\u00a0Binary-Valued Functions by\u00a0Networks of\u00a0Finite VC Dimension"],"prefix":"10.1007","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":[[2023,9,22]]},"reference":[{"key":"40_CR1","doi-asserted-by":"publisher","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. Theor. 58, 1203\u20131214 (2012)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"40_CR2","first-page":"1517","volume":"49","author":"M Telgarsky","year":"2016","unstructured":"Telgarsky, M.: Benefits of depth in neural networks. Proc. Mach. Learn. Res. 49, 1517\u20131539 (2016)","journal-title":"Proc. Mach. Learn. Res."},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.neunet.2017.07.002","volume":"94","author":"D Yarotsky","year":"2017","unstructured":"Yarotsky, D.: Error bounds for approximations with deep ReLU networks. Neural Netw. 94, 103\u2013114 (2017)","journal-title":"Neural Netw."},{"key":"40_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.ins.2015.09.021","volume":"364\u2013365","author":"A Gorban","year":"2016","unstructured":"Gorban, A., Tyukin, I., Prokhorov, D., Sofeikov, K.: Approximation with random bases: pro et contra. Inf. Sci. 364\u2013365, 129\u2013145 (2016)","journal-title":"Inf. Sci."},{"key":"40_CR5","first-page":"2017","volume":"376","author":"A Gorban","year":"2018","unstructured":"Gorban, A., Tyukin, I.: Blessing of dimensionality: mathematical foundations of the statistical physics of data. Philos. Trans. Royal Soc. A 376, 2017\u20132037 (2018)","journal-title":"Philos. Trans. Royal Soc. A"},{"key":"40_CR6","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.plrev.2018.09.005","volume":"29","author":"AN Gorban","year":"2019","unstructured":"Gorban, A.N., Makarov, V.A., Tyukin, I.Y.: The unreasonable effectiveness of small neural ensembles in high-dimensional brain. Phys. Life Rev. 29, 55\u201388 (2019)","journal-title":"Phys. Life Rev."},{"key":"40_CR7","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":"40_CR8","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.: Probabilistic lower bounds for approximation by shallow perceptron networks. Neural Netw. 91, 34\u201341 (2017)","journal-title":"Neural Netw."},{"key":"40_CR9","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.plrev.2019.03.014","volume":"29","author":"V K\u016frkov\u00e1","year":"2019","unstructured":"K\u016frkov\u00e1, V.: Some insights from high-dimensional spheres. Phys. Life Rev. 29, 98\u2013100 (2019)","journal-title":"Phys. Life Rev."},{"key":"40_CR10","volume-title":"Probl\u00e9mes concrets d\u2019analyse fonctionnelle","author":"P L\u00e9vy","year":"1951","unstructured":"L\u00e9vy, P., Pellegrino, F.: Probl\u00e9mes concrets d\u2019analyse fonctionnelle. Gauthier-Villars, Paris (1951)"},{"key":"40_CR11","unstructured":"Milman, V., Schechtman, G.: Asymptotic theory of finite dimensional normed spaces. Volume 1200 of Lecture Notes in Mathematics. Springer-Verlag (1986)"},{"key":"40_CR12","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."},{"key":"40_CR13","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":"40_CR14","volume-title":"High-Dimensional Probability","author":"R Vershynin","year":"2020","unstructured":"Vershynin, R.: High-Dimensional Probability. University of California, Irvine (2020)"},{"key":"40_CR15","first-page":"148","volume-title":"Surveys in Combinatorics","author":"C McDiarmid","year":"1989","unstructured":"McDiarmid, C.: On the method of bounded differences. In: Siemons, J. (ed.) Surveys in Combinatorics, pp. 148\u2013188. Cambridge University Press, Cambridge (1989)"},{"issue":"2","key":"40_CR16","first-page":"264","volume":"16","author":"VN Vapnik","year":"1971","unstructured":"Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Dokl. Akad. Nauk SSSR 16(2), 264\u2013279 (1971)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"Dubhashi, D., Panconesi, A.: Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511581274"},{"key":"40_CR18","doi-asserted-by":"publisher","first-page":"247","DOI":"10.2140\/pjm.1972.41.247","volume":"41","author":"S Shelah","year":"1972","unstructured":"Shelah, S.: A combinatorial problem; stability and order for models and theories in infinitary languages. Pac. J. Math. 41, 247\u2013261 (1972)","journal-title":"Pac. J. Math."},{"key":"40_CR19","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","volume":"13","author":"N Sauer","year":"1972","unstructured":"Sauer, N.: On the density of families of sets. J. Comb. Theor. 13, 145\u2013147 (1972)","journal-title":"J. Comb. Theor."},{"issue":"19","key":"40_CR20","doi-asserted-by":"publisher","first-page":"12641","DOI":"10.1007\/s00500-021-05938-4","volume":"25","author":"V K\u016frkov\u00e1","year":"2021","unstructured":"K\u016frkov\u00e1, V., Sanguineti, M.: Correlations of random classifiers on large data sets. Soft. Comput. 25(19), 12641\u201312648 (2021). https:\/\/doi.org\/10.1007\/s00500-021-05938-4","journal-title":"Soft. Comput."},{"key":"40_CR21","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.neunet.2023.06.004","volume":"165","author":"V K\u016frkov\u00e1","year":"2023","unstructured":"K\u016frkov\u00e1, V., Sanguineti, M.: Approximation of classifiers by deep perceptron networks. Neural Netw. 165, 654\u2013661 (2023)","journal-title":"Neural Netw."}],"container-title":["Lecture Notes in Computer Science","Artificial Neural Networks and Machine Learning \u2013 ICANN 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-44207-0_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T14:08:53Z","timestamp":1695305333000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44207-0_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031442063","9783031442070"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44207-0_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 September 2023","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":"Heraklion","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icann2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/e-nns.org\/icann2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","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":"947","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":"426","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":"22","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":"45% - 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.4","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":"type of other papers accepted  : 9 Abstract","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)"}}]}}