{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T01:13:14Z","timestamp":1768093994250,"version":"3.49.0"},"reference-count":70,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"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":["61991451"],"award-info":[{"award-number":["61991451"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61836008"],"award-info":[{"award-number":["61836008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF","award":["IIS-2114664"],"award-info":[{"award-number":["IIS-2114664"]}]},{"name":"NSF","award":["CMMI-2146076"],"award-info":[{"award-number":["CMMI-2146076"]}]},{"name":"West Virginia (WV) Higher Education Policy Commission","award":["HEPC.dsr.23.7"],"award-info":[{"award-number":["HEPC.dsr.23.7"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1109\/tpami.2023.3248612","type":"journal-article","created":{"date-parts":[[2023,2,24]],"date-time":"2023-02-24T18:41:13Z","timestamp":1677264073000},"page":"9325-9338","source":"Crossref","is-referenced-by-count":18,"title":["Adaptive Search-and-Training for Robust and Efficient Network Pruning"],"prefix":"10.1109","volume":"45","author":[{"given":"Xiaotong","family":"Lu","sequence":"first","affiliation":[{"name":"School of Artificial Intelligence, Xidian University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9632-985X","authenticated-orcid":false,"given":"Weisheng","family":"Dong","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Xidian University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2067-2763","authenticated-orcid":false,"given":"Xin","family":"Li","sequence":"additional","affiliation":[{"name":"Lane Dept. of  CSEE, West Virginia University, Morgantown, WV, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7501-0009","authenticated-orcid":false,"given":"Jinjian","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Xidian University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9069-8796","authenticated-orcid":false,"given":"Leida","family":"Li","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Xidian University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2179-3292","authenticated-orcid":false,"given":"Guangming","family":"Shi","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Xidian University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01285"},{"key":"ref57","article-title":"Compact deep convolutional neural networks with coarse pruning","author":"anwar","year":"2016"},{"key":"ref12","first-page":"2270","article-title":"Learning the number of neurons in deep networks","author":"alvarez","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01166"},{"key":"ref15","first-page":"1135","article-title":"Learning both weights and connections for efficient neural network","author":"han","year":"2015","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref59","first-page":"367","article-title":"Random search and reproducibility for neural architecture search","author":"li","year":"2020","journal-title":"Proc Uncertainty Artif Intell"},{"key":"ref14","first-page":"2074","article-title":"Learning structured sparsity in deep neural networks","author":"wen","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/s00138-018-01001-9"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01237-3_12"},{"key":"ref52","article-title":"Learned threshold pruning","author":"azarian","year":"2021"},{"key":"ref11","first-page":"1269","article-title":"Exploiting linear structure within convolutional networks for efficient evaluation","author":"denton","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref55","article-title":"Evaluating the search phase of neural architecture search","author":"yu","year":"2019","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46493-0_40"},{"key":"ref54","first-page":"5544","article-title":"Soft threshold weight reparameterization for learnable sparsity","author":"kusupati","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00804"},{"key":"ref16","first-page":"17629","article-title":"Pruning filter in filter","author":"meng","year":"2020","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00915"},{"key":"ref18","first-page":"4035","article-title":"Discrimination-aware network pruning for deep model compression","volume":"44","author":"liu","year":"2022","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref51","article-title":"Rethinking the smaller-norm-less-informative assumption in channel pruning of convolution layers","author":"ye","year":"2018"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00215"},{"key":"ref46","first-page":"2583","article-title":"Beyond network pruning: A joint search-and-training approach","author":"lu","year":"2021","journal-title":"Proc 29th Int Conf Int Joint Conf Artif Intell"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00161"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371792"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.07.048"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00489"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00454"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.01067"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33015628"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01234-2_48"},{"key":"ref8","article-title":"Distilling the knowledge in a neural network","author":"hinton","year":"2015"},{"key":"ref7","first-page":"759","article-title":"Network pruning via transformable architecture search","author":"dong","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01246-5_2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00186"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/358"},{"key":"ref6","article-title":"You only compress once: Towards effective and elastic BERT compression via exploit-explore stochastic nature gradient","author":"zhang","year":"2021"},{"key":"ref5","article-title":"Darts: Differentiable architecture search","author":"liu","year":"2018"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098135"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00907"},{"key":"ref34","article-title":"Efficient neural architecture search via parameter sharing","author":"pham","year":"2018"},{"key":"ref37","article-title":"Proxylessnas: Direct neural architecture search on target task and hardware","author":"cai","year":"2018"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00378"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00745"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00716"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014780"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00165"},{"key":"ref2","article-title":"Neural architecture search: A survey","author":"elsken","year":"2018"},{"key":"ref1","article-title":"Rethinking the value of network pruning","author":"liu","year":"2018"},{"key":"ref39","article-title":"Once-for-all: Train one network and specialize it for efficient deployment","author":"cai","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3473330"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00159"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58536-5_38"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01270-0_19"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00339"},{"key":"ref67","article-title":"A novel channel pruning method for deep neural network compression","author":"hu","year":"2018"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107860"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00498"},{"key":"ref69","article-title":"Pruning filters for efficient convnets","author":"li","year":"2016"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00447"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00160"},{"key":"ref63","article-title":"N2N learning: Network to network compression via policy gradient reinforcement learning","author":"ashok","year":"2017"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/309"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682450"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00721"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371792"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.01467"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV48922.2021.00447"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00474"},{"key":"ref60","article-title":"Understanding neural architecture search techniques","author":"adam","year":"2019"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.01076"},{"key":"ref61","article-title":"Grid search, random search, genetic algorithm: A big comparison for nas","author":"liashchynskyi","year":"2019"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/34\/10169863\/10052756-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/10169863\/10052756.pdf?arnumber=10052756","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T17:41:51Z","timestamp":1689615711000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10052756\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":70,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2023.3248612","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":[[2023,8]]}}}