{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/machine-unlearning/papers/2","list_of":"/task/machine-unlearning","task":"Machine Unlearning","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":5,"rows_per_page":100,"rows":[101,200],"of":438,"counts":{"archive_papers_tagged":438,"with_a_code_link":173,"where_syntology_ran_a_sample":89,"not_listed_spam_title":0,"listed":438,"listed_where_code_ran":89,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":75,"every_run_a_failure_of_syntologys_instrument":14,"listed_with_a_run_with_no_instrument_failure":75,"listed_every_run_a_failure_of_syntologys_instrument":14,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/machine-unlearning","prev":"/task/machine-unlearning","next":"/task/machine-unlearning/papers/3","papers":[{"url":"/paper/potion-towards-poison-unlearning","slug":"potion-towards-poison-unlearning","title":"Potion: Towards Poison Unlearning","date":"2024-06-13","arxiv_id":"2406.09173","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":10,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/potion-towards-poison-unlearning#ran","syntology_url":"https://syntology.ai/paper/2406.09173","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09173"}},"official":{"repos":["if-loops/towards_poison_unlearning"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/what-makes-unlearning-hard-and-what-to-do","slug":"what-makes-unlearning-hard-and-what-to-do","title":"What makes unlearning hard and what to do about it","date":"2024-06-03","arxiv_id":"2406.01257","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/what-makes-unlearning-hard-and-what-to-do#ran","syntology_url":"https://syntology.ai/paper/2406.01257","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.01257"}},"official":{"repos":["kairanzhao/rum"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/automatic-jailbreaking-of-the-text-to-image","slug":"automatic-jailbreaking-of-the-text-to-image","title":"Automatic Jailbreaking of the Text-to-Image Generative AI Systems","date":"2024-05-26","arxiv_id":"2405.16567","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":10,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/automatic-jailbreaking-of-the-text-to-image#ran","syntology_url":"https://syntology.ai/paper/2405.16567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16567"}},"official":{"repos":["Kim-Minseon/APGP"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/defensive-unlearning-with-adversarial","slug":"defensive-unlearning-with-adversarial","title":"Defensive Unlearning with Adversarial Training for Robust Concept Erasure in Diffusion Models","date":"2024-05-24","arxiv_id":"2405.15234","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/defensive-unlearning-with-adversarial#ran","syntology_url":"https://syntology.ai/paper/2405.15234","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.15234"}},"official":{"repos":["optml-group/advunlearn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/erase-to-enhance-data-efficient-machine","slug":"erase-to-enhance-data-efficient-machine","title":"Erase to Enhance: Data-Efficient Machine Unlearning in MRI Reconstruction","date":"2024-05-24","arxiv_id":"2405.15517","repositories_listed":1,"syntology":null},{"url":"/paper/machine-unlearning-in-large-language-models","slug":"machine-unlearning-in-large-language-models","title":"Machine Unlearning in Large Language Models","date":"2024-05-24","arxiv_id":"2405.15152","repositories_listed":1,"syntology":null},{"url":"/paper/unlearning-during-learning-an-efficient","slug":"unlearning-during-learning-an-efficient","title":"Unlearning during Learning: An Efficient Federated Machine Unlearning Method","date":"2024-05-24","arxiv_id":"2405.15474","repositories_listed":1,"syntology":null},{"url":"/paper/generative-unlearning-for-any-identity","slug":"generative-unlearning-for-any-identity","title":"Generative Unlearning for Any Identity","date":"2024-05-16","arxiv_id":"2405.09879","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":13,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/generative-unlearning-for-any-identity#ran","syntology_url":"https://syntology.ai/paper/2405.09879","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.09879"}},"official":{"repos":["khu-agi/guide"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/machine-unlearning-for-document","slug":"machine-unlearning-for-document","title":"Machine Unlearning for Document Classification","date":"2024-04-29","arxiv_id":"2404.19031","repositories_listed":1,"syntology":null},{"url":"/paper/machine-unlearning-via-null-space-calibration","slug":"machine-unlearning-via-null-space-calibration","title":"Machine Unlearning via Null Space Calibration","date":"2024-04-21","arxiv_id":"2404.13588","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":1,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"phrase":"7 ran (of which 1 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/machine-unlearning-via-null-space-calibration#ran","syntology_url":"https://syntology.ai/paper/2404.13588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.13588"}},"official":{"repos":["hqc-ml/machine-unlearning-via-null-space-calibration"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/is-retain-set-all-you-need-in-machine","slug":"is-retain-set-all-you-need-in-machine","title":"Is Retain Set All You Need in Machine Unlearning? Restoring Performance of Unlearned Models with Out-Of-Distribution Images","date":"2024-04-19","arxiv_id":"2404.12922","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/is-retain-set-all-you-need-in-machine#ran","syntology_url":"https://syntology.ai/paper/2404.12922","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.12922"}},"official":{"repos":["jbonato1/scar"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/lmeraser-large-model-unlearning-through","slug":"lmeraser-large-model-unlearning-through","title":"LMEraser: Large Model Unlearning through Adaptive Prompt Tuning","date":"2024-04-17","arxiv_id":"2404.11056","repositories_listed":1,"syntology":null},{"url":"/paper/goldfish-an-efficient-federated-unlearning","slug":"goldfish-an-efficient-federated-unlearning","title":"Goldfish: An Efficient Federated Unlearning Framework","date":"2024-04-04","arxiv_id":"2404.03180","repositories_listed":1,"syntology":null},{"url":"/paper/label-agnostic-forgetting-a-supervision-free","slug":"label-agnostic-forgetting-a-supervision-free","title":"Label-Agnostic Forgetting: A Supervision-Free Unlearning in Deep Models","date":"2024-03-31","arxiv_id":"2404.00506","repositories_listed":1,"syntology":null},{"url":"/paper/verifix-post-training-correction-to-improve","slug":"verifix-post-training-correction-to-improve","title":"SAP: Corrective Machine Unlearning with Scaled Activation Projection for Label Noise Robustness","date":"2024-03-13","arxiv_id":"2403.08618","repositories_listed":1,"syntology":null},{"url":"/paper/challenging-forgets-unveiling-the-worst-case","slug":"challenging-forgets-unveiling-the-worst-case","title":"Challenging Forgets: Unveiling the Worst-Case Forget Sets in Machine Unlearning","date":"2024-03-12","arxiv_id":"2403.07362","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/challenging-forgets-unveiling-the-worst-case#ran","syntology_url":"https://syntology.ai/paper/2403.07362","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.07362"}},"official":{"repos":["optml-group/unlearn-worstcase"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/dissecting-language-models-machine-unlearning","slug":"dissecting-language-models-machine-unlearning","title":"Dissecting Language Models: Machine Unlearning via Selective Pruning","date":"2024-03-02","arxiv_id":"2403.01267","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/dissecting-language-models-machine-unlearning#ran","syntology_url":"https://syntology.ai/paper/2403.01267","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01267"}},"official":{"repos":["nickypro/selective-pruning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/inexact-unlearning-needs-more-careful","slug":"inexact-unlearning-needs-more-careful","title":"Inexact Unlearning Needs More Careful Evaluations to Avoid a False Sense of Privacy","date":"2024-03-02","arxiv_id":"2403.01218","repositories_listed":1,"syntology":null},{"url":"/paper/machine-unlearning-of-pre-trained-large","slug":"machine-unlearning-of-pre-trained-large","title":"Machine Unlearning of Pre-trained Large Language Models","date":"2024-02-23","arxiv_id":"2402.15159","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/machine-unlearning-of-pre-trained-large#ran","syntology_url":"https://syntology.ai/paper/2402.15159","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.15159"}},"official":{"repos":["yaojin17/unlearning_llm"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/corrective-machine-unlearning","slug":"corrective-machine-unlearning","title":"Corrective Machine Unlearning","date":"2024-02-21","arxiv_id":"2402.14015","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":10,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/corrective-machine-unlearning#ran","syntology_url":"https://syntology.ai/paper/2402.14015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.14015"}},"official":{"repos":["drimpossible/corrective-unlearning-bench"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/unlearncanvas-a-stylized-image-dataset-to","slug":"unlearncanvas-a-stylized-image-dataset-to","title":"UnlearnCanvas: Stylized Image Dataset for Enhanced Machine Unlearning Evaluation in Diffusion Models","date":"2024-02-19","arxiv_id":"2402.11846","repositories_listed":1,"syntology":{"n":74,"n_ran":55,"n_constructed":0,"n_ran_checked":43,"n_instrument":12,"n_unverified":19,"n_honours":2,"n_violates":1,"n_no_contract":40,"n_pointer_only":40,"phrase":"55 ran (of which 0 constructed an object rather than computing a result; 43 with no instrument failure: 2 honoured, 1 violated, 40 with no contract checked; 12 where Syntology's instrument failed) · 19 unverified","sample_list":"/paper/unlearncanvas-a-stylized-image-dataset-to#ran","syntology_url":"https://syntology.ai/paper/2402.11846","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.11846"}},"official":{"repos":["optml-group/unlearncanvas"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/towards-safer-large-language-models-through","slug":"towards-safer-large-language-models-through","title":"Towards Safer Large Language Models through Machine Unlearning","date":"2024-02-15","arxiv_id":"2402.10058","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/towards-safer-large-language-models-through#ran","syntology_url":"https://syntology.ai/paper/2402.10058","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.10058"}},"official":{"repos":["franciscoliu/sku"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/dataset-condensation-driven-machine","slug":"dataset-condensation-driven-machine","title":"Dataset Condensation Driven Machine Unlearning","date":"2024-01-31","arxiv_id":"2402.00195","repositories_listed":1,"syntology":null},{"url":"/paper/camu-disentangling-causal-effects-in-deep","slug":"camu-disentangling-causal-effects-in-deep","title":"CaMU: Disentangling Causal Effects in Deep Model Unlearning","date":"2024-01-30","arxiv_id":"2401.17504","repositories_listed":1,"syntology":null},{"url":"/paper/towards-effective-and-general-graph","slug":"towards-effective-and-general-graph","title":"Towards Effective and General Graph Unlearning via Mutual Evolution","date":"2024-01-22","arxiv_id":"2401.11760","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-effective-and-general-graph#ran","syntology_url":"https://syntology.ai/paper/2401.11760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.11760"}},"official":{"repos":["xkli-allen/megu"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/scissorhands-scrub-data-influence-via","slug":"scissorhands-scrub-data-influence-via","title":"Scissorhands: Scrub Data Influence via Connection Sensitivity in Networks","date":"2024-01-11","arxiv_id":"2401.06187","repositories_listed":1,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":4,"n_instrument":4,"n_unverified":5,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":3,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/scissorhands-scrub-data-influence-via#ran","syntology_url":"https://syntology.ai/paper/2401.06187","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.06187"}},"official":{"repos":["jingwu321/scissorhands"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/reinforcement-unlearning","slug":"reinforcement-unlearning","title":"Reinforcement Unlearning","date":"2023-12-26","arxiv_id":"2312.15910","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reinforcement-unlearning#ran","syntology_url":"https://syntology.ai/paper/2312.15910","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.15910"}},"official":{"repos":["cp-lab-uts/reinforcement-unlearning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-feature-aware-similarity-thresholding","slug":"fast-feature-aware-similarity-thresholding","title":"FAST: Feature Aware Similarity Thresholding for Weak Unlearning in Black-Box Generative Models","date":"2023-12-22","arxiv_id":"2312.14895","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fast-feature-aware-similarity-thresholding#ran","syntology_url":"https://syntology.ai/paper/2312.14895","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.14895"}},"official":{"repos":["Subhodip123/weak-unlearning-gan"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learn-to-unlearn-for-deep-neural-networks","slug":"learn-to-unlearn-for-deep-neural-networks","title":"Learn to Unlearn for Deep Neural Networks: Minimizing Unlearning Interference with Gradient Projection","date":"2023-12-07","arxiv_id":"2312.04095","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learn-to-unlearn-for-deep-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2312.04095","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.04095"}},"official":{"repos":["hnanhtuan/projected_gradient_unlearning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/duck-distance-based-unlearning-via-centroid","slug":"duck-distance-based-unlearning-via-centroid","title":"DUCK: Distance-based Unlearning via Centroid Kinematics","date":"2023-12-04","arxiv_id":"2312.02052","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/duck-distance-based-unlearning-via-centroid#ran","syntology_url":"https://syntology.ai/paper/2312.02052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02052"}},"official":{"repos":["ocram17/duck"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-unlearning-fast-and-efficient-training","slug":"deep-unlearning-fast-and-efficient-training","title":"Deep Unlearning: Fast and Efficient Gradient-free Approach to Class Forgetting","date":"2023-12-01","arxiv_id":"2312.00761","repositories_listed":1,"syntology":{"n":17,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":17,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/deep-unlearning-fast-and-efficient-training#ran","syntology_url":"https://syntology.ai/paper/2312.00761","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.00761"}},"official":{"repos":["sangamesh-kodge/class_forgetting"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-machine-unlearning-benchmarks","slug":"towards-machine-unlearning-benchmarks","title":"Towards Machine Unlearning Benchmarks: Forgetting the Personal Identities in Facial Recognition Systems","date":"2023-11-03","arxiv_id":"2311.02240","repositories_listed":1,"syntology":null},{"url":"/paper/breaking-the-trilemma-of-privacy-utility","slug":"breaking-the-trilemma-of-privacy-utility","title":"Breaking the Trilemma of Privacy, Utility, Efficiency via Controllable Machine Unlearning","date":"2023-10-28","arxiv_id":"2310.18574","repositories_listed":1,"syntology":{"n":19,"n_ran":16,"n_constructed":0,"n_ran_checked":12,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":2,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/breaking-the-trilemma-of-privacy-utility#ran","syntology_url":"https://syntology.ai/paper/2310.18574","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18574"}},"official":{"repos":["guangyaodou/conmu"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/detecting-pretraining-data-from-large","slug":"detecting-pretraining-data-from-large","title":"Detecting Pretraining Data from Large Language Models","date":"2023-10-25","arxiv_id":"2310.16789","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/detecting-pretraining-data-from-large#ran","syntology_url":"https://syntology.ai/paper/2310.16789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.16789"}},"official":null}},{"url":"/paper/salun-empowering-machine-unlearning-via","slug":"salun-empowering-machine-unlearning-via","title":"SalUn: Empowering Machine Unlearning via Gradient-based Weight Saliency in Both Image Classification and Generation","date":"2023-10-19","arxiv_id":"2310.12508","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/salun-empowering-machine-unlearning-via#ran","syntology_url":"https://syntology.ai/paper/2310.12508","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.12508"}},"official":{"repos":["optml-group/unlearn-saliency"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/task-aware-machine-unlearning-and-its","slug":"task-aware-machine-unlearning-and-its","title":"Task-Aware Machine Unlearning and Its Application in Load Forecasting","date":"2023-08-28","arxiv_id":"2308.14412","repositories_listed":1,"syntology":null},{"url":"/paper/fast-machine-unlearning-without-retraining","slug":"fast-machine-unlearning-without-retraining","title":"Fast Machine Unlearning Without Retraining Through Selective Synaptic Dampening","date":"2023-08-15","arxiv_id":"2308.07707","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":5,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fast-machine-unlearning-without-retraining#ran","syntology_url":"https://syntology.ai/paper/2308.07707","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.07707"}},"official":{"repos":["if-loops/selective-synaptic-dampening"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/machine-unlearning-solutions-and-challenges","slug":"machine-unlearning-solutions-and-challenges","title":"Machine Unlearning: Solutions and Challenges","date":"2023-08-14","arxiv_id":"2308.07061","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/machine-unlearning-solutions-and-challenges#ran","syntology_url":"https://syntology.ai/paper/2308.07061","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.07061"}},"official":{"repos":["tamlhp/awesome-machine-unlearning"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/machine-unlearning-in-gradient-boosting","slug":"machine-unlearning-in-gradient-boosting","title":"Machine Unlearning in Gradient Boosting Decision Trees","date":"2023-08-04","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fair-machine-unlearning-data-removal-while","slug":"fair-machine-unlearning-data-removal-while","title":"Fair Machine Unlearning: Data Removal while Mitigating Disparities","date":"2023-07-27","arxiv_id":"2307.14754","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/fair-machine-unlearning-data-removal-while#ran","syntology_url":"https://syntology.ai/paper/2307.14754","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.14754"}},"official":{"repos":["ai4life-group/fair-unlearning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/tangent-transformers-for-composition-privacy","slug":"tangent-transformers-for-composition-privacy","title":"Tangent Transformers for Composition, Privacy and Removal","date":"2023-07-16","arxiv_id":"2307.08122","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/tangent-transformers-for-composition-privacy#ran","syntology_url":"https://syntology.ai/paper/2307.08122","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.08122"}},"official":{"repos":["tianyu139/tangent-model-composition"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/one-shot-machine-unlearning-with-mnemonic","slug":"one-shot-machine-unlearning-with-mnemonic","title":"One-Shot Machine Unlearning with Mnemonic Code","date":"2023-06-09","arxiv_id":"2306.05670","repositories_listed":1,"syntology":null},{"url":"/paper/forgettable-federated-linear-learning-with","slug":"forgettable-federated-linear-learning-with","title":"Forgettable Federated Linear Learning with Certified Data Unlearning","date":"2023-06-03","arxiv_id":"2306.02216","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/forgettable-federated-linear-learning-with#ran","syntology_url":"https://syntology.ai/paper/2306.02216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02216"}},"official":{"repos":["nanboy-ronan/2f2l-federated-unlearning"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/kga-a-general-machine-unlearning-framework","slug":"kga-a-general-machine-unlearning-framework","title":"KGA: A General Machine Unlearning Framework Based on Knowledge Gap Alignment","date":"2023-05-11","arxiv_id":"2305.06535","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/kga-a-general-machine-unlearning-framework#ran","syntology_url":"https://syntology.ai/paper/2305.06535","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.06535"}},"official":{"repos":["lingzhi-wang/kgaunlearn"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/model-sparsity-can-simplify-machine-1","slug":"model-sparsity-can-simplify-machine-1","title":"Model Sparsity Can Simplify Machine Unlearning","date":"2023-04-11","arxiv_id":"2304.04934","repositories_listed":1,"syntology":{"n":15,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":6,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/model-sparsity-can-simplify-machine-1#ran","syntology_url":"https://syntology.ai/paper/2304.04934","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.04934"}},"official":{"repos":["optml-group/unlearn-sparse"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/gif-a-general-graph-unlearning-strategy-via","slug":"gif-a-general-graph-unlearning-strategy-via","title":"GIF: A General Graph Unlearning Strategy via Influence Function","date":"2023-04-06","arxiv_id":"2304.02835","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-graph-unlearning","slug":"inductive-graph-unlearning","title":"Inductive Graph Unlearning","date":"2023-04-06","arxiv_id":"2304.03093","repositories_listed":1,"syntology":null},{"url":"/paper/towards-unbounded-machine-unlearning-1","slug":"towards-unbounded-machine-unlearning-1","title":"Towards Unbounded Machine Unlearning","date":"2023-02-20","arxiv_id":"2302.09880","repositories_listed":1,"syntology":null},{"url":"/paper/erm-ktp-knowledge-level-machine-unlearning","slug":"erm-ktp-knowledge-level-machine-unlearning","title":"ERM-KTP: Knowledge-Level Machine Unlearning via Knowledge Transfer","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/hidden-poison-machine-unlearning-enables-1","slug":"hidden-poison-machine-unlearning-enables-1","title":"Hidden Poison: Machine Unlearning Enables Camouflaged Poisoning Attacks","date":"2022-12-21","arxiv_id":"2212.10717","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-informed-federated-unlearning","slug":"sequential-informed-federated-unlearning","title":"SIFU: Sequential Informed Federated Unlearning for Efficient and Provable Client Unlearning in Federated Optimization","date":"2022-11-21","arxiv_id":"2211.11656","repositories_listed":1,"syntology":null},{"url":"/paper/unlearning-nonlinear-graph-classifiers-in-the","slug":"unlearning-nonlinear-graph-classifiers-in-the","title":"Unlearning Graph Classifiers with Limited Data Resources","date":"2022-11-06","arxiv_id":"2211.03216","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unlearning-nonlinear-graph-classifiers-in-the#ran","syntology_url":"https://syntology.ai/paper/2211.03216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.03216"}},"official":null}},{"url":"/paper/machine-unlearning-of-federated-clusters","slug":"machine-unlearning-of-federated-clusters","title":"Machine Unlearning of Federated Clusters","date":"2022-10-28","arxiv_id":"2210.16424","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/machine-unlearning-of-federated-clusters#ran","syntology_url":"https://syntology.ai/paper/2210.16424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.16424"}},"official":{"repos":["thupchnsky/mufc"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/verifiable-and-provably-secure-machine","slug":"verifiable-and-provably-secure-machine","title":"Verifiable and Provably Secure Machine Unlearning","date":"2022-10-17","arxiv_id":"2210.09126","repositories_listed":1,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/verifiable-and-provably-secure-machine#ran","syntology_url":"https://syntology.ai/paper/2210.09126","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.09126"}},"official":{"repos":["cleverhans-lab/verifiable-unlearning"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-regression-unlearning","slug":"deep-regression-unlearning","title":"Deep Regression Unlearning","date":"2022-10-15","arxiv_id":"2210.08196","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":3,"n_instrument":5,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-regression-unlearning#ran","syntology_url":"https://syntology.ai/paper/2210.08196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.08196"}},"official":{"repos":["ayu987/deep-regression-unlearning"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/a-survey-of-machine-unlearning","slug":"a-survey-of-machine-unlearning","title":"A Survey of Machine Unlearning","date":"2022-09-06","arxiv_id":"2209.02299","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-machine-unlearning-via-epistemic","slug":"evaluating-machine-unlearning-via-epistemic","title":"Evaluating Machine Unlearning via Epistemic Uncertainty","date":"2022-08-23","arxiv_id":"2208.10836","repositories_listed":1,"syntology":null},{"url":"/paper/the-privacy-onion-effect-memorization-is","slug":"the-privacy-onion-effect-memorization-is","title":"The Privacy Onion Effect: Memorization is Relative","date":"2022-06-21","arxiv_id":"2206.10469","repositories_listed":1,"syntology":null},{"url":"/paper/certified-graph-unlearning","slug":"certified-graph-unlearning","title":"Certified Graph Unlearning","date":"2022-06-18","arxiv_id":"2206.09140","repositories_listed":1,"syntology":null},{"url":"/paper/can-bad-teaching-induce-forgetting-unlearning","slug":"can-bad-teaching-induce-forgetting-unlearning","title":"Can Bad Teaching Induce Forgetting? Unlearning in Deep Networks using an Incompetent Teacher","date":"2022-05-17","arxiv_id":"2205.08096","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":7,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/can-bad-teaching-induce-forgetting-unlearning#ran","syntology_url":"https://syntology.ai/paper/2205.08096","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.08096"}},"official":{"repos":["vikram2000b/bad-teaching-unlearning"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-unlearning-via-randomized-conditionally","slug":"deep-unlearning-via-randomized-conditionally","title":"Deep Unlearning via Randomized Conditionally Independent Hessians","date":"2022-04-15","arxiv_id":"2204.07655","repositories_listed":1,"syntology":{"n":15,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/deep-unlearning-via-randomized-conditionally#ran","syntology_url":"https://syntology.ai/paper/2204.07655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.07655"}},"official":{"repos":["vsingh-group/LCODEC-deep-unlearning"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-removal-in-sampling-based-bayesian-1","slug":"knowledge-removal-in-sampling-based-bayesian-1","title":"Knowledge Removal in Sampling-based Bayesian Inference","date":"2022-03-24","arxiv_id":"2203.12964","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/knowledge-removal-in-sampling-based-bayesian-1#ran","syntology_url":"https://syntology.ai/paper/2203.12964","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.12964"}},"official":{"repos":["fshp971/mcmc-unlearning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/recommendation-unlearning","slug":"recommendation-unlearning","title":"Recommendation Unlearning","date":"2022-01-18","arxiv_id":"2201.06820","repositories_listed":1,"syntology":null},{"url":"/paper/zero-shot-machine-unlearning","slug":"zero-shot-machine-unlearning","title":"Zero-Shot Machine Unlearning","date":"2022-01-14","arxiv_id":"2201.05629","repositories_listed":1,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":6,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/zero-shot-machine-unlearning#ran","syntology_url":"https://syntology.ai/paper/2201.05629","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.05629"}},"official":{"repos":["ayu987/zero-shot-unlearning"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-yet-effective-machine-unlearning","slug":"fast-yet-effective-machine-unlearning","title":"Fast Yet Effective Machine Unlearning","date":"2021-11-17","arxiv_id":"2111.08947","repositories_listed":1,"syntology":null},{"url":"/paper/unrolling-sgd-understanding-factors","slug":"unrolling-sgd-understanding-factors","title":"Unrolling SGD: Understanding Factors Influencing Machine Unlearning","date":"2021-09-27","arxiv_id":"2109.13398","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unrolling-sgd-understanding-factors#ran","syntology_url":"https://syntology.ai/paper/2109.13398","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.13398"}},"official":{"repos":["cleverhans-lab/unrolling-sgd"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hard-to-forget-poisoning-attacks-on-certified","slug":"hard-to-forget-poisoning-attacks-on-certified","title":"Hard to Forget: Poisoning Attacks on Certified Machine Unlearning","date":"2021-09-17","arxiv_id":"2109.08266","repositories_listed":1,"syntology":{"n":11,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/hard-to-forget-poisoning-attacks-on-certified#ran","syntology_url":"https://syntology.ai/paper/2109.08266","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.08266"}},"official":{"repos":["ngmarchant/attack-unlearning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/machine-unlearning-of-features-and-labels","slug":"machine-unlearning-of-features-and-labels","title":"Machine Unlearning of Features and Labels","date":"2021-08-26","arxiv_id":"2108.11577","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/machine-unlearning-of-features-and-labels#ran","syntology_url":"https://syntology.ai/paper/2108.11577","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.11577"}},"official":{"repos":["alewarne/machineunlearning"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/certifiable-machine-unlearning-for-linear","slug":"certifiable-machine-unlearning-for-linear","title":"Certifiable Machine Unlearning for Linear Models","date":"2021-06-29","arxiv_id":"2106.15093","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-machine-unlearning","slug":"adaptive-machine-unlearning","title":"Adaptive Machine Unlearning","date":"2021-06-08","arxiv_id":"2106.04378","repositories_listed":1,"syntology":null},{"url":"/paper/graph-unlearning","slug":"graph-unlearning","title":"Graph Unlearning","date":"2021-03-27","arxiv_id":"2103.14991","repositories_listed":1,"syntology":null},{"url":"/paper/when-machine-unlearning-jeopardizes-privacy","slug":"when-machine-unlearning-jeopardizes-privacy","title":"When Machine Unlearning Jeopardizes Privacy","date":"2020-05-05","arxiv_id":"2005.02205","repositories_listed":1,"syntology":null},{"url":"/paper/towards-probabilistic-verification-of-machine","slug":"towards-probabilistic-verification-of-machine","title":"Towards Probabilistic Verification of Machine Unlearning","date":"2020-03-09","arxiv_id":"2003.04247","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"0 ran · 3 unverified","sample_list":"/paper/towards-probabilistic-verification-of-machine#ran","syntology_url":"https://syntology.ai/paper/2003.04247","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.04247"}},"official":{"repos":["inspire-group/unlearning-verification"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":null,"slug":"what-should-llms-forget-quantifying-personal","title":"What Should LLMs Forget? Quantifying Personal Data in LLMs for Right-to-Be-Forgotten Requests","date":"2025-07-15","arxiv_id":"2507.11128","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-necessity-of-output-distribution","title":"On the Necessity of Output Distribution Reweighting for Effective Class Unlearning","date":"2025-06-25","arxiv_id":"2506.20893","repositories_listed":0,"syntology":null},{"url":null,"slug":"orthogonal-soft-pruning-for-efficient-class","title":"Orthogonal Soft Pruning for Efficient Class Unlearning","date":"2025-06-24","arxiv_id":"2506.19891","repositories_listed":0,"syntology":null},{"url":null,"slug":"recalling-the-forgotten-class-memberships","title":"Recalling The Forgotten Class Memberships: Unlearned Models Can Be Noisy Labelers to Leak Privacy","date":"2025-06-24","arxiv_id":"2506.19486","repositories_listed":0,"syntology":null},{"url":null,"slug":"verifiable-unlearning-on-edge","title":"Verifiable Unlearning on Edge","date":"2025-06-24","arxiv_id":"2506.20037","repositories_listed":0,"syntology":null},{"url":"/paper/sharpness-aware-machine-unlearning","slug":"sharpness-aware-machine-unlearning","title":"Sharpness-Aware Machine Unlearning","date":"2025-06-16","arxiv_id":"2506.13715","repositories_listed":0,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/sharpness-aware-machine-unlearning#ran","syntology_url":"https://syntology.ai/paper/2506.13715","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.13715"}},"official":null}},{"url":null,"slug":"ucd-unlearning-in-llms-via-contrastive","title":"UCD: Unlearning in LLMs via Contrastive Decoding","date":"2025-06-12","arxiv_id":"2506.12097","repositories_listed":0,"syntology":null},{"url":null,"slug":"2506-10236","title":"Prompt Attacks Reveal Superficial Knowledge Removal in Unlearning Methods","date":"2025-06-11","arxiv_id":"2506.10236","repositories_listed":0,"syntology":null},{"url":null,"slug":"sok-machine-unlearning-for-large-language","title":"SoK: Machine Unlearning for Large Language Models","date":"2025-06-10","arxiv_id":"2506.09227","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantifying-cross-modality-memorization-in","title":"Quantifying Cross-Modality Memorization in Vision-Language Models","date":"2025-06-05","arxiv_id":"2506.05198","repositories_listed":0,"syntology":null},{"url":null,"slug":"salad-systematic-assessment-of-machine","title":"SALAD: Systematic Assessment of Machine Unlearing on LLM-Aided Hardware Design","date":"2025-06-02","arxiv_id":"2506.02089","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-machine-unlearning-for-paralinguistic","title":"Towards Machine Unlearning for Paralinguistic Speech Processing","date":"2025-06-02","arxiv_id":"2506.02230","repositories_listed":0,"syntology":null},{"url":null,"slug":"speech-unlearning","title":"Speech Unlearning","date":"2025-06-01","arxiv_id":"2506.00848","repositories_listed":0,"syntology":null},{"url":null,"slug":"does-machine-unlearning-truly-remove-model","title":"Does Machine Unlearning Truly Remove Model Knowledge? A Framework for Auditing Unlearning in LLMs","date":"2025-05-29","arxiv_id":"2505.23270","repositories_listed":0,"syntology":null},{"url":null,"slug":"targeted-unlearning-using-perturbed-sign","title":"Targeted Unlearning Using Perturbed Sign Gradient Methods With Applications On Medical Images","date":"2025-05-28","arxiv_id":"2505.21872","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-per-instance-privacy-for-machine","title":"Leveraging Per-Instance Privacy for Machine Unlearning","date":"2025-05-24","arxiv_id":"2505.18786","repositories_listed":0,"syntology":null},{"url":null,"slug":"soft-weighted-machine-unlearning","title":"Soft Weighted Machine Unlearning","date":"2025-05-24","arxiv_id":"2505.18783","repositories_listed":0,"syntology":null},{"url":null,"slug":"losing-is-for-cherishing-data-valuation-based","title":"Losing is for Cherishing: Data Valuation Based on Machine Unlearning and Shapley Value","date":"2025-05-22","arxiv_id":"2505.16147","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-gradient-based-framework-for-task","title":"A Unified Gradient-based Framework for Task-agnostic Continual Learning-Unlearning","date":"2025-05-21","arxiv_id":"2505.15178","repositories_listed":0,"syntology":null},{"url":"/paper/seps-a-separability-measure-for-robust","slug":"seps-a-separability-measure-for-robust","title":"SEPS: A Separability Measure for Robust Unlearning in LLMs","date":"2025-05-20","arxiv_id":"2505.14832","repositories_listed":0,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"0 ran · 3 unverified","sample_list":"/paper/seps-a-separability-measure-for-robust#ran","syntology_url":"https://syntology.ai/paper/2505.14832","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.14832"}},"official":null}},{"url":null,"slug":"few-shot-concept-unlearning-with-low-rank","title":"Few-Shot Concept Unlearning with Low Rank Adaptation","date":"2025-05-18","arxiv_id":"2505.12395","repositories_listed":0,"syntology":null},{"url":null,"slug":"2505-10845","title":"Ready2Unlearn: A Learning-Time Approach for Preparing Models with Future Unlearning Readiness","date":"2025-05-16","arxiv_id":"2505.10845","repositories_listed":0,"syntology":null},{"url":null,"slug":"2505-10859","title":"MCU: Improving Machine Unlearning through Mode Connectivity","date":"2025-05-16","arxiv_id":"2505.10859","repositories_listed":0,"syntology":null},{"url":null,"slug":"taiji-mcp-based-multi-modal-data-analytics-on","title":"TAIJI: MCP-based Multi-Modal Data Analytics on Data Lakes","date":"2025-05-16","arxiv_id":"2505.11270","repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-large-language-models-feasibility","title":"Federated Large Language Models: Feasibility, Robustness, Security and Future Directions","date":"2025-05-13","arxiv_id":"2505.08830","repositories_listed":0,"syntology":null},{"url":null,"slug":"mirror-mirror-on-the-wall-have-i-forgotten-it","title":"Mirror Mirror on the Wall, Have I Forgotten it All? A New Framework for Evaluating Machine Unlearning","date":"2025-05-13","arxiv_id":"2505.08138","repositories_listed":0,"syntology":null},{"url":null,"slug":"mubox-a-critical-evaluation-framework-of-deep","title":"MUBox: A Critical Evaluation Framework of Deep Machine Unlearning","date":"2025-05-13","arxiv_id":"2505.08576","repositories_listed":0,"syntology":null}],"record_sha256":"903c87e0a03661e241f4d54f07be08a51f6b8df602e3faba177282d4794b4129","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}