{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T15:10:07Z","timestamp":1751037007085,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","funder":[{"DOI":"10.13039\/100000015","name":"DOE U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0025561"],"award-info":[{"award-number":["DE-SC0025561"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,30]]},"DOI":"10.1145\/3716368.3735273","type":"proceedings-article","created":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T13:58:23Z","timestamp":1751032703000},"page":"227-232","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Memory-Efficient and Sustainable Machine Unlearning on Edge using Zeroth-Order Optimizer"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-2812-4106","authenticated-orcid":false,"given":"Ci","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Georgia, Athens, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-3678-6319","authenticated-orcid":false,"given":"Chence","family":"Yang","sequence":"additional","affiliation":[{"name":"University of Georgia, Athens, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1280-0334","authenticated-orcid":false,"given":"Qitao","family":"Tan","sequence":"additional","affiliation":[{"name":"University of Georgia, Athens, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3808-4599","authenticated-orcid":false,"given":"Jun","family":"Liu","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, USA and Carnegie Mellon University, Pittsburgh, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1927-8606","authenticated-orcid":false,"given":"Ao","family":"Li","sequence":"additional","affiliation":[{"name":"University of Arizona, Tucson, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3024-7990","authenticated-orcid":false,"given":"Yanzhi","family":"Wang","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1356-0202","authenticated-orcid":false,"given":"Jin","family":"Lu","sequence":"additional","affiliation":[{"name":"University of Georgia, Athens, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4731-8481","authenticated-orcid":false,"given":"Jinhui","family":"Wang","sequence":"additional","affiliation":[{"name":"University of South Alabama, Mobile, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9844-992X","authenticated-orcid":false,"given":"Geng","family":"Yuan","sequence":"additional","affiliation":[{"name":"University of Georgia, Athens, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,6,29]]},"reference":[{"key":"e_1_3_3_1_2_2","unstructured":"Alexander Becker and Thomas Liebig. 2022. Evaluating machine unlearning via epistemic uncertainty. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2208.10836 (2022)."},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"crossref","unstructured":"Raghu Bollapragada Richard Byrd and Jorge Nocedal. 2018. Adaptive sampling strategies for stochastic optimization. SIAM Journal on Optimization (2018).","DOI":"10.1137\/17M1154679"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00019"},{"key":"e_1_3_3_1_5_2","unstructured":"Han Cai Chuang Gan Tianzhe Wang Zhekai Zhang and Song Han. 2019. Once-for-all: Train one network and specialize it for efficient deployment. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/1908.09791 (2019)."},{"key":"e_1_3_3_1_6_2","first-page":"1193","volume-title":"International Conference on Machine Learning","author":"Cai HanQin","year":"2021","unstructured":"HanQin Cai, Yuchen Lou, Daniel McKenzie, and Wotao Yin. 2021. A zeroth-order block coordinate descent algorithm for huge-scale black-box optimization. In International Conference on Machine Learning. 1193\u20131203."},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"crossref","unstructured":"HanQin Cai Daniel McKenzie Wotao Yin and Zhenliang Zhang. 2022. Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Sampling. SIAM Journal on Optimization 32 2 (2022) 687\u2013714.","DOI":"10.1137\/21M1392966"},{"key":"e_1_3_3_1_8_2","unstructured":"Jiali Cheng George Dasoulas Huan He Chirag Agarwal and Marinka Zitnik. 2023. Gnndelete: A general strategy for unlearning in graph neural networks. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2302.13406 (2023)."},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-71782-7_35"},{"key":"e_1_3_3_1_10_2","volume-title":"NeurIPS ML Safety Workshop","author":"Di Jimmy\u00a0Z","year":"2022","unstructured":"Jimmy\u00a0Z Di, Jack Douglas, Jayadev Acharya, Gautam Kamath, and Ayush Sekhari. 2022. Hidden poison: Machine unlearning enables camouflaged poisoning attacks. In NeurIPS ML Safety Workshop."},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV51070.2023.00230"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"crossref","unstructured":"Eric Goldman. 2020. An introduction to the california consumer privacy act (ccpa). Santa Clara Univ. Legal Studies Research Paper (2020).","DOI":"10.4337\/9781788119924.00025"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i13.17371"},{"key":"e_1_3_3_1_14_2","first-page":"20","volume-title":"Annual Privacy Forum","author":"Hawkins Katie","year":"2023","unstructured":"Katie Hawkins, Nora Alhuwaish, Sana Belguith, Asma Vranaki, and Andrew Charlesworth. 2023. A Decision-Making Process to Implement the \u2018Right to Be Forgotten\u2019in Machine Learning. In Annual Privacy Forum. Springer, 20\u201338."},{"key":"e_1_3_3_1_15_2","first-page":"2008","volume-title":"International Conference on Artificial Intelligence and Statistics","author":"Izzo Zachary","year":"2021","unstructured":"Zachary Izzo, Mary\u00a0Anne Smart, Kamalika Chaudhuri, and James Zou. 2021. Approximate data deletion from machine learning models. In International Conference on Artificial Intelligence and Statistics. PMLR, 2008\u20132016."},{"key":"e_1_3_3_1_16_2","volume-title":"ICML","author":"Ji Kaiyi","year":"2019","unstructured":"Kaiyi Ji et\u00a0al. 2019. Improved zeroth-order variance reduced algorithms and analysis for nonconvex optimization. In ICML."},{"key":"e_1_3_3_1_17_2","unstructured":"Jinghan Jia Jiancheng Liu Parikshit Ram Yuguang Yao Gaowen Liu Yang Liu Pranay Sharma and Sijia Liu. 2023. Model sparsity can simplify machine unlearning. Advances in Neural Information Processing Systems (2023)."},{"key":"e_1_3_3_1_18_2","volume-title":"The Twelfth International Conference on Learning Representations","author":"Li Sheng","year":"2024","unstructured":"Sheng Li et\u00a0al. 2024. Waxing-and-waning: a generic similarity-based framework for efficient self-supervised learning. In The Twelfth International Conference on Learning Representations."},{"key":"e_1_3_3_1_19_2","volume-title":"The Thirteenth International Conference on Learning Representations","author":"Li Sheng","year":"2025","unstructured":"Sheng Li, Qitao Tan, et\u00a0al. 2025. Mutual Effort for Efficiency: A Similarity-based Token Pruning for Vision Transformers in Self-Supervised Learning. In The Thirteenth International Conference on Learning Representations."},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"crossref","unstructured":"Sijia Liu et\u00a0al. 2025. Rethinking machine unlearning for large language models. Nature Machine Intelligence (2025).","DOI":"10.1038\/s42256-025-00985-0"},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM48880.2022.9796974"},{"key":"e_1_3_3_1_22_2","unstructured":"Sadhika Malladi et\u00a0al. 2023. Fine-tuning language models with just forward passes. Advances in Neural Information Processing Systems (2023)."},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"crossref","unstructured":"Alessandro Mantelero. 2013. The EU Proposal for a General Data Protection Regulation and the roots of the \u2018right to be forgotten\u2019. Computer Law & Security Review 29 3 (2013) 229\u2013235.","DOI":"10.1016\/j.clsr.2013.03.010"},{"key":"e_1_3_3_1_24_2","unstructured":"Ayush Sekhari Jayadev Acharya Gautam Kamath and Ananda\u00a0Theertha Suresh. 2021. Remember what you want to forget: Algorithms for machine unlearning. Advances in Neural Information Processing Systems 34 (2021) 18075\u201318086."},{"key":"e_1_3_3_1_25_2","unstructured":"Ohad Shamir. 2017. An optimal algorithm for bandit and zero-order convex optimization with two-point feedback. The Journal of Machine Learning Research (2017)."},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"crossref","unstructured":"James\u00a0C Spall. 1992. Multivariate stochastic approximation using a simultaneous perturbation gradient approximation. IEEE transactions on automatic control (1992).","DOI":"10.1109\/9.119632"},{"key":"e_1_3_3_1_27_2","unstructured":"Qitao Tan Sung-En Chang Rui Xia et\u00a0al. 2025. Perturbation-efficient Zeroth-order Optimization for Hardware-friendly On-device Training. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2504.20314 (2025)."},{"key":"e_1_3_3_1_28_2","unstructured":"Qitao Tan Jun Liu Zheng Zhan Caiwei Ding Yanzhi Wang Jin Lu and Geng Yuan. 2025. Harmony in Divergence: Towards Fast Accurate and Memory-efficient Zeroth-order LLM Fine-tuning. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2502.03304 (2025)."},{"key":"e_1_3_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919690"},{"key":"e_1_3_3_1_30_2","volume-title":"31st USENIX security symposium","author":"Thudi Anvith","year":"2022","unstructured":"Anvith Thudi et\u00a0al. 2022. On the necessity of auditable algorithmic definitions for machine unlearning. In 31st USENIX security symposium."},{"key":"e_1_3_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP53844.2022.00027"},{"key":"e_1_3_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512222"},{"key":"e_1_3_3_1_33_2","unstructured":"Zhongruo Wang Krishnakumar Balasubramanian Shiqian Ma and Meisam Razaviyayn. 2020. Zeroth-order algorithms for nonconvex minimax problems with improved complexities. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2001.07819 (2020)."},{"key":"e_1_3_3_1_34_2","unstructured":"Alexander Warnecke et\u00a0al. 2021. Machine unlearning of features and labels. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2108.11577 (2021)."},{"key":"e_1_3_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISNCC62547.2024.10759031"},{"key":"e_1_3_3_1_36_2","unstructured":"Geng Yuan et\u00a0al. 2021. Mest: Accurate and fast memory-economic sparse training framework on the edge. Advances in Neural Information Processing Systems 34 (2021) 20838\u201320850."},{"key":"e_1_3_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA52012.2021.00029"},{"key":"e_1_3_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-19775-8_3"},{"key":"e_1_3_3_1_39_2","doi-asserted-by":"crossref","unstructured":"Geng Yuan Peiyan Dong et\u00a0al. 2022. Mobile or fpga? a comprehensive evaluation on energy efficiency and a unified optimization framework. ACM Transactions on Embedded Computing Systems 21 5 (2022) 1\u201322.","DOI":"10.1145\/3528578"},{"key":"e_1_3_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW63382.2024.00182"}],"event":{"name":"GLSVLSI '25: Great Lakes Symposium on VLSI 2025","sponsor":["SIGDA ACM Special Interest Group on Design Automation"],"location":"New Orleans LA USA","acronym":"GLSVLSI '25"},"container-title":["Proceedings of the Great Lakes Symposium on VLSI 2025"],"original-title":[],"deposited":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T14:35:38Z","timestamp":1751034938000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3716368.3735273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,29]]},"references-count":39,"alternative-id":["10.1145\/3716368.3735273","10.1145\/3716368"],"URL":"https:\/\/doi.org\/10.1145\/3716368.3735273","relation":{},"subject":[],"published":{"date-parts":[[2025,6,29]]},"assertion":[{"value":"2025-06-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}