{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T04:57:39Z","timestamp":1724993859987},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"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":[],"published-print":{"date-parts":[[2021,6,6]]},"DOI":"10.1109\/icassp39728.2021.9414393","type":"proceedings-article","created":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T19:53:45Z","timestamp":1620935625000},"source":"Crossref","is-referenced-by-count":2,"title":["Network Pruning Using Linear Dependency Analysis on Feature Maps"],"prefix":"10.1109","author":[{"given":"Hao","family":"Pan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongdi","family":"Chao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiang","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bojin","family":"Zhuang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaojun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"An entropy-based pruning method for cnn compression","author":"luo","year":"2017"},{"key":"ref11","article-title":"Training compressed fully-connected networks with a density-diversity penalty","author":"wang","year":"2016"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.298"},{"key":"ref13","article-title":"Pruning filters for efficient convnets","author":"li","year":"2017","journal-title":"Proceedings of the International Conference on Learning Representations"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00447"},{"key":"ref15","article-title":"Network compression using correlation analysis of layer responses","author":"suau","year":"2018"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/525"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00160"},{"key":"ref18","first-page":"875","article-title":"Discrimination-aware channel pruning for deep neural networks","author":"zhuang","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref19","author":"chan","year":"1985","journal-title":"On rank-revealing QR factorizations"},{"key":"ref4","article-title":"Binarized neural networks: Training deep neural networks with weights and activations constrained to +1 or -1","author":"courbariaux","year":"2016"},{"key":"ref3","article-title":"Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding","author":"han","year":"2016","journal-title":"Proceedings of the International Conference on Learning Representations"},{"key":"ref6","first-page":"1269","article-title":"Exploiting linear structure within convolutional networks for efficient evaluation","author":"denton","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref5","first-page":"525","article-title":"Xnor-net: Imagenet classification using binary convolutional neural networks","author":"rastegari","year":"2016","journal-title":"European Conference on Computer Vision"},{"key":"ref8","first-page":"1135","article-title":"Learning both weights and connections for efficient neural network","author":"han","year":"2015","journal-title":"Advances in neural information processing systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2017.78"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref1","article-title":"Very deep convolutional networks for large-scale image recognition","author":"simonyan","year":"2014"},{"key":"ref9","article-title":"Network trimming: A data-driven neuron pruning approach towards efficient deep architectures","author":"hu","year":"2016"},{"key":"ref20","article-title":"Learning multiple layers of features from tiny images","author":"krizhevsky","year":"2009"},{"key":"ref22","article-title":"Automatic differentiation in pytorch","author":"paszke","year":"2017"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-015-0816-y"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/309"}],"event":{"name":"ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","location":"Toronto, ON, Canada","start":{"date-parts":[[2021,6,6]]},"end":{"date-parts":[[2021,6,11]]}},"container-title":["ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9413349\/9413350\/09414393.pdf?arnumber=9414393","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:40:52Z","timestamp":1652197252000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9414393\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,6]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/icassp39728.2021.9414393","relation":{},"subject":[],"published":{"date-parts":[[2021,6,6]]}}}