{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T05:58:59Z","timestamp":1775627939218,"version":"3.50.1"},"reference-count":39,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T00:00:00Z","timestamp":1764720000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T00:00:00Z","timestamp":1764720000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,12,3]]},"DOI":"10.1109\/icmla66185.2025.00019","type":"proceedings-article","created":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T19:54:58Z","timestamp":1775591698000},"page":"91-98","source":"Crossref","is-referenced-by-count":0,"title":["CAMP-HiVe: Cyclic Pair Merging based Efficient DNN Pruning with Hessian-Vector Approximation for Resource-Constrained Systems"],"prefix":"10.1109","author":[{"given":"Mohammad Helal","family":"Uddin","sequence":"first","affiliation":[{"name":"University of Louisville,Department of Computer Science and Engineering,KY,USA"}]},{"given":"Sai","family":"Krishna Ghanta","sequence":"additional","affiliation":[{"name":"University of Georgia,School of Computing,Athens,GA,USA"}]},{"given":"Liam","family":"Seymour","sequence":"additional","affiliation":[{"name":"University of Louisville,Department of Computer Science and Engineering,KY,USA"}]},{"given":"Sabur","family":"Baidya","sequence":"additional","affiliation":[{"name":"University of Louisville,Department of Computer Science and Engineering,KY,USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.1955.0005"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/nature14539"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/7068349"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34372-9"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-demos.6"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-81-322-3972-7_19"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SC41405.2020.00024"},{"key":"ref8","article-title":"Optimal brain damage","volume":"2","author":"LeCun","year":"1989","journal-title":"Adv. Neural Inf. Process. Syst"},{"key":"ref9","article-title":"Skeletonization: A technique for trimming the fat from a network via relevance assessment","volume":"1","author":"Mozer","year":"1988","journal-title":"Adv. Neural Inf. Process. Syst"},{"key":"ref10","first-page":"2408","article-title":"Optimizing neural networks with Kronecker-factored approximate curvature","volume-title":"Proc. Int. Conf. Machine Learning (ICML)","author":"Martens"},{"key":"ref11","article-title":"The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks","volume-title":"Proc. Int. Conf. Learn. Representations (ICLR)","author":"Frankle"},{"key":"ref12","article-title":"One Ticket to Win Them All: Generalizing Lottery Ticket Initializations Across Datasets and Optimizers","author":"Morcos","year":"2019","journal-title":"Adv. Neural Inf. Process. Syst. (NeurIPS)"},{"key":"ref13","article-title":"Comparing Rewinding and Fine-Tuning in Neural Network Pruning","volume-title":"Proc. Int. Conf. Learn. Representations (ICLR)","author":"Renda"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/309"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00160"},{"key":"ref16","article-title":"DistilBERT, a Distilled Version of BERT: Smaller, Faster, Cheaper and Lighter","author":"Sanh","year":"2019","journal-title":"Adv. Neural Inf. Process. Syst. (NeurIPS)"},{"key":"ref17","article-title":"TinyBERT: Distilling BERT for Natural Language Understanding","author":"Tang","year":"2020","journal-title":"Findings Assoc. Comput. Linguistics: EMNLP"},{"key":"ref18","first-page":"6566","article-title":"EigenDamage: Structured pruning in the Kronecker-factored eigenbasis","volume-title":"Proc. 36th Int. Conf. Mach. Learn. (ICML)","volume":"97","author":"Wang"},{"key":"ref19","article-title":"Scalable Hessian Approximation for Neural Network Pruning","volume-title":"Proc. ICLR","author":"Dong"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1994.6.1.147"},{"key":"ref21","first-page":"735","article-title":"Deep Learning via Hessian-Free Optimization","volume-title":"Proc. 27th Int. Conf. Mach. Learn. (ICML)","author":"Martens"},{"key":"ref22","volume-title":"Deep Learning","author":"Goodfellow","year":"2016"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52733.2024.01530"},{"key":"ref24","article-title":"Learning Both Weights and Connections for Efficient Neural Network","volume":"28","author":"Han","year":"2015","journal-title":"Adv. Neural Inf. Process. Syst. (NeurIPS)"},{"key":"ref25","first-page":"3259","article-title":"Linear Mode Connectivity and the Lottery Ticket Hypothesis","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Frankle"},{"key":"ref26","article-title":"Otov2: Automatic, Generic, User-Friendly","author":"Chen","year":"2023"},{"key":"ref27","first-page":"875","article-title":"Discrimination-Aware Channel Pruning for Deep Neural Networks","author":"Zhuang","year":"2018","journal-title":"Adv. Neural Inf. Process. Syst"},{"key":"ref28","article-title":"Operation-Aware Soft Channel Pruning Using Differentiable Masks","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Kang"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00447"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/309"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00208"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00197"},{"key":"ref33","article-title":"Topology-Aware Network Pruning Using Multi-Stage Graph Embedding and Reinforcement Learning","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Yu"},{"key":"ref34","article-title":"SCOP: Scientific Control for Reliable Neural Network Pruning","volume":"33","author":"Tang","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01234-2_48"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00637"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00339"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.00029"},{"key":"ref39","article-title":"Pruning convolutional neural networks for resource-efficient inference","volume-title":"Proc. Int. Conf. Learn. Representations (ICLR)","author":"Molchanov"}],"event":{"name":"2025 International Conference on Machine Learning and Applications (ICMLA)","location":"Boca Raton, FL, USA","start":{"date-parts":[[2025,12,3]]},"end":{"date-parts":[[2025,12,5]]}},"container-title":["2025 International Conference on Machine Learning and Applications (ICMLA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11471302\/11471304\/11471497.pdf?arnumber=11471497","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T05:19:37Z","timestamp":1775625577000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11471497\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,3]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/icmla66185.2025.00019","relation":{},"subject":[],"published":{"date-parts":[[2025,12,3]]}}}