{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T12:29:30Z","timestamp":1777984170825,"version":"3.51.4"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1109\/tpami.2025.3570545","type":"journal-article","created":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T13:32:46Z","timestamp":1747315966000},"page":"8297-8304","source":"Crossref","is-referenced-by-count":0,"title":["On the Universal Approximation Properties of Deep Neural Networks Using MAM Neurons"],"prefix":"10.1109","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3772-4817","authenticated-orcid":false,"given":"Philippe","family":"Bich","sequence":"first","affiliation":[{"name":"Department of Electronics and Telecommunications, Politecnico di Torino, Torino, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1010-3858","authenticated-orcid":false,"given":"Andriy","family":"Enttsel","sequence":"additional","affiliation":[{"name":"Department of Electrical, Electronic, and Information Engineering, University of Bologna, Bologna, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1507-9092","authenticated-orcid":false,"given":"Luciano","family":"Prono","sequence":"additional","affiliation":[{"name":"Department of Electronics and Telecommunications, Politecnico di Torino, Torino, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3441-3634","authenticated-orcid":false,"given":"Alex","family":"Marchioni","sequence":"additional","affiliation":[{"name":"Department of Electrical, Electronic, and Information Engineering, University of Bologna, Bologna, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8777-7135","authenticated-orcid":false,"given":"Fabio","family":"Pareschi","sequence":"additional","affiliation":[{"name":"Department of Electronics and Telecommunications, Politecnico di Torino, Torino, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3818-9115","authenticated-orcid":false,"given":"Mauro","family":"Mangia","sequence":"additional","affiliation":[{"name":"Department of Electrical, Electronic, and Information Engineering, University of Bologna, Bologna, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2496-1856","authenticated-orcid":false,"given":"Gianluca","family":"Setti","sequence":"additional","affiliation":[{"name":"King Abdullah University of Science and Technology (KAUST), Thuwal, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4731-7860","authenticated-orcid":false,"given":"Riccardo","family":"Rovatti","sequence":"additional","affiliation":[{"name":"Department of Electrical, Electronic, and Information Engineering, University of Bologna, Bologna, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3164083"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2979670"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02551274"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(89)90020-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492900002919"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2019.2921977"},{"key":"ref9","article-title":"Beyond efficiency: A systematic survey of resource-efficient large language models","author":"Bai","year":"2024"},{"key":"ref10","first-page":"129","article-title":"What is the state of neural network pruning?","volume-title":"Proc. Mach. Learn. Syst.","volume":"2","author":"Blalock"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2025.3527644"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MWSCAS57524.2023.10405867"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/FUZZY.1992.258721"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/12.324566"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/91.669022"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9045(03)00078-9"},{"key":"ref17","article-title":"Approximating continuous functions by ReLU nets of minimal width","author":"Hanin","year":"2018"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2017.12.007"},{"key":"ref19","first-page":"1","article-title":"Achieve the minimum width of neural networks for universal approximation","volume-title":"Proc. 11th Int. Conf. Learn. Representations","author":"Cai"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2019.06.004"},{"issue":"1","key":"ref21","article-title":"Universal approximation in dropout neural networks","volume":"23","author":"Manita","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"ref22","first-page":"3094","article-title":"A universal approximation theorem of deep neural networks for expressing probability distributions","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Lu"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3183143"},{"key":"ref24","first-page":"19345","article-title":"Theoretically provable spiking neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2024.3380007"},{"key":"ref26","first-page":"291","article-title":"Sorting out Lipschitz function approximation","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Anil"},{"key":"ref27","first-page":"442","article-title":"Approximating Lipschitz continuous functions with GroupSort neural networks","volume-title":"Proc. 24th Int. Conf. Artif. Intell. Statist.","author":"Tanielian"},{"key":"ref28","article-title":"Rethinking Lipschitz neural networks and certified robustness: A Boolean function perspective","volume-title":"Proc. 36th Conf. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref29","first-page":"6231","article-title":"The expressive power of neural networks: A view from the width","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Lu"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1142\/s0219530525500423"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/3.3.175"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/34\/11118328\/11004616.pdf?arnumber=11004616","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T17:44:49Z","timestamp":1754588689000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11004616\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":31,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2025.3570545","relation":{"has-preprint":[{"id-type":"doi","id":"10.36227\/techrxiv.172503114.46773535\/v1","asserted-by":"object"}]},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9]]}}}