{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T21:07:07Z","timestamp":1764882427955,"version":"3.46.0"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Broadcom-VMware"},{"name":"Mitacs through ALLRP","award":["577577-22"],"award-info":[{"award-number":["577577-22"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1109\/tpami.2025.3610113","type":"journal-article","created":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T17:33:51Z","timestamp":1758044031000},"page":"932-945","source":"Crossref","is-referenced-by-count":0,"title":["ACLI: A CNN Pruning Framework Leveraging Adjacent Convolutional Layer Interdependence and $\\gamma$\u03b3-Weakly Submodularity"],"prefix":"10.1109","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5622-1783","authenticated-orcid":false,"given":"Sadegh","family":"Tofigh","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Ecole de technologie superieure, University of Quebec, Montreal, QC, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5342-1824","authenticated-orcid":false,"given":"Mohammad","family":"Askarizadeh","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Ecole de technologie superieure, University of Quebec, Montreal, QC, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2924-6659","authenticated-orcid":false,"given":"M. Omair","family":"Ahmad","sequence":"additional","affiliation":[{"name":"Department Electrical and Computer Engineering, Concordia University, Montreal, QC, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3989-5476","authenticated-orcid":false,"given":"M.N.S.","family":"Swamy","sequence":"additional","affiliation":[{"name":"Department Electrical and Computer Engineering, Concordia University, Montreal, QC, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9354-7544","authenticated-orcid":false,"given":"Kim Khoa","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Ecole de technologie superieure, University of Quebec, Montreal, QC, Canada"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/CVPR52688.2022.01203"},{"key":"ref2","article-title":"Pruning filters for efficient convnets","volume-title":"Proc. Int. Conf. Learn. Representation","author":"Li","year":"2017"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/TPAMI.2017.2699184"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/msp.2017.2765695"},{"key":"ref5","first-page":"1135","article-title":"Compressing neural networks using the variational information bottleneck","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Dai","year":"2018"},{"key":"ref6","first-page":"1057","article-title":"Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection","author":"Das","year":"2011","journal-title":"Proc. 28th Int. Conf. Mach. Learn. (ICML\u201911)"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"ref8","first-page":"6382","article-title":"Global sparse momentum SGD for pruning very deep neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Ding","year":"2019"},{"key":"ref9","first-page":"36613","article-title":"Data-efficient structured pruning via submodular optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Halabi","year":"2022"},{"key":"ref10","article-title":"The lottery ticket hypothesis: Finding sparse, trainable neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Frankle","year":"2019"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/CVPR.2014.81"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/ICCV51070.2023.01601"},{"key":"ref13","first-page":"1135","article-title":"Learning both weights and connections for efficient neural network","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"28","author":"Han","year":"2015"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/CVPR.2016.90"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/CVPR.2019.00447"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/TPAMI.2023.3334614"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/ICCV.2017.155"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1007\/978-3-030-01270-0_19"},{"year":"2009","author":"Krizhevsky","article-title":"Learning multiple layers of features from tiny images","key":"ref19"},{"key":"ref20","article-title":"Provable filter pruning for efficient neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Liebenwein","year":"2020"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/TNNLS.2021.3084206"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1109\/CVPR42600.2020.00160"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.24963\/ijcai.2018\/336"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/CVPR.2019.00290"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/TNNLS.2022.3162067"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1109\/ICCV.2017.298"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/CVPR.2015.7298965"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1109\/TPAMI.2018.2858232"},{"key":"ref29","article-title":"Diversity networks: Neural network compression using determinantal point processes","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Mariet","year":"2016"},{"key":"ref30","first-page":"368","article-title":"The information bottleneck method","volume-title":"Proc. 37th Annu. Allerton Conf. Commun., Control, Comput.","author":"Tishby","year":"1999"},{"key":"ref31","article-title":"SOSP: Efficiently capturing global correlations by second-order structured pruning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Nonnenmacher","year":"2022"},{"key":"ref32","first-page":"5113","article-title":"Collaborative channel pruning for deep networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Peng","year":"2019"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1109\/TNNLS.2023.3244994"},{"key":"ref34","first-page":"91","article-title":"Faster R-CNN: Towards real-time object detection with region proposal networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"28","author":"Ren","year":"2015"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1016\/j.neunet.2021.12.017"},{"key":"ref36","first-page":"24604","article-title":"CHIP: Channel independence-based pruning for compact neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Sui","year":"2021"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.4324\/9781410605337-29"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1109\/ITW.2015.7133169"},{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1109\/LSP.2022.3164328"},{"key":"ref40","first-page":"6566","article-title":"EigenDamage: Structured pruning in the Kronecker-factored eigenbasis","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wang","year":"2019"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1007\/978-3-030-58526-6_16"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1109\/JIOT.2022.3190873"},{"key":"ref43","article-title":"Rethinking the smaller-norm-less-informative assumption in channel pruning of convolution layers","author":"Ye","year":"2018","journal-title":"Proc. 6th Int. Conf. Learn. Representations (ICLR)"},{"key":"ref44","first-page":"2133","article-title":"Gate decorator: Global filter pruning method for accelerating deep convolutional neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"You","year":"2019"},{"doi-asserted-by":"publisher","key":"ref45","DOI":"10.1109\/CVPR.2018.00958"},{"key":"ref46","first-page":"20863","article-title":"RED: Looking for redundancies for data-freestructured compression of deep neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Yvinec","year":"2021"},{"doi-asserted-by":"publisher","key":"ref47","DOI":"10.1109\/TPAMI.2022.3179616"},{"doi-asserted-by":"publisher","key":"ref48","DOI":"10.1007\/s11263-025-02437-z"},{"key":"ref49","first-page":"9865","article-title":"Neuron-level structured pruning using polarization regularizer","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Zhuang","year":"2020"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/34\/11275622\/11164533.pdf?arnumber=11164533","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T21:01:39Z","timestamp":1764882099000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11164533\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":49,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2025.3610113","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"type":"print","value":"0162-8828"},{"type":"electronic","value":"2160-9292"},{"type":"electronic","value":"1939-3539"}],"subject":[],"published":{"date-parts":[[2026,1]]}}}