{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T06:10:13Z","timestamp":1747894213508,"version":"3.41.0"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T00:00:00Z","timestamp":1743379200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T00:00:00Z","timestamp":1743379200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100020595","name":"National Science and Technology Council of Taiwan","doi-asserted-by":"publisher","award":["111-2923-E-002-014-MY3,112-2221-E-002-116-MY3,112-2221-E-001-002-MY3"],"award-info":[{"award-number":["111-2923-E-002-014-MY3,112-2221-E-002-116-MY3,112-2221-E-001-002-MY3"]}],"id":[{"id":"10.13039\/100020595","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,3,31]]},"DOI":"10.23919\/date64628.2025.10992715","type":"proceedings-article","created":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T17:36:35Z","timestamp":1747848995000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["Filter-Based Adaptive Model Pruning for Efficient Incremental Learning on Edge Devices"],"prefix":"10.23919","author":[{"given":"Jing-Jia","family":"Hung","sequence":"first","affiliation":[{"name":"National Taiwan University,Department of Computer Science and Information Engineering,Taipei,Taiwan"}]},{"given":"Yi-Jung","family":"Chen","sequence":"additional","affiliation":[{"name":"National Chi Nan University,Department of Computer Science and Information Engineering,Nantou,Taiwan"}]},{"given":"Hsiang-Yun","family":"Cheng","sequence":"additional","affiliation":[{"name":"Academia Sinica,Research Center for Information Technology Innovation,Taipei,Taiwan"}]},{"given":"Hsu","family":"Kao","sequence":"additional","affiliation":[{"name":"National Tsing Hua University,Department of Engineering and System Science,Hsinchu,Taiwan"}]},{"given":"Chia-Lin","family":"Yang","sequence":"additional","affiliation":[{"name":"National Taiwan University,Department of Computer Science and Information Engineering,Taipei,Taiwan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/iccv.2019.00067"},{"key":"ref2","article-title":"The State of Sparsity in Deep Neural Networks","author":"Gale","year":"2019","journal-title":"arXiv preprint"},{"key":"ref3","first-page":"1135","article-title":"Learning both Weights and Connections for Efficient Neural Networks","volume-title":"Proceedings of the International Conference on Neural Information Processing Systems","volume":"1","author":"Han","year":"2015"},{"key":"ref4","first-page":"164","article-title":"Second Order Derivatives for Network Pruning: Optimal Brain Surgeon","volume-title":"Proceedings of the International Conference on Neural Information Processing Systems","author":"Hassibi","year":"1992"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/309"},{"key":"ref7","article-title":"Structured Pruning for Deep Convolutional Neural Networks: A Survey","author":"He","year":"2023","journal-title":"arXiv preprint"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.01197"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.243"},{"volume-title":"Learning Multiple Layers of Features from Tiny Images","year":"2009","author":"Krizhevsky","key":"ref10"},{"issue":"7","key":"ref11","first-page":"3","article-title":"Tiny ImageNet Visual Recognition Challenge","volume":"7","author":"Le","year":"2015","journal-title":"CS 231N"},{"key":"ref12","article-title":"SNIP: Single-shot Network Pruning based on Connection Sensitivity","author":"Lee","year":"2018","journal-title":"arXiv preprint"},{"key":"ref13","article-title":"Pruning Filters for Efficient convNets","author":"Li","year":"2016","journal-title":"arXiv preprint"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.01465"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.00029"},{"key":"ref16","article-title":"SupportNet: Solving Catastrophic Forgetting in Class Incremental Learning with Support Data","author":"Li","year":"2018","journal-title":"arXiv preprint"},{"key":"ref17","article-title":"Can Pruning Improve Certified Robustness of Neural Networks?","author":"Li","year":"2022","journal-title":"arXiv preprint"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2773081"},{"key":"ref19","article-title":"Rethinking the Value of Network Pruning","author":"Liu","year":"2018","journal-title":"arXiv preprint"},{"key":"ref20","article-title":"A Gradient Flow Framework for Analyzing Network Pruning","author":"Lubana","year":"2020","journal-title":"arXiv preprint"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.541"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3213473"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01152"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378534"},{"key":"ref25","article-title":"SOSP: Efficiently Capturing Global Correlations by Second-Order Structured Pruning","author":"Nonnenmacher","year":"2021","journal-title":"arXiv preprint"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.587"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00474"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i3.16356"},{"key":"ref29","first-page":"12894","article-title":"Structural Pruning via Latency-Saliency Knapsack","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","volume":"35","author":"Shen","year":"2022"},{"key":"ref30","article-title":"WoodFisher: Efficient Second-Order Ap-proximation for Neural Network Compression","volume-title":"Proceedings of the International Conference on Neural Information Processing Systems","author":"Singh","year":"2020"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-19806-9_23"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52729.2023.01947"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.00078"},{"key":"ref34","article-title":"SparCL: Sparse Continual Learning on the Edge","volume-title":"Proceedings of the International Conference on Neural Information Processing Systems","author":"Wang","year":"2024"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/WACV45572.2020.9093365"}],"event":{"name":"2025 Design, Automation & Test in Europe Conference (DATE)","start":{"date-parts":[[2025,3,31]]},"location":"Lyon, France","end":{"date-parts":[[2025,4,2]]}},"container-title":["2025 Design, Automation & Test in Europe Conference (DATE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10992638\/10992588\/10992715.pdf?arnumber=10992715","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T05:33:03Z","timestamp":1747891983000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10992715\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,31]]},"references-count":35,"URL":"https:\/\/doi.org\/10.23919\/date64628.2025.10992715","relation":{},"subject":[],"published":{"date-parts":[[2025,3,31]]}}}