{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:11:01Z","timestamp":1743084661100,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031164149"},{"type":"electronic","value":"9783031164156"}],"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-16415-6_16","type":"book-chapter","created":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T07:03:51Z","timestamp":1672729431000},"page":"111-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Why, in Deep Learning, Non-smooth Activation Function Works Better Than Smooth Ones"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Cruz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Godoy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladik","family":"Kreinovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,4]]},"reference":[{"key":"16_CR1","volume-title":"Pattern Recognition and Machine Learning","author":"CM Bishop","year":"2006","unstructured":"Bishop, C.M.: Pattern Recognition and Machine Learning. Springer, New York (2006)"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Bun, M., Kothari, R., Thaler, J.: Quantum algorithms and approximating polynomials for composed functions with shared inputs. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms SODA\u20192019, San Diego, California (2019)","DOI":"10.1137\/1.9781611975482.42"},{"issue":"4","key":"16_CR3","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1145\/3444815.3444825","volume":"51","author":"M Bun","year":"2020","unstructured":"Bun, M., Thaler, J.: Approximate degree in classical and quantum computing. ACM SIGACT News 51(4), 48\u201372 (2020)","journal-title":"ACM SIGACT News"},{"key":"16_CR4","volume-title":"The Feynman Lectures on Physics","author":"R Feynman","year":"2005","unstructured":"Feynman, R., Leighton, R., Sands, M.: The Feynman Lectures on Physics. Addison Wesley, Boston, Massachusetts (2005)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Fuentes, O., Parra, J., Anthony, E., Kreinovich, V.: Why rectified linear neurons are efficient: a possible theoretical explanations. In: Kosheleva, O., Shary, S., Xiang, G., Zapatrin, R. (eds.) Beyond Traditional Probabilistic Data Processing Techniques: Interval, Fuzzy, etc, pp. 603\u2013613. Methods and Their Applications, Springer, Cham, Switzerland (2020)","DOI":"10.1007\/978-3-030-31041-7_34"},{"key":"16_CR6","volume-title":"Deep Leaning","author":"I Goodfellow","year":"2016","unstructured":"Goodfellow, I., Bengio, Y., Courville, A.: Deep Leaning. MIT Press, Cambridge, Massachusetts (2016)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Kreinovich, V., Kosheleva, O.: Optimization under uncertainty explains empirical success of deep learning heuristics. In: Pardalos, P., Rasskazova, V., Vrahatis, M.N. (eds.) Black Box Optimization, pp. 195\u2013220. Machine Learning and No-Free Lunch Theorems, Springer, Cham, Switzerland (2021)","DOI":"10.1007\/978-3-030-66515-9_8"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Tal, A.: Formula lower bounds via the quantum model. In: Proceedings of the 2017 ACM Symposium on Theory of Computing STOC\u20192017, Montreal, Quebec, Canada, June 19\u201323, 2017, pp. 1256\u20131268","DOI":"10.1145\/3055399.3055472"},{"key":"16_CR9","volume-title":"Modern Classical Physics: Optics, Fluids, Plasmas, Elasticity, Relativity, and Statistical Physics","author":"KS Thorne","year":"2017","unstructured":"Thorne, K.S., Blandford, R.D.: Modern Classical Physics: Optics, Fluids, Plasmas, Elasticity, Relativity, and Statistical Physics. Princeton University Press, Princeton, New Jersey (2017)"}],"container-title":["Studies in Systems, Decision and Control","Decision Making Under Uncertainty and Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16415-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T14:09:55Z","timestamp":1728655795000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16415-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031164149","9783031164156"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16415-6_16","relation":{},"ISSN":["2198-4182","2198-4190"],"issn-type":[{"type":"print","value":"2198-4182"},{"type":"electronic","value":"2198-4190"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"4 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}