{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,29]],"date-time":"2026-10-29T16:00:00Z","timestamp":1793289600711,"version":"4.5.0"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61932010"],"award-info":[{"award-number":["61932010"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1109\/tpami.2024.3437421","type":"journal-article","created":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T17:23:38Z","timestamp":1728581018000},"page":"10228-10245","source":"Crossref","is-referenced-by-count":6,"title":["Dual-Grained Lightweight Strategy"],"prefix":"10.1109","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5233-9637","authenticated-orcid":false,"given":"Debin","family":"Liu","sequence":"first","affiliation":[{"name":"School of Computer Science and Artificial Intelligence, Zhengzhou University, Zhengzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3449-5940","authenticated-orcid":false,"given":"Xiang","family":"Bai","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence and Automation, Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7479-585X","authenticated-orcid":false,"given":"Ruonan","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Artificial Intelligence, Zhengzhou University, Zhengzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5756-9765","authenticated-orcid":false,"given":"Xianjun","family":"Deng","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Engineering, Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7986-4244","authenticated-orcid":false,"given":"Laurence T.","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Artificial Intelligence, Zhengzhou University, Zhengzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"3891","article-title":"Tensor-train recurrent neural networks for video classification","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yang"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014683"},{"key":"ref3","article-title":"Prospect pruning: Finding trainable weights at initialization using meta-gradients","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Alizadeh"},{"key":"ref4","article-title":"Picking winning tickets before training by preserving gradient flow","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Wang"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/090752286"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV51070.2023.01600"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3066410"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICCVW60793.2023.00155"},{"key":"ref9","first-page":"16957","article-title":"Bert moons, evangelos eleftheriou, and bram-ernst verhoef. differentiable transportation pruning","volume-title":"Proc. IEEE\/CVF Int. Conf. Comput. Vis.","author":"Li"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3086914"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52729.2023.00766"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00977"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i6.25902"},{"key":"ref14","article-title":"Knowledge diffusion for distillation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Huang"},{"key":"ref15","article-title":"The lottery ticket hypothesis: Finding sparse, trainable neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Frankle"},{"key":"ref16","first-page":"3259","article-title":"Linear mode connectivity and the lottery ticket hypothesis","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Frankle"},{"key":"ref17","article-title":"SNIP: Single-shot network pruning based on connection sensitivity","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Lee"},{"key":"ref18","article-title":"Progressive skeletonization: Trimming more fat from a network at initialization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Jorge"},{"key":"ref19","first-page":"6377","article-title":"Pruning neural networks without any data by iteratively conserving synaptic flow","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Tanaka"},{"key":"ref20","article-title":"NTK-SAP: Improving neural network pruning by aligning training dynamics","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Wang"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/100804577"},{"key":"ref22","article-title":"Attention is all you need","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Vaswani"},{"key":"ref23","article-title":"An image is worth 16x16 words: Transformers for image recognition at scale","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Dosovitskiy"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-015-0816-y"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref27","article-title":"Learning multiple layers of features from tiny images","author":"Krizhevsky","year":"2009"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206744"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.01191"},{"key":"ref30","first-page":"1135","article-title":"Learning both weights and connections for efficient neural network","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Han"},{"key":"ref31","first-page":"1387","article-title":"Dynamic network surgery for efficient DNNs","volume-title":"Proc. Adv. neural Inf. Process. Syst.","author":"Guo"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00890"},{"key":"ref33","article-title":"Soft weight-sharing for neural network compression","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Ullrich"},{"key":"ref34","first-page":"2498","article-title":"Variational dropout sparsifies deep neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Molchanov"},{"key":"ref35","article-title":"Optimal brain damage","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"LeCun"},{"key":"ref36","article-title":"Learning to prune deep neural networks via layer-wise optimal brain surgeon","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Dong"},{"key":"ref37","first-page":"4646","article-title":"Parameter efficient training of deep convolutional neural networks by dynamic sparse reparameterization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Mostafa"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-018-04316-3"},{"key":"ref39","article-title":"Deep rewiring: Training very sparse deep networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Bellec"},{"key":"ref40","first-page":"20838","article-title":"MEST: Accurate and fast memory-economic sparse training framework on the edge","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yuan"},{"key":"ref41","article-title":"Mlprune: Multi-layer pruning for automated neural network compression","author":"Zeng","year":"2019"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/34\/10746266\/10713325.pdf?arnumber=10713325","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T00:42:21Z","timestamp":1732668141000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10713325\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":41,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2024.3437421","relation":{},"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":[[2024,12]]}}}