{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T14:35:27Z","timestamp":1774535727789,"version":"3.50.1"},"reference-count":64,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2020M680563"],"award-info":[{"award-number":["2020M680563"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["52131201"],"award-info":[{"award-number":["52131201"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1109\/tnnls.2023.3262952","type":"journal-article","created":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T17:37:46Z","timestamp":1680802666000},"page":"11595-11607","source":"Crossref","is-referenced-by-count":29,"title":["CATRO: Channel Pruning via Class-Aware Trace Ratio Optimization"],"prefix":"10.1109","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1115-8175","authenticated-orcid":false,"given":"Wenzheng","family":"Hu","sequence":"first","affiliation":[{"name":"School of Vehicle and Mobility, Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6818-1125","authenticated-orcid":false,"given":"Zhengping","family":"Che","sequence":"additional","affiliation":[{"name":"Midea Group, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4943-6625","authenticated-orcid":false,"given":"Ning","family":"Liu","sequence":"additional","affiliation":[{"name":"Midea Group, Beijing, China"}]},{"given":"Mingyang","family":"Li","sequence":"additional","affiliation":[{"name":"Institute for Artificial Intelligence (THUAI), the Beijing National Research Center for Information Science and Technology (BNRist), and the Department of Automation, Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4418-0114","authenticated-orcid":false,"given":"Jian","family":"Tang","sequence":"additional","affiliation":[{"name":"Midea Group, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8088-367X","authenticated-orcid":false,"given":"Changshui","family":"Zhang","sequence":"additional","affiliation":[{"name":"Institute for Artificial Intelligence (THUAI), the Beijing National Research Center for Information Science and Technology (BNRist), and the Department of Automation, Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4363-6108","authenticated-orcid":false,"given":"Jianqiang","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Vehicle and Mobility, Tsinghua University, Beijing, China"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1097","article-title":"ImageNet classification with deep convolutional neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Krizhevsky"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref3","first-page":"1","article-title":"Pruning filters for efficient ConvNets","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Li"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00447"},{"key":"ref5","first-page":"5122","article-title":"Operation-aware soft channel pruning using differentiable masks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Kang"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/309"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.541"},{"key":"ref8","first-page":"875","article-title":"Discrimination-aware channel pruning for deep neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhuang"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.55"},{"key":"ref10","first-page":"671","article-title":"Trace ratio criterion for feature selection","volume-title":"Proc. Conf. Artif. Intell. (AAAI)","volume":"2","author":"Nie"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2505311"},{"key":"ref12","first-page":"5113","article-title":"Collaborative channel pruning for deep networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Peng"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2020.103154"},{"key":"ref14","first-page":"1135","article-title":"Learning both weights and connections for efficient neural network","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NIPS)","author":"Han"},{"key":"ref15","first-page":"1","article-title":"Deep compression: Compressing deep neural networks with pruning, trained quantization and Huffman coding","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Han"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.298"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2019.2914438"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00160"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00208"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3161284"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3165123"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3149332"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2979517"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3141665"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3056201"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.5555\/3157096.3157329"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00289"},{"key":"ref28","first-page":"1","article-title":"Gate decorator: Global filter pruning method for accelerating deep convolutional neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"You"},{"key":"ref29","first-page":"10820","article-title":"Good subnetworks provably exist: Pruning via greedy forward selection","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ye"},{"key":"ref30","first-page":"10936","article-title":"SCOP: Scientific control for reliable neural network pruning","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Tang"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01234-2_48"},{"key":"ref32","first-page":"1","article-title":"Network pruning via transformable architecture search","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Dong"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00339"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/94"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5924"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58536-5_38"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2636827"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2018.2806995"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.107"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2885591"},{"key":"ref41","first-page":"1954","article-title":"Submodularity in data subset selection and active learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wei"},{"key":"ref42","first-page":"1742","article-title":"Optimal greedy diversity for recommendation","volume-title":"Proc. 24th Int. Joint Conf. Artif. Intell.","author":"Ashkan"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref45","first-page":"182","article-title":"Maximizing a submodular set function subject to a matroid constraint","volume-title":"Proc. Int. Conf. Integer Program. Combinat. Optim.","author":"Calinescu"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2688073.2688086"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623637"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-86523-8_10"},{"key":"ref49","first-page":"2436","article-title":"Submodular optimization with submodular cover and submodular knapsack constraints","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"26","author":"Iyer"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.106"},{"key":"ref51","first-page":"4410","article-title":"Online continuous dr-submodular maximization with long-term budget constraints","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Sadeghi"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198538493.001.0001"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.205"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00410"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01152"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i07.6910"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58598-3_36"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00290"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00159"},{"key":"ref60","article-title":"Learning multiple layers of features from tiny images","author":"Krizhevsky","year":"2009"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2013.6706807"},{"key":"ref63","first-page":"1","article-title":"How transferable are features in deep neural networks?","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yosinski"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/MITS.2017.2709780"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/10623582\/10094002.pdf?arnumber=10094002","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T10:25:53Z","timestamp":1722939953000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10094002\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8]]},"references-count":64,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2023.3262952","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8]]}}}