{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T23:21:13Z","timestamp":1783552873028,"version":"3.55.0"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"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":["IEEE Trans. Artif. Intell."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1109\/tai.2025.3558718","type":"journal-article","created":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T14:20:46Z","timestamp":1744122046000},"page":"2830-2839","source":"Crossref","is-referenced-by-count":2,"title":["A Deterministic\u2013Probabilistic Approach to Neural Network Pruning"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-6668-4350","authenticated-orcid":false,"given":"Soumyadipta","family":"Banerjee","sequence":"first","affiliation":[{"name":"Department of Artificial Intelligence, Indian Institute of Technology, Kharagpur, West Bengal, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1550-3586","authenticated-orcid":false,"given":"Jiaul H.","family":"Paik","sequence":"additional","affiliation":[{"name":"Department of Artificial Intelligence, Indian Institute of Technology, Kharagpur, West Bengal, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"The lottery ticket hypothesis: Finding sparse, trainable neural networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Frankle","year":"2019"},{"key":"ref2","article-title":"Learning both weights and connections for efficient neural networks","author":"Han","year":"2015"},{"key":"ref3","article-title":"Network trimming: A data-driven neuron pruning approach towards efficient deep architectures","author":"Hu","year":"2016"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2211477"},{"key":"ref6","article-title":"Very deep convolutional networks for large-scale image recognition","volume-title":"Proc. 3rd Int. Conf. Learn. Represent. (ICLR)","author":"Simonyan","year":"2015"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref8","article-title":"Squeezenet: Alexnet-level accuracy with 50x fewer parameters and $<$ 1 mb model size","volume-title":"Proc. ICLR","author":"Iandola","year":"2017"},{"key":"ref9","article-title":"Predicting parameters in deep learning","author":"Denil","year":"2013"},{"key":"ref10","article-title":"Measuring the intrinsic dimension of objective landscapes","author":"Li","year":"2018"},{"key":"ref11","article-title":"Pruning filters for efficient convnets","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Li","year":"2017"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00447"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-015-0816-y"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.155"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.541"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00289"},{"key":"ref18","article-title":"Deep rewiring: Training very sparse deep networks","author":"Bellec","year":"2017"},{"key":"ref19","article-title":"Exploring sparsity in recurrent neural networks","author":"Narang","year":"2017"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/78.650093"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1179"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2017.61"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.5555\/2999134.2999257"},{"key":"ref24","article-title":"Stabilizing the lottery ticket hypothesis","author":"Frankle","year":"2019"},{"key":"ref25","article-title":"Deconstructing lottery tickets: Zeros, signs, and the supermask","author":"Zhou","year":"2019"},{"key":"ref26","article-title":"Linear mode connectivity and the lottery ticket hypothesis","volume-title":"Proc. ICML","author":"Frankle","year":"2020"},{"key":"ref27","article-title":"Pruning neural networks at initialization: Why are we missing the mark?","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Frankle","year":"2021"},{"key":"ref28","article-title":"Snip: Single-shot network pruning based on connection sensitivity","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Lee","year":"2019"},{"key":"ref29","article-title":"Sanity-checking pruning methods: random tickets can win the jackpot","volume-title":"Proc. 34th Int. Conf. Neural Inf. Process. Syst. (NIPS)","author":"Su","year":"2020"},{"key":"ref30","article-title":"Pruning neural networks without any data by iteratively conserving synaptic flow","author":"Tanaka","year":"2020"},{"key":"ref31","article-title":"Only train once: A one-shot neural network training and pruning framework","volume-title":"Proc. 35th Conf. Neural Inf. Process. Syst.","author":"Chen","year":"2021"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176343003"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1080\/00401706.1993.10485040"},{"key":"ref34","article-title":"Learning multiple layers of features from tiny images","author":"Krizhevsky","year":"2009","journal-title":"Tech. Rep."},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2024.3447085"}],"container-title":["IEEE Transactions on Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/9078688\/11186126\/10959060.pdf?arnumber=10959060","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T04:34:01Z","timestamp":1759379641000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10959060\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10]]},"references-count":35,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tai.2025.3558718","relation":{},"ISSN":["2691-4581"],"issn-type":[{"value":"2691-4581","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10]]}}}