{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:18:51Z","timestamp":1753600731911,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926373"},{"type":"electronic","value":"9783030926380"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-92638-0_18","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T13:02:45Z","timestamp":1641042165000},"page":"297-315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A UniverApproCNN with\u00a0Universal Approximation and\u00a0Explicit Training Strategy"],"prefix":"10.1007","author":[{"given":"Yin","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yifeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Senqiao","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"issue":"4","key":"18_CR1","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)","journal-title":"Math. Control Signals Systems"},{"key":"18_CR2","doi-asserted-by":"publisher","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 Numer. 8, 143\u2013195 (1999)","journal-title":"Acta Numer."},{"issue":"1\u20133","key":"18_CR3","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10444-004-7206-2","volume":"25","author":"DX Zhou","year":"2006","unstructured":"Zhou, D.X., Jetter, K.: Approximation with polynomial kernels and SVM classifiers. Adv. Comput. Math. 25(1\u20133), 323\u2013344 (2006)","journal-title":"Adv. Comput. Math."},{"issue":"3","key":"18_CR4","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1109\/18.256506","volume":"39","author":"L Breiman","year":"1993","unstructured":"Breiman, L.: Hinging hyperplanes for regression, classification, and function approximation. IEEE Trans. Inf. Theory 39(3), 999\u20131013 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR5","unstructured":"Klusowski, J.M., Barron, A.R.: Approximation by combinations of ReLU and squared ReLU ridge functions with $$l^{1}$$ and $$l^{0}$$ controls (2016)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Barron, A.R.: Universal approximation bounds for superpositions of a sigmoidal function. IEEE Trans. Inf. Theory 39(3), 930\u2013945 (1993)","DOI":"10.1109\/18.256500"},{"key":"18_CR7","unstructured":"Klusowski, J.M., Barron, A.R.: Uniform approximation by neural networks activated by first and second order ridge splines. IEEE Trans. Inf. Theory (2016)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"01","DOI":"10.1016\/0893-6080(89)90011-7","volume":"2","author":"KM Hornik","year":"1989","unstructured":"Hornik, K.M., Stinchcomb, M., White, H.: Multilayer feedforward networks are universal approximator. IEEE Trans. Neural Networks 2, 01 (1989)","journal-title":"IEEE Trans. Neural Networks"},{"issue":"92","key":"18_CR9","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1142\/S0219530518500124","volume":"16","author":"D-X Zhou","year":"2018","unstructured":"Zhou, D.-X.: Deep distributed convolutional neural networks: Universality. Anal. Appl. 16(92), 895\u2013919 (2018)","journal-title":"Anal. Appl."},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Mhaskar, H.N., Poggio, T.: Deep vs. shallow networks: an approximation theory perspective. Anal. Appl. 14(06), 829\u2013848 (2016)","DOI":"10.1142\/S0219530516400042"},{"issue":"2065","key":"18_CR11","doi-asserted-by":"publisher","first-page":"20150203","DOI":"10.1098\/rsta.2015.0203","volume":"374","author":"S Mallat","year":"2016","unstructured":"Mallat, S.: Understanding deep convolutional networks. Phil. Trans. R. Soc. A 374(2065), 20150203\u201320150203 (2016)","journal-title":"Phil. Trans. R. Soc. A"},{"key":"18_CR12","unstructured":"Steinwart, I., Thomann, P., Schmid, N.: Learning with hierarchical gaussian kernels. arXiv Machine Learning (2016)"},{"issue":"8","key":"18_CR13","doi-asserted-by":"publisher","first-page":"1872","DOI":"10.1109\/TPAMI.2012.230","volume":"35","author":"J Bruna","year":"2013","unstructured":"Bruna, J., Mallat, S.: Invariant scattering convolution networks. IEEE Trans. Pattern Anal. Mach. Intell. 35(8), 1872\u20131886 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"18_CR14","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1016\/j.acha.2019.06.004","volume":"48","author":"D Zhou","year":"2020","unstructured":"Zhou, D.: Universality of deep convolutional neural networks. Appl. Comput. Harmon. Anal. 48(2), 787\u2013794 (2020)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"18_CR15","unstructured":"Santurkar, S., Tsipras, D., Ilyas, A., M\u0105dry, A.: How does batch normalization help optimization? In: Proceedings of the 32nd International Conference on Neural Information Processing Systems, pp. 2488\u20132498 (2018)"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Wang, Y., Wang, Y., Hu, G., Liu, Y., Zhao, Y.: Adaptive skewness kurtosis neural network: enabling communication between neural nodes within a layer, pp. 498\u2013507 (2020)","DOI":"10.1007\/978-3-030-63823-8_57"},{"issue":"4","key":"18_CR17","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1023\/A:1016641629556","volume":"13","author":"M Burger","year":"2000","unstructured":"Burger, M., Engl, H.W.: Training neural networks with noisy data as an Ill-posed problem. Adv. Comput. Math. 13(4), 335\u2013354 (2000)","journal-title":"Adv. Comput. Math."}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Collaborative Computing: Networking, Applications and Worksharing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92638-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T13:10:39Z","timestamp":1641042639000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92638-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926373","9783030926380"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92638-0_18","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CollaborateCom","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Collaborative Computing: Networking, Applications and Worksharing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"colcom2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/collaboratecom.eai-conferences.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Confy +","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"206","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":"62","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":"7","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":"30% - 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":"3","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":"3","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)"}}]}}