{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T21:19:49Z","timestamp":1784323189064,"version":"3.55.0"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100006227","name":"Lawrence Livermore National Laboratory","doi-asserted-by":"publisher","award":["DE-AC52-07NA27344"],"award-info":[{"award-number":["DE-AC52-07NA27344"]}],"id":[{"id":"10.13039\/100006227","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006227","name":"Lawrence Livermore National Laboratory","doi-asserted-by":"publisher","award":["LLNL-CONF-764021"],"award-info":[{"award-number":["LLNL-CONF-764021"]}],"id":[{"id":"10.13039\/100006227","id-type":"DOI","asserted-by":"publisher"}]},{"name":"LLNL-LDRD","award":["23-ERD-029"],"award-info":[{"award-number":["23-ERD-029"]}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2138811"],"award-info":[{"award-number":["2138811"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Visual. Comput. Graphics"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1109\/tvcg.2024.3514996","type":"journal-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T13:54:44Z","timestamp":1733752484000},"page":"6337-6352","source":"Crossref","is-referenced-by-count":2,"title":["\u201cUnderstanding Robustness Lottery\u201d: A Geometric Visual Comparative Analysis of Neural Network Pruning Approaches"],"prefix":"10.1109","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4324-741X","authenticated-orcid":false,"given":"Zhimin","family":"Li","sequence":"first","affiliation":[{"name":"Scientific Computing and Imaging Institute, University of Utah, Salt Lake City, UT, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6455-8391","authenticated-orcid":false,"given":"Shusen","family":"Liu","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, Livermore, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-3731-7448","authenticated-orcid":false,"given":"Xin","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Computing, University of Utah, Salt Lake City, UT, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2819-2919","authenticated-orcid":false,"given":"Kailkhura","family":"Bhavya","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, Livermore, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8268-954X","authenticated-orcid":false,"given":"Jie","family":"Cao","sequence":"additional","affiliation":[{"name":"School of Computing, University of Utah, Salt Lake City, UT, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-8641-3275","authenticated-orcid":false,"given":"James Daniel","family":"Diffenderfer","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, Livermore, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4107-3831","authenticated-orcid":false,"given":"Peer-Timo","family":"Bremer","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, Livermore, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8877-2042","authenticated-orcid":false,"given":"Valerio","family":"Pascucci","sequence":"additional","affiliation":[{"name":"Scientific Computing and Imaging Institute, University of Utah, Salt Lake City, UT, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.13140\/RG.2.2.18893.74727"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-021-03819-2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-019-1923-7"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.48550\/arxiv.1811.06965"},{"key":"ref5","article-title":"Deep compression: Compressing deep neural network with pruning, trained quantization and huffman coding","author":"Han","year":"2015"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.298"},{"key":"ref7","article-title":"What do compressed deep neural networks forget?","author":"Hooker","year":"2019"},{"key":"ref8","first-page":"93","article-title":"Lost in pruning: The effects of pruning neural networks beyond test accuracy","volume-title":"Proc. Mach. Learn. Syst.","volume":"3","author":"Liebenwein","year":"2021"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3010274"},{"key":"ref10","article-title":"Benchmarking neural network robustness to common corruptions and perturbations","author":"Hendrycks","year":"2019"},{"key":"ref11","first-page":"664","article-title":"A winning hand: Compressing deep networks can improve out-of-distribution robustness","volume-title":"Proc. 35th Int. Conf. Neural Inf. Process. Syst.","author":"Diffenderfer"},{"key":"ref12","article-title":"Multi-prize lottery ticket hypothesis: Finding accurate binary neural networks by pruning a randomly weighted network","author":"Diffenderfer","year":"2021"},{"issue":"11","key":"ref13","first-page":"2579","article-title":"Visualizing data using t-SNE","volume":"9","author":"Van der Maaten","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0169-7439(87)80084-9"},{"key":"ref15","first-page":"598","article-title":"Optimal brain damage","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"LeCun"},{"key":"ref16","article-title":"The lottery ticket hypothesis: Finding sparse, trainable neural networks","author":"Frankle","year":"2018"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.01191"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2020.3030461"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2019.2903943"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2019.2934659"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/VAST.2018.8802509"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2017.2744718"},{"key":"ref23","article-title":"Certified adversarial defenses meet out-of-distribution corruptions: Benchmarking robustness and simple baselines","author":"Sun","year":"2021"},{"key":"ref24","first-page":"3571","article-title":"On interaction between augmentations and corruptions in natural corruption robustness","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Mintun"},{"key":"ref25","article-title":"Benchmarking robustness in object detection: Autonomous driving when winter is coming","author":"Michaelis","year":"2019"},{"key":"ref26","article-title":"Benchmarking robustness of 3D point cloud recognition against common corruptions","author":"Sun","year":"2022"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2016.2598828"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2018.2864499"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2020.3012063"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2020.3030352"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2022.3172107"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.visinf.2020.04.005"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2019.2934261"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s41095-020-0191-7"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2024.3357065"},{"key":"ref36","first-page":"1321","article-title":"On calibration of modern neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Guo"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2021.3114694"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3490099.3511137"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3490099.3511122"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.acl-demo.50"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12366"},{"key":"ref42","first-page":"129","article-title":"What is the state of neural network pruning?","volume-title":"Proc. Mach. Learn. Syst.","volume":"2","author":"Blalock","year":"2020"},{"key":"ref43","article-title":"Snip: Single-shot network pruning based on connection sensitivity","author":"Lee","year":"2018"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01152"},{"key":"ref45","first-page":"164","article-title":"Second order derivatives for network pruning: Optimal brain surgeon","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hassibi"},{"key":"ref46","first-page":"3531","article-title":"Finding nearly everything within random binary networks","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Sreenivasan"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00293"},{"key":"ref48","first-page":"507","article-title":"Large-margin softmax loss for convolutional neural networks","volume-title":"Proc. 33 rd Int. Conf. Int. Conf. Mach. Learn.","author":"Liu"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860915-0\/50046-9"},{"key":"ref50","article-title":"Rethinking the value of network pruning","author":"Liu","year":"2018"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.442"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2022.3209404"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.21105\/joss.00861"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2022.3209489"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2870052"},{"key":"ref56","article-title":"Deep inside convolutional networks: Visualising image classification models and saliency maps","author":"Simonyan","year":"2013"},{"key":"ref57","first-page":"9525","article-title":"Sanity checks for saliency maps","volume-title":"Proc. 32nd Int. Conf. Adv. Neural Inf. Process. Syst.","author":"Adebayo"},{"key":"ref58","first-page":"3519","article-title":"Similarity of neural network representations revisited","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Kornblith"},{"key":"ref59","first-page":"2668","article-title":"Interpretability beyond feature attribution: Quantitative testing with concept activation vectors (TCAV)","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Kim"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.74"}],"container-title":["IEEE Transactions on Visualization and Computer Graphics"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/2945\/11105772\/10787269-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/2945\/11105772\/10787269.pdf?arnumber=10787269","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T22:05:54Z","timestamp":1754431554000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10787269\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":60,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tvcg.2024.3514996","relation":{},"ISSN":["1077-2626","1941-0506","2160-9306"],"issn-type":[{"value":"1077-2626","type":"print"},{"value":"1941-0506","type":"electronic"},{"value":"2160-9306","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9]]}}}