{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T19:55:45Z","timestamp":1764014145057,"version":"3.45.0"},"reference-count":36,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T00:00:00Z","timestamp":1761523200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T00:00:00Z","timestamp":1761523200000},"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":[],"published-print":{"date-parts":[[2025,10,27]]},"DOI":"10.1109\/isncc66965.2025.11250473","type":"proceedings-article","created":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T18:39:45Z","timestamp":1763750385000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Selective LLM Unlearning via SAE-Based Token Importance Score"],"prefix":"10.1109","author":[{"given":"So Yeon","family":"Kim","sequence":"first","affiliation":[{"name":"Security AI team, R&D Center AIDEEP Co,. Ltd.,Gwacheon,South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jung Hun","family":"Lim","sequence":"additional","affiliation":[{"name":"Generative AI team, R&D Center AIDEEP Co,. Ltd.,Gwacheon,South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong Woo","family":"Lee","sequence":"additional","affiliation":[{"name":"Generative AI team, R&D Center AIDEEP Co,. Ltd.,Gwacheon,South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seong Hyun","family":"Min","sequence":"additional","affiliation":[{"name":"R&D Center AIDEEP Co,. Ltd.,Gwacheon,South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"In Jae","family":"Kim","sequence":"additional","affiliation":[{"name":"Generative AI team, R&D Center AIDEEP Co,. Ltd.,Gwacheon,South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ma Il","family":"Jo","sequence":"additional","affiliation":[{"name":"Generative AI team, R&D Center AIDEEP Co,. Ltd.,Gwacheon,South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji Young","family":"Shin","sequence":"additional","affiliation":[{"name":"Platform AI team, R&D Center AIDEEP Co,. Ltd.,Gwacheon,South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Won Gyum","family":"Kim","sequence":"additional","affiliation":[{"name":"R&D Center AIDEEP Co,. Ltd.,Gwacheon,South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"GPT-4 technical report","volume-title":"arXiv preprint arXiv:2303.08774","author":"Achiam et al","year":"2023"},{"key":"ref2","article-title":"Gemini: A family of highly capable multimodal models","author":"Team et al","year":"2023","journal-title":"arXiv preprint arXiv:2312.11805"},{"key":"ref3","article-title":"Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning","author":"Guo","year":"2025","journal-title":"arXiv preprint arXiv:2501.12948"},{"key":"ref4","article-title":"Gemma: Open models based on Gemini research and technology","author":"Team et al","year":"2024","journal-title":"arXiv preprint arXiv:2403.08295"},{"key":"ref5","article-title":"LLaMA: Open and efficient foundation language models","author":"Touvron et al","year":"2023","journal-title":"arXiv preprint arXiv:2302.13971"},{"issue":"25","key":"ref6","first-page":"1","article-title":"General data protection regulation","author":"Regulation","year":"2018","journal-title":"Intouch"},{"key":"ref7","first-page":"88","article-title":"The right to be forgotten","volume":"64","author":"Rosen","year":"2011","journal-title":"Stanford Law Review Online"},{"issue":"1","key":"ref8","first-page":"1637","article-title":"California consumer privacy act","volume":"75","author":"Illman","year":"2019","journal-title":"The Business Lawyer"},{"key":"ref9","article-title":"Privacy issues in large language models: A survey","author":"Neel","year":"2023","journal-title":"arXiv preprint arXiv:2312.06717"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/icmc60390.2024.00008"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.35"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00019"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.acl-long.805"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.52202\/079017-3346"},{"article-title":"Towards robust and parameter-efficient knowledge unlearning for LLMs","volume-title":"Proc. 13th Int. Conf. Learn. Representations (ICLR)","author":"Cha","key":"ref15"},{"article-title":"Who\u2019s Harry Potter? Approximate unlearning in LLMs","volume-title":"Proc. 12th Int. Conf. Learn. Representations (ICLR)","author":"Eldan","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.acl-long.457"},{"article-title":"Negative preference optimization: From catastrophic collapse to effective unlearning","volume-title":"Proc. Conf. Learn. and Memory (COLM)","author":"Zhang","key":"ref18"},{"article-title":"Editing models with task arithmetic","volume-title":"Proc. 11th Int. Conf. Learn. Representations (ICLR)","author":"Ilharco","key":"ref19"},{"key":"ref20","first-page":"1258112611","article-title":"Reversing the forget-retain objectives: An efficient LLM unlearning framework from logit difference","volume":"37","author":"Jiabao","year":"2024","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.52202\/079017-3754"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2025.findings-acl.1174"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i1.32068"},{"key":"ref24","article-title":"SUV: Scalable large language model copyright compliance with regularized selective unlearning","author":"Xu","year":"2025","journal-title":"arXiv preprint arXiv:2503.22948"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/icassp.2013.6639343"},{"article-title":"Sparse autoencoders find highly interpretable features in language models","volume-title":"Proc. 12th Int. Conf. Learn. Representations (ICLR)","author":"Cunningham","key":"ref26"},{"article-title":"Efficient dictionary learning with switch sparse autoencoders","volume-title":"Proc. 13th Int. Conf. Learn. Representations (ICLR)","author":"Mudide","key":"ref27"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2025.findings-emnlp.89"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2025.emnlp-main.346"},{"article-title":"Scaling and evaluating sparse autoencoders","volume-title":"Proc. 13th Int. Conf. Learn. Representations (ICLR)","author":"He","key":"ref30"},{"article-title":"Scaling monosemanticity: Extracting interpretable features from Claude 3 Sonnet","year":"2024","author":"Templeton","key":"ref31"},{"key":"ref32","article-title":"Don\u2019t Forget It! Conditional Sparse Autoencoder Clamping Works for Unlearning","author":"Khoriaty","year":"2025","journal-title":"arXiv preprint arXiv:2503.11127"},{"key":"ref33","article-title":"SAEs can improve unlearning: Dynamic sparse autoencoder guardrails for precision unlearning in LLMs","author":"Muhamed","year":"2025","journal-title":"arXiv preprint arXiv:2504.08192"},{"key":"ref34","article-title":"CodeUnlearn: Amortized zeroshot machine unlearning in language models using discrete concepts","author":"Wu","year":"2024","journal-title":"arXiv preprint arXiv:2410.10866"},{"article-title":"Applying sparse autoencoders to unlearn knowledge in language models","volume-title":"Safe Generative AI Workshop at NeurIPS 2024","author":"Farrell","key":"ref35"},{"article-title":"TOFU: A Task of Fictitious Unlearning for LLMs","volume-title":"Proc. Conf. Learn. and Memory (COLM)","author":"Maini","key":"ref36"}],"event":{"name":"2025 International Symposium on Networks, Computers and Communications (ISNCC)","start":{"date-parts":[[2025,10,27]]},"location":"Paris, France","end":{"date-parts":[[2025,10,29]]}},"container-title":["2025 International Symposium on Networks, Computers and Communications (ISNCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11250373\/11250375\/11250473.pdf?arnumber=11250473","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T18:56:44Z","timestamp":1764010604000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11250473\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,27]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/isncc66965.2025.11250473","relation":{},"subject":[],"published":{"date-parts":[[2025,10,27]]}}}