{"url":"/task/machine-unlearning","name":"Machine Unlearning","slug":"machine-unlearning","description_markdown":null,"categories":[{"name":"Computer Vision","url":"/area/computer-vision"},{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":438,"papers_with_code":173,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":1,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[{"url":"/task/continual-forgetting","name":"Continual Forgetting"}],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":173,"tagged_in_all":438,"items":[{"url":"/paper/muse-machine-unlearning-six-way-evaluation","title":"MUSE: Machine Unlearning Six-Way Evaluation for Language Models","date":"2024-07-08","arxiv_id":"2407.06460","repositories_listed":3,"syntology":null},{"url":"/paper/evaluating-inexact-unlearning-requires","title":"Towards Adversarial Evaluations for Inexact Machine Unlearning","date":"2022-01-17","arxiv_id":"2201.06640","repositories_listed":3,"syntology":null},{"url":"/paper/dart-data-addition-and-removal-trees","title":"Machine Unlearning for Random Forests","date":"2020-09-11","arxiv_id":"2009.05567","repositories_listed":3,"syntology":{"n":8,"n_ran":8,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/restor-knowledge-recovery-through-machine","title":"RESTOR: Knowledge Recovery through Machine Unlearning","date":"2024-10-31","arxiv_id":"2411.00204","repositories_listed":2,"syntology":{"n":7,"n_ran":2,"n_unverified":5,"n_pointer_only":2}},{"url":"/paper/unified-gradient-based-machine-unlearning","title":"Unified Gradient-Based Machine Unlearning with Remain Geometry Enhancement","date":"2024-09-29","arxiv_id":"2409.19732","repositories_listed":2,"syntology":{"n":26,"n_ran":12,"n_unverified":14,"n_pointer_only":3}},{"url":"/paper/snap-unlearning-selective-knowledge-in-large","title":"Opt-Out: Investigating Entity-Level Unlearning for Large Language Models via Optimal Transport","date":"2024-06-18","arxiv_id":"2406.12329","repositories_listed":2,"syntology":{"n":7,"n_ran":3,"n_unverified":4,"n_pointer_only":0}},{"url":"/paper/unlearning-concepts-in-diffusion-model-via","title":"Unlearning Concepts in Diffusion Model via Concept Domain Correction and Concept Preserving Gradient","date":"2024-05-24","arxiv_id":"2405.15304","repositories_listed":2,"syntology":null},{"url":"/paper/stochastic-gradient-langevin-unlearning","title":"Certified Machine Unlearning via Noisy Stochastic Gradient Descent","date":"2024-03-25","arxiv_id":"2403.17105","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/zero-shot-machine-unlearning-at-scale-via","title":"An Information Theoretic Approach to Machine Unlearning","date":"2024-02-02","arxiv_id":"2402.01401","repositories_listed":2,"syntology":{"n":15,"n_ran":14,"n_unverified":1,"n_pointer_only":15}},{"url":"/paper/machine-unlearning-for-image-to-image","title":"Machine Unlearning for Image-to-Image Generative Models","date":"2024-02-01","arxiv_id":"2402.00351","repositories_listed":2,"syntology":null},{"url":"/paper/langevin-unlearning-a-new-perspective-of","title":"Langevin Unlearning: A New Perspective of Noisy Gradient Descent for Machine Unlearning","date":"2024-01-18","arxiv_id":"2401.10371","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/multimodal-machine-unlearning","title":"MultiDelete for Multimodal Machine Unlearning","date":"2023-11-18","arxiv_id":"2311.12047","repositories_listed":2,"syntology":{"n":7,"n_ran":3,"n_unverified":4,"n_pointer_only":7}},{"url":"/paper/in-context-unlearning-language-models-as-few","title":"In-Context Unlearning: Language Models as Few Shot Unlearners","date":"2023-10-11","arxiv_id":"2310.07579","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_unverified":2,"n_pointer_only":8}},{"url":"/paper/how-to-combine-membership-inference-attacks","title":"How to Combine Membership-Inference Attacks on Multiple Updated Models","date":"2022-05-12","arxiv_id":"2205.06369","repositories_listed":2,"syntology":null},{"url":"/paper/descent-to-delete-gradient-based-methods-for","title":"Descent-to-Delete: Gradient-Based Methods for Machine Unlearning","date":"2020-07-06","arxiv_id":"2007.02923","repositories_listed":2,"syntology":null},{"url":"/paper/machine-unlearning","title":"Machine Unlearning","date":"2019-12-09","arxiv_id":"1912.03817","repositories_listed":2,"syntology":{"n":4,"n_ran":1,"n_unverified":3,"n_pointer_only":0}},{"url":"/paper/model-state-arithmetic-for-machine-unlearning","title":"Model State Arithmetic for Machine Unlearning","date":"2025-06-26","arxiv_id":"2506.20941","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/membership-inference-attacks-as-privacy-tools","title":"Membership Inference Attacks as Privacy Tools: Reliability, Disparity and Ensemble","date":"2025-06-16","arxiv_id":"2506.13972","repositories_listed":1,"syntology":null},{"url":"/paper/rectifying-privacy-and-efficacy-measurements","title":"Rectifying Privacy and Efficacy Measurements in Machine Unlearning: A New Inference Attack Perspective","date":"2025-06-16","arxiv_id":"2506.13009","repositories_listed":1,"syntology":null},{"url":"/paper/unlearning-isn-t-invisible-detecting","title":"Unlearning Isn't Invisible: Detecting Unlearning Traces in LLMs from Model Outputs","date":"2025-06-16","arxiv_id":"2506.14003","repositories_listed":1,"syntology":{"n":7,"n_ran":0,"n_unverified":7,"n_pointer_only":0}},{"url":"/paper/apollo-a-posteriori-label-only-membership","title":"Apollo: A Posteriori Label-Only Membership Inference Attack Towards Machine Unlearning","date":"2025-06-11","arxiv_id":"2506.09923","repositories_listed":1,"syntology":null},{"url":"/paper/certified-unlearning-for-neural-networks","title":"Certified Unlearning for Neural Networks","date":"2025-06-08","arxiv_id":"2506.06985","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/towards-lifecycle-unlearning-commitment","title":"Towards Lifecycle Unlearning Commitment Management: Measuring Sample-level Unlearning Completeness","date":"2025-06-06","arxiv_id":"2506.06112","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-machine-unlearning-in-image","title":"Rethinking Machine Unlearning in Image Generation Models","date":"2025-06-03","arxiv_id":"2506.02761","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/invariance-makes-llm-unlearning-resilient","title":"Invariance Makes LLM Unlearning Resilient Even to Unanticipated Downstream Fine-Tuning","date":"2025-06-02","arxiv_id":"2506.01339","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_unverified":3,"n_pointer_only":0}},{"url":"/paper/aligned-but-blind-alignment-increases","title":"Aligned but Blind: Alignment Increases Implicit Bias by Reducing Awareness of Race","date":"2025-05-30","arxiv_id":"2506.00253","repositories_listed":1,"syntology":null},{"url":"/paper/unlearning-isn-t-deletion-investigating","title":"Unlearning Isn't Deletion: Investigating Reversibility of Machine Unlearning in LLMs","date":"2025-05-22","arxiv_id":"2505.16831","repositories_listed":1,"syntology":{"n":4,"n_ran":0,"n_unverified":4,"n_pointer_only":0}},{"url":"/paper/unierase-unlearning-token-as-a-universal","title":"UniErase: Unlearning Token as a Universal Erasure Primitive for Language Models","date":"2025-05-21","arxiv_id":"2505.15674","repositories_listed":1,"syntology":null},{"url":"/paper/alexa-can-you-forget-me-machine-unlearning","title":"\"Alexa, can you forget me?\" Machine Unlearning Benchmark in Spoken Language Understanding","date":"2025-05-21","arxiv_id":"2505.15700","repositories_listed":1,"syntology":null},{"url":"/paper/dusk-do-not-unlearn-shared-knowledge","title":"DUSK: Do Not Unlearn Shared Knowledge","date":"2025-05-21","arxiv_id":"2505.15209","repositories_listed":1,"syntology":null}],"syntology_records":16,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}