{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T12:40:10Z","timestamp":1759236010510,"version":"3.44.0"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Emerg. Top. Comput. Intell."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1109\/tetci.2025.3547856","type":"journal-article","created":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:59:01Z","timestamp":1742399941000},"page":"3572-3581","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Weight Pruning for Optical Neural Networks: When Pruned Weights are Non-Zeros"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8075-8521","authenticated-orcid":false,"given":"Shuo","family":"Zhao","sequence":"first","affiliation":[{"name":"Data Science Research Center, Duke Kunshan University, Jiangsu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4405-839X","authenticated-orcid":false,"given":"Kun","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Electronic Information, Wuhan University, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4510-2436","authenticated-orcid":false,"given":"Xin","family":"Li","sequence":"additional","affiliation":[{"name":"Data Science Research Center, Duke Kunshan University, Jiangsu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying-Chi","family":"Chen","sequence":"additional","affiliation":[{"name":"Data Science Research Center, Duke Kunshan University, Jiangsu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1097","article-title":"ImageNet classification with deep convolutional neural networks","volume-title":"Proc. 26th Int. Conf. Neural Inf. Process. Syst.","author":"Krizhevsky","year":"2012"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1126\/science.aat8084"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSTQE.2019.2921376"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1142\/S0129065709002002"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2018.12.002"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.3390\/brainsci12070863"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2987333"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2022.3171170"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2023.3241431"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.susoc.2021.09.004"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.07.045"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2024.3447085"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00890"},{"key":"ref16","first-page":"177","article-title":"Comparing biases for minimal network construction with back-propagation","volume-title":"Proc. 2nd Int. Conf.Neural Inform. Process. Syst.","author":"Hanson","year":"1989"},{"key":"ref17","first-page":"598","article-title":"Optimal brain damage","volume-title":"Proc. 3rd Int. Conf. Neural Inf. Process. Syst.","author":"LeCun","year":"1990"},{"key":"ref18","first-page":"164","article-title":"Second order derivatives for network pruning: Optimal brain surgeon","volume-title":"Proc. 6th Int. Conf. Neural Inf. Process. Syst.","author":"Hassibi","year":"1993"},{"key":"ref19","first-page":"18098","article-title":"Woodfisher: Efficient second-order approximation for neural network compression","volume-title":"Proc. 34th Int. Conf. Neural Inf. Process. Syst.","author":"Singh","year":"2020"},{"key":"ref20","first-page":"4860","article-title":"Learning to prune deep neural networks via layer-wise optimal brain surgeon","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Dong","year":"2017"},{"key":"ref21","first-page":"25668","article-title":"The combinatorial brain surgeon: Pruning weights that cancel one another in neural networks","volume-title":"Proc Int. Conf. Mach. Learn","author":"Yu","year":"2022"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01152"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/cvpr.2018.00890"},{"key":"ref24","first-page":"3177","article-title":"Net-Trim: Convex pruning of deep neural networks with performance guarantee","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Aghasi","year":"2017"},{"key":"ref25","first-page":"1135","article-title":"Learning both weights and connections for efficient neural network","volume-title":"Proc. 29th Int. Conf. Neural Inf. Process. Syst.","author":"Han","year":"2015"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3275159"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3184730"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58112-1_32"},{"key":"ref29","first-page":"1379","article-title":"Dynamic network surgery for efficient DNNs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Guo","year":"2016"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.l803.03635"},{"key":"ref31","first-page":"1","article-title":"SNIP: Single-shot network pruning based on connection sensitivity","volume-title":"Proc. Int. Conf. Learn. Represent","author":"Lee","year":"2018"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2023.3279281"},{"key":"ref33","article-title":"Pruning filters for efficient ConvNets","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Li","year":"2017"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3179616"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3260903"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3066410"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.fmre.2022.07.013"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3334614"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492913000032"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1063\/1.3035549"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"article-title":"Fashion-MNIST: A novel image dataset for benchmarking machine learning algorithms","year":"2017","author":"Xiao","key":"ref42"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2017.7966217"},{"article-title":"Deep learning for classical Japanese literature","year":"2018","author":"Clanuwat","key":"ref44"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV51070.2023.01600"},{"article-title":"OptG: Optimizing gradient-driven criteria in network sparsity","year":"2022","author":"Zhang","key":"ref46"}],"container-title":["IEEE Transactions on Emerging Topics in Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7433297\/11177632\/10933573.pdf?arnumber=10933573","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T12:21:29Z","timestamp":1759234889000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10933573\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10]]},"references-count":46,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tetci.2025.3547856","relation":{},"ISSN":["2471-285X"],"issn-type":[{"type":"electronic","value":"2471-285X"}],"subject":[],"published":{"date-parts":[[2025,10]]}}}