{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:17:28Z","timestamp":1743092248537,"version":"3.40.3"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031157905"},{"type":"electronic","value":"9783031157912"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15791-2_3","type":"book-chapter","created":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T07:34:06Z","timestamp":1663313646000},"page":"17-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Randomness of\u00a0Input Data Spaces is an\u00a0A Priori Predictor for\u00a0Generalization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8209-1465","authenticated-orcid":false,"given":"Martin","family":"Briesch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8873-7143","authenticated-orcid":false,"given":"Dominik","family":"Sobania","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3376-427X","authenticated-orcid":false,"given":"Franz","family":"Rothlauf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,12]]},"reference":[{"key":"3_CR1","unstructured":"Abadi, M., et al.: Tensorflow: a system for large-scale machine learning. In: 12th $$\\{$$USENIX$$\\}$$ Symposium on Operating Systems Design and Implementation ($$\\{$$OSDI$$\\}$$ 16), pp. 265\u2013283 (2016)"},{"key":"3_CR2","unstructured":"Arora, S., Cohen, N., Hu, W., Luo, Y.: Implicit regularization in deep matrix factorization. In: Wallach, H., Larochelle, H., Beygelzimer, A., d\u2019Alch\u00e9-Buc, F., Fox, E., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 32. Curran Associates, Inc. (2019)"},{"key":"3_CR3","unstructured":"Arora, S., Du, S., Hu, W., Li, Z., Wang, R.: Fine-grained analysis of optimization and generalization for overparameterized two-layer neural networks. In: International Conference on Machine Learning, pp. 322\u2013332. PMLR (2019)"},{"key":"3_CR4","unstructured":"Arora, S., Ge, R., Neyshabur, B., Zhang, Y.: Stronger generalization bounds for deep nets via a compression approach. In: International Conference on Machine Learning, pp. 254\u2013263. PMLR (2018)"},{"key":"3_CR5","unstructured":"Arpit, D., et al.: A closer look at memorization in deep networks. In: International Conference on Machine Learning, pp. 233\u2013242. PMLR (2017)"},{"key":"3_CR6","unstructured":"Bartlett, P.L., Foster, D.J., Telgarsky, M.J.: Spectrally-normalized margin bounds for neural networks. In: Guyon, I. (eds.) Advances in Neural Information Processing Systems, vol. 30. Curran Associates, Inc. (2017)"},{"key":"3_CR7","first-page":"463","volume":"3","author":"PL Bartlett","year":"2002","unstructured":"Bartlett, P.L., Mendelson, S.: Rademacher and gaussian complexities: risk bounds and structural results. J. Mach. Learn. Res. 3, 463\u2013482 (2002)","journal-title":"J. Mach. Learn. Res."},{"issue":"32","key":"3_CR8","doi-asserted-by":"publisher","first-page":"15849","DOI":"10.1073\/pnas.1903070116","volume":"116","author":"M Belkin","year":"2019","unstructured":"Belkin, M., Hsu, D., Ma, S., Mandal, S.: Reconciling modern machine-learning practice and the classical bias-variance trade-off. Proc. Nat. Acad. Sci. 116(32), 15849\u201315854 (2019)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"3_CR9","unstructured":"Bengio, Y., Delalleau, O., Le Roux, N.: The curse of highly variable functions for local kernel machines. In: Advances in Neural Information Processing systems, vol. 18, p. 107 (2006)"},{"key":"3_CR10","first-page":"499","volume":"2","author":"O Bousquet","year":"2002","unstructured":"Bousquet, O., Elisseeff, A.: Stability and generalization. J. Mach. Learn. Res. 2, 499\u2013526 (2002)","journal-title":"J. Mach. Learn. Res."},{"key":"3_CR11","volume-title":"Time Series Analysis: Forecasting and Control","author":"GE Box","year":"1976","unstructured":"Box, G.E., Jenkins, G.M.: Time Series Analysis: Forecasting and Control. Holden-Day, San Francisco (1976)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-48892-8_5","volume-title":"Selected Areas in Cryptography","author":"Jean -S\u00e9bastien Coron","year":"1999","unstructured":"Coron, Jean -S\u00e9bastien., Naccache, David: An accurate evaluation of maurer\u2019s universal test. In: Tavares, Stafford, Meijer, Henk (eds.) SAC 1998. LNCS, vol. 1556, pp. 57\u201371. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48892-8_5"},{"issue":"4","key":"3_CR13","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF02551274","volume":"2","author":"G Cybenko","year":"1989","unstructured":"Cybenko, G.: Approximation by superpositions of a sigmoidal function. Math. Control Signals Systems 2(4), 303\u2013314 (1989). https:\/\/doi.org\/10.1007\/BF02551274","journal-title":"Math. Control Signals Systems"},{"key":"3_CR14","unstructured":"Dziugaite, G.K., Roy, D.M.: Computing nonvacuous generalization bounds for deep (stochastic) neural networks with many more parameters than training data. arXiv preprint arXiv:1703.11008 (2017)"},{"key":"3_CR15","unstructured":"Elson, J., Douceur, J.R., Howell, J., Saul, J.: Asirra: a captcha that exploits interest-aligned manual image categorization. In: ACM Conference on Computer and Communications Security, vol. 7, pp. 366\u2013374 (2007)"},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/JSAIT.2020.2983192","volume":"1","author":"F Farnia","year":"2020","unstructured":"Farnia, F., Zhang, J.M., David, N.T.: A fourier-based approach to generalization and optimization in deep learning. IEEE J. Sel. Areas Inf. Theory 1(1), 145\u2013156 (2020)","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"key":"3_CR17","unstructured":"Golowich, N., Rakhlin, A., Shamir, O.: Size-independent sample complexity of neural networks. In: Conference on Learning Theory, pp. 297\u2013299. PMLR (2018)"},{"key":"3_CR18","volume-title":"Deep Learning","author":"I Goodfellow","year":"2016","unstructured":"Goodfellow, I., Bengio, Y., Courville, A.: Deep Learning, vol. 1. MIT press, Cambridge (2016)"},{"key":"3_CR19","unstructured":"Hardt, M., Recht, B., Singer, Y.: Train faster, generalize better: Stability of stochastic gradient descent. In: International Conference on Machine Learning, pp. 1225\u20131234. PMLR (2016)"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Herrmann, S., Ochoa, G., Rothlauf, F.: Communities of local optima as funnels in fitness landscapes. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016, pp. 325\u2013331, GECCO \u201916, Association for Computing Machinery, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2908812.2908818","DOI":"10.1145\/2908812.2908818"},{"issue":"5786","key":"3_CR21","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1126\/science.1127647","volume":"313","author":"GE Hinton","year":"2006","unstructured":"Hinton, G.E., Salakhutdinov, R.R.: Reducing the dimensionality of data with neural networks. Science 313(5786), 504\u2013507 (2006)","journal-title":"Science"},{"issue":"2","key":"3_CR22","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0893-6080(91)90009-T","volume":"4","author":"K Hornik","year":"1991","unstructured":"Hornik, K.: Approximation capabilities of multilayer feedforward networks. Neural Netw. 4(2), 251\u2013257 (1991)","journal-title":"Neural Netw."},{"key":"3_CR23","unstructured":"Imaizumi, M., Fukumizu, K.: Deep neural networks learn non-smooth functions effectively. In: The 22nd International Conference on Artificial Intelligence and Statistics, pp. 869\u2013878. PMLR (2019)"},{"key":"3_CR24","unstructured":"Jones, T., Forrest, S.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Proceedings of the 6th International Conference on Genetic Algorithms, pp. 184\u2013192. Morgan Kaufmann Publishers Inc., San Francisco (1995)"},{"key":"3_CR25","unstructured":"Kawaguchi, K., Kaelbling, L.P., Bengio, Y.: Generalization in deep learning. arXiv preprint arXiv:1710.05468 (2017)"},{"key":"3_CR26","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)"},{"key":"3_CR27","unstructured":"Kingma, D.P., Welling, M.: Auto-encoding variational bayes. arXiv preprint arXiv:1312.6114 (2013)"},{"key":"3_CR28","unstructured":"Krizhevsky, A., Hinton, G., et al.: Learning multiple layers of features from tiny images (2009)"},{"issue":"7553","key":"3_CR29","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(7553), 436\u2013444 (2015)","journal-title":"Nature"},{"issue":"11","key":"3_CR30","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(11), 2278\u20132324 (1998)","journal-title":"Proc. IEEE"},{"key":"3_CR31","unstructured":"Liang, T., Poggio, T., Rakhlin, A., Stokes, J.: Fisher-rao metric, geometry, and complexity of neural networks. In: The 22nd International Conference on Artificial Intelligence and Statistics, pp. 888\u2013896. PMLR (2019)"},{"key":"3_CR32","unstructured":"Ma, C., Wu, L., et al.: A priori estimates of the population risk for two-layer neural networks. arXiv preprint arXiv:1810.06397 (2018)"},{"issue":"2","key":"3_CR33","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF00193563","volume":"5","author":"Ueli M. Maurer","year":"1992","unstructured":"Maurer, Ueli M..: A universal statistical test for random bit generators. J. Cryptology 5(2), 89\u2013105 (1992). https:\/\/doi.org\/10.1007\/BF00193563","journal-title":"J. Cryptology"},{"key":"3_CR34","unstructured":"Nagarajan, V., Kolter, J.Z.: Uniform convergence may be unable to explain generalization in deep learning. In: Wallach, H., Larochelle, H., Beygelzimer, A., d\u2019Alch\u00e9-Buc, F., Fox, E., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 32. Curran Associates, Inc. (2019)"},{"key":"3_CR35","unstructured":"Neyshabur, B., Bhojanapalli, S., Mcallester, D., Srebro, N.: Exploring generalization in deep learning. In: Guyon, I. (eds.) Advances in Neural Information Processing Systems, vol. 30. Curran Associates, Inc. (2017)"},{"key":"3_CR36","unstructured":"Neyshabur, B., Bhojanapalli, S., Srebro, N.: A pac-bayesian approach to spectrally-normalized margin bounds for neural networks. In: International Conference on Learning Representations (2018)"},{"key":"3_CR37","unstructured":"Neyshabur, B., Li, Z., Bhojanapalli, S., LeCun, Y., Srebro, N.: The role of over-parametrization in generalization of neural networks. In: International Conference on Learning Representations (2019)"},{"key":"3_CR38","unstructured":"Neyshabur, B., Tomioka, R., Srebro, N.: Norm-based capacity control in neural networks. In: Conference on Learning Theory, pp. 1376\u20131401. PMLR (2015)"},{"key":"3_CR39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72962-4","volume-title":"Design of Modern Heuristics: Principles and Application","author":"F Rothlauf","year":"2011","unstructured":"Rothlauf, F.: Design of Modern Heuristics: Principles and Application. Springer Science Business Media, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-540-72962-4"},{"key":"3_CR40","unstructured":"Smith, S.L., Le, Q.V.: A bayesian perspective on generalization and stochastic gradient descent. In: International Conference on Learning Representations (2018)"},{"issue":"1","key":"3_CR41","first-page":"2822","volume":"19","author":"D Soudry","year":"2018","unstructured":"Soudry, D., Hoffer, E., Nacson, M.S., Gunasekar, S., Srebro, N.: The implicit bias of gradient descent on separable data. J. Mach. Learn. Res. 19(1), 2822\u20132878 (2018)","journal-title":"J. Mach. Learn. Res."},{"key":"3_CR42","unstructured":"Vapnik, V.: Principles of risk minimization for learning theory. In: Advances in Neural Information Processing Systems, pp. 831\u2013838 (1992)"},{"key":"3_CR43","volume-title":"The Nature of Statistical Learning Theory","author":"V Vapnik","year":"2013","unstructured":"Vapnik, V.: The Nature of Statistical Learning Theory. Springer Science & business media, Heidelberg (2013)"},{"issue":"2","key":"3_CR44","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1214\/aoms\/1177731909","volume":"11","author":"A Wald","year":"1940","unstructured":"Wald, A., Wolfowitz, J.: On a test whether two samples are from the same population. Ann. Math. Stat. 11(2), 147\u2013162 (1940)","journal-title":"Ann. Math. Stat."},{"issue":"7","key":"3_CR45","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1162\/neco.1996.8.7.1391","volume":"8","author":"DH Wolpert","year":"1996","unstructured":"Wolpert, D.H.: The existence of a priori distinctions between learning algorithms. Neural Comput. 8(7), 1391\u20131420 (1996)","journal-title":"Neural Comput."},{"issue":"7","key":"3_CR46","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.1162\/neco.1996.8.7.1341","volume":"8","author":"DH Wolpert","year":"1996","unstructured":"Wolpert, D.H.: The lack of a priori distinctions between learning algorithms. Neural Comput. 8(7), 1341\u20131390 (1996)","journal-title":"Neural Comput."},{"key":"3_CR47","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for search. Technical report, SFI-TR-95-02-010, Santa Fe Institute (1995)"},{"issue":"1","key":"3_CR48","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"3_CR49","unstructured":"Wright, S.: The roles of mutation, inbreeding, crossbreeding, and selection in evolution (1932)"},{"key":"3_CR50","unstructured":"Zhang, C., Bengio, S., Hardt, M., Recht, B., Vinyals, O.: Understanding deep learning requires rethinking generalization. In: International Conference on Learning Representations (2017)"},{"key":"3_CR51","unstructured":"Zhou, W., Veitch, V., Austern, M., Adams, R.P., Orbanz, P.: Non-vacuous generalization bounds at the imagenet scale: a PAC-bayesian compression approach. In: International Conference on Learning Representations (2019)"}],"container-title":["Lecture Notes in Computer Science","KI 2022: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15791-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T07:34:49Z","timestamp":1663313689000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15791-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031157905","9783031157912"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15791-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"12 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"German Conference on Artificial Intelligence (K\u00fcnstliche Intelligenz)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ki2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ki2022.gi.de\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","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":"12","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":"5","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":"26% - 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,6","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":"2,1","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to COVID-19 the conference was held virtually","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)"}}]}}