{"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","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 (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":5,"rows_per_page":100,"shown":100,"of":438,"of_with_code":173,"tagged_in_all":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":72,"every_run_a_failure_of_syntologys_instrument":17,"listed_with_a_run_with_no_instrument_failure":72,"listed_every_run_a_failure_of_syntologys_instrument":17,"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"},"items":[{"url":"/paper/muse-machine-unlearning-six-way-evaluation","slug":"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","slug":"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","slug":"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_constructed":2,"n_ran_checked":5,"n_instrument":3,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"8 ran (of which 2 constructed an object rather than computing a result; 5 with no instrument failure: 3 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dart-data-addition-and-removal-trees#ran","syntology_url":"https://syntology.ai/paper/2009.05567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.05567"}},"official":{"repos":["jjbrophy47/dare_rf","jjbrophy47/dart"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/restor-knowledge-recovery-through-machine","slug":"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":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"4 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; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/restor-knowledge-recovery-through-machine#ran","syntology_url":"https://syntology.ai/paper/2411.00204","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.00204"}},"official":{"repos":["k1rezaei/restor"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/unified-gradient-based-machine-unlearning","slug":"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":17,"n_constructed":0,"n_ran_checked":10,"n_instrument":7,"n_unverified":9,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":3,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 7 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/unified-gradient-based-machine-unlearning#ran","syntology_url":"https://syntology.ai/paper/2409.19732","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.19732"}},"official":null}},{"url":"/paper/snap-unlearning-selective-knowledge-in-large","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":4,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/snap-unlearning-selective-knowledge-in-large#ran","syntology_url":"https://syntology.ai/paper/2406.12329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12329"}},"official":{"repos":["brightjade/Opt-Out","brightjade/snap-unlearning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/unlearning-concepts-in-diffusion-model-via","slug":"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","slug":"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_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/stochastic-gradient-langevin-unlearning#ran","syntology_url":"https://syntology.ai/paper/2403.17105","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.17105"}},"official":{"repos":["graph-com/sgd_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/zero-shot-machine-unlearning-at-scale-via","slug":"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_constructed":0,"n_ran_checked":8,"n_instrument":6,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":5,"n_pointer_only":15,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 3 honoured, 0 violated, 5 with no contract checked; 6 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/zero-shot-machine-unlearning-at-scale-via#ran","syntology_url":"https://syntology.ai/paper/2402.01401","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.01401"}},"official":{"repos":["jwf40/information-theoretic-unlearning","jwf40/zeroshot-unlearning-at-scale"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/machine-unlearning-for-image-to-image","slug":"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","slug":"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_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/langevin-unlearning-a-new-perspective-of#ran","syntology_url":"https://syntology.ai/paper/2401.10371","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.10371"}},"official":{"repos":["graph-com/langevin_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/multimodal-machine-unlearning","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"3 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; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/multimodal-machine-unlearning#ran","syntology_url":"https://syntology.ai/paper/2311.12047","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.12047"}},"official":{"repos":["clu-uml/multidelete","chengjiali/Multimodal-Machine-Unlearning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/in-context-unlearning-language-models-as-few","slug":"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_constructed":1,"n_ran_checked":4,"n_instrument":2,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":8,"phrase":"6 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/in-context-unlearning-language-models-as-few#ran","syntology_url":"https://syntology.ai/paper/2310.07579","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.07579"}},"official":{"repos":["MartinPawel/In-Context-Unlearning"],"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":["listed","official"]}}},{"url":"/paper/how-to-combine-membership-inference-attacks","slug":"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","slug":"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","slug":"machine-unlearning","title":"Machine Unlearning","date":"2019-12-09","arxiv_id":"1912.03817","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/machine-unlearning#ran","syntology_url":"https://syntology.ai/paper/1912.03817","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.03817"}},"official":{"repos":["cleverhans-lab/machine-unlearning"],"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/model-state-arithmetic-for-machine-unlearning","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 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; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/model-state-arithmetic-for-machine-unlearning#ran","syntology_url":"https://syntology.ai/paper/2506.20941","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.20941"}},"official":{"repos":["mehrdadsaberi/msa_unlearning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/membership-inference-attacks-as-privacy-tools","slug":"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","slug":"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","slug":"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":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"6 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unlearning-isn-t-invisible-detecting#ran","syntology_url":"https://syntology.ai/paper/2506.14003","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.14003"}},"official":{"repos":["optml-group/unlearn-trace"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/apollo-a-posteriori-label-only-membership","slug":"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","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/certified-unlearning-for-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2506.06985","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.06985"}},"official":{"repos":["stair-lab/certified-unlearning-neural-networks-icml-2025"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/towards-lifecycle-unlearning-commitment","slug":"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","slug":"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_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rethinking-machine-unlearning-in-image#ran","syntology_url":"https://syntology.ai/paper/2506.02761","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.02761"}},"official":{"repos":["ryliu68/igmu"],"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/invariance-makes-llm-unlearning-resilient","slug":"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":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"5 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/invariance-makes-llm-unlearning-resilient#ran","syntology_url":"https://syntology.ai/paper/2506.01339","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.01339"}},"official":{"repos":["optml-group/unlearn-ilu"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/aligned-but-blind-alignment-increases","slug":"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","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 4 unverified","sample_list":"/paper/unlearning-isn-t-deletion-investigating#ran","syntology_url":"https://syntology.ai/paper/2505.16831","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.16831"}},"official":{"repos":["xiaoyuxu1/representational_analysis_tools"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":[]}}},{"url":"/paper/alexa-can-you-forget-me-machine-unlearning","slug":"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","slug":"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},{"url":"/paper/unierase-unlearning-token-as-a-universal","slug":"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/2505-10941","slug":"2505-10941","title":"Privacy-Aware Lifelong Learning","date":"2025-05-16","arxiv_id":"2505.10941","repositories_listed":1,"syntology":null},{"url":"/paper/layered-unlearning-for-adversarial-relearning","slug":"layered-unlearning-for-adversarial-relearning","title":"Layered Unlearning for Adversarial Relearning","date":"2025-05-14","arxiv_id":"2505.09500","repositories_listed":1,"syntology":null},{"url":"/paper/certified-data-removal-under-high-dimensional","slug":"certified-data-removal-under-high-dimensional","title":"Certified Data Removal Under High-dimensional Settings","date":"2025-05-12","arxiv_id":"2505.07640","repositories_listed":1,"syntology":null},{"url":"/paper/sha256-at-semeval-2025-task-4-selective","slug":"sha256-at-semeval-2025-task-4-selective","title":"SHA256 at SemEval-2025 Task 4: Selective Amnesia -- Constrained Unlearning for Large Language Models via Knowledge Isolation","date":"2025-04-17","arxiv_id":"2504.12996","repositories_listed":1,"syntology":null},{"url":"/paper/llm-unlearning-reveals-a-stronger-than","slug":"llm-unlearning-reveals-a-stronger-than","title":"LLM Unlearning Reveals a Stronger-Than-Expected Coreset Effect in Current Benchmarks","date":"2025-04-14","arxiv_id":"2504.10185","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/llm-unlearning-reveals-a-stronger-than#ran","syntology_url":"https://syntology.ai/paper/2504.10185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.10185"}},"official":{"repos":["optml-group/mu-coreset"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/not-all-data-are-unlearned-equally","slug":"not-all-data-are-unlearned-equally","title":"Not All Data Are Unlearned Equally","date":"2025-04-07","arxiv_id":"2504.05058","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-unlearnable-data","slug":"a-survey-on-unlearnable-data","title":"A Survey on Unlearnable Data","date":"2025-03-30","arxiv_id":"2503.23536","repositories_listed":1,"syntology":null},{"url":"/paper/lotus-large-scale-machine-unlearning-with-a","slug":"lotus-large-scale-machine-unlearning-with-a","title":"LoTUS: Large-Scale Machine Unlearning with a Taste of Uncertainty","date":"2025-03-24","arxiv_id":"2503.18314","repositories_listed":1,"syntology":null},{"url":"/paper/safety-mirage-how-spurious-correlations","slug":"safety-mirage-how-spurious-correlations","title":"Safety Mirage: How Spurious Correlations Undermine VLM Safety Fine-tuning","date":"2025-03-14","arxiv_id":"2503.11832","repositories_listed":1,"syntology":{"n":14,"n_ran":9,"n_constructed":0,"n_ran_checked":2,"n_instrument":7,"n_unverified":5,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 7 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/safety-mirage-how-spurious-correlations#ran","syntology_url":"https://syntology.ai/paper/2503.11832","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.11832"}},"official":{"repos":["optml-group/vlm-safety-mu"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["community","found_in_text","official"]}}},{"url":"/paper/group-robust-machine-unlearning","slug":"group-robust-machine-unlearning","title":"Group-robust Machine Unlearning","date":"2025-03-12","arxiv_id":"2503.09330","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/group-robust-machine-unlearning#ran","syntology_url":"https://syntology.ai/paper/2503.09330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.09330"}},"official":{"repos":["tdemin16/group-robust_machine_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/data-unlearning-in-diffusion-models","slug":"data-unlearning-in-diffusion-models","title":"Data Unlearning in Diffusion Models","date":"2025-03-02","arxiv_id":"2503.01034","repositories_listed":1,"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":1,"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/data-unlearning-in-diffusion-models#ran","syntology_url":"https://syntology.ai/paper/2503.01034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.01034"}},"official":{"repos":["claserken/SISS"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/erasing-without-remembering-safeguarding","slug":"erasing-without-remembering-safeguarding","title":"Erasing Without Remembering: Implicit Knowledge Forgetting in Large Language Models","date":"2025-02-27","arxiv_id":"2502.19982","repositories_listed":1,"syntology":null},{"url":"/paper/scu-an-efficient-machine-unlearning-scheme","slug":"scu-an-efficient-machine-unlearning-scheme","title":"SCU: An Efficient Machine Unlearning Scheme for Deep Learning Enabled Semantic Communications","date":"2025-02-27","arxiv_id":"2502.19785","repositories_listed":1,"syntology":null},{"url":"/paper/forgetting-any-data-at-any-time-a","slug":"forgetting-any-data-at-any-time-a","title":"Forgetting Any Data at Any Time: A Theoretically Certified Unlearning Framework for Vertical Federated Learning","date":"2025-02-24","arxiv_id":"2502.17081","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-vulnerability-of-concept-erasure-in","slug":"on-the-vulnerability-of-concept-erasure-in","title":"On the Vulnerability of Concept Erasure in Diffusion Models","date":"2025-02-24","arxiv_id":"2502.17537","repositories_listed":1,"syntology":null},{"url":"/paper/reveil-unconstrained-concealed-backdoor","slug":"reveil-unconstrained-concealed-backdoor","title":"ReVeil: Unconstrained Concealed Backdoor Attack on Deep Neural Networks using Machine Unlearning","date":"2025-02-17","arxiv_id":"2502.11687","repositories_listed":1,"syntology":null},{"url":"/paper/mmunlearner-reformulating-multimodal-machine","slug":"mmunlearner-reformulating-multimodal-machine","title":"MMUnlearner: Reformulating Multimodal Machine Unlearning in the Era of Multimodal Large Language Models","date":"2025-02-16","arxiv_id":"2502.11051","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/mmunlearner-reformulating-multimodal-machine#ran","syntology_url":"https://syntology.ai/paper/2502.11051","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.11051"}},"official":{"repos":["z1zs/mmunlearner"],"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/comparative-study-of-machine-unlearning","slug":"comparative-study-of-machine-unlearning","title":"Comparative Study of Machine Unlearning Techniques for Computer Vision and NLP Models","date":"2025-02-14","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/saeuron-interpretable-concept-unlearning-in","slug":"saeuron-interpretable-concept-unlearning-in","title":"SAeUron: Interpretable Concept Unlearning in Diffusion Models with Sparse Autoencoders","date":"2025-01-29","arxiv_id":"2501.18052","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/saeuron-interpretable-concept-unlearning-in#ran","syntology_url":"https://syntology.ai/paper/2501.18052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.18052"}},"official":{"repos":["cywinski/saeuron"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/technical-report-for-the-forgotten-by-design","slug":"technical-report-for-the-forgotten-by-design","title":"Technical Report for the Forgotten-by-Design Project: Targeted Obfuscation for Machine Learning","date":"2025-01-20","arxiv_id":"2501.11525","repositories_listed":1,"syntology":null},{"url":"/paper/multi-objective-large-language-model","slug":"multi-objective-large-language-model","title":"Multi-Objective Large Language Model Unlearning","date":"2024-12-29","arxiv_id":"2412.20412","repositories_listed":1,"syntology":null},{"url":"/paper/forget-vectors-at-play-universal-input","slug":"forget-vectors-at-play-universal-input","title":"Forget Vectors at Play: Universal Input Perturbations Driving Machine Unlearning in Image Classification","date":"2024-12-21","arxiv_id":"2412.16780","repositories_listed":1,"syntology":null},{"url":"/paper/toward-efficient-data-free-unlearning","slug":"toward-efficient-data-free-unlearning","title":"Toward Efficient Data-Free Unlearning","date":"2024-12-18","arxiv_id":"2412.13790","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-alignment-for-post-unlearning-text","slug":"boosting-alignment-for-post-unlearning-text","title":"Boosting Alignment for Post-Unlearning Text-to-Image Generative Models","date":"2024-12-09","arxiv_id":"2412.07808","repositories_listed":1,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":5,"n_instrument":8,"n_unverified":3,"n_honours":4,"n_violates":1,"n_no_contract":0,"n_pointer_only":16,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 4 honoured, 1 violated, 0 with no contract checked; 8 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/boosting-alignment-for-post-unlearning-text#ran","syntology_url":"https://syntology.ai/paper/2412.07808","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.07808"}},"official":{"repos":["reds-lab/restricted_gradient_diversity_unlearning"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/siamese-machine-unlearning-with-knowledge","slug":"siamese-machine-unlearning-with-knowledge","title":"Siamese Machine Unlearning with Knowledge Vaporization and Concentration","date":"2024-12-02","arxiv_id":"2412.01207","repositories_listed":1,"syntology":null},{"url":"/paper/munba-machine-unlearning-via-nash-bargaining","slug":"munba-machine-unlearning-via-nash-bargaining","title":"MUNBa: Machine Unlearning via Nash Bargaining","date":"2024-11-23","arxiv_id":"2411.15537","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":2,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/munba-machine-unlearning-via-nash-bargaining#ran","syntology_url":"https://syntology.ai/paper/2411.15537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.15537"}},"official":{"repos":["JingWu321/MUNBa"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/towards-robust-evaluation-of-unlearning-in","slug":"towards-robust-evaluation-of-unlearning-in","title":"Towards Robust Evaluation of Unlearning in LLMs via Data Transformations","date":"2024-11-23","arxiv_id":"2411.15477","repositories_listed":1,"syntology":null},{"url":"/paper/verifying-machine-unlearning-with-explainable","slug":"verifying-machine-unlearning-with-explainable","title":"Verifying Machine Unlearning with Explainable AI","date":"2024-11-20","arxiv_id":"2411.13332","repositories_listed":1,"syntology":null},{"url":"/paper/lora-unlearns-more-and-retains-more-student","slug":"lora-unlearns-more-and-retains-more-student","title":"LoRA Unlearns More and Retains More (Student Abstract)","date":"2024-11-16","arxiv_id":"2411.11907","repositories_listed":1,"syntology":null},{"url":"/paper/benchmarking-vision-language-model-unlearning","slug":"benchmarking-vision-language-model-unlearning","title":"Benchmarking Vision Language Model Unlearning via Fictitious Facial Identity Dataset","date":"2024-11-05","arxiv_id":"2411.03554","repositories_listed":1,"syntology":{"n":18,"n_ran":13,"n_constructed":0,"n_ran_checked":7,"n_instrument":6,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":18,"phrase":"13 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; 6 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/benchmarking-vision-language-model-unlearning#ran","syntology_url":"https://syntology.ai/paper/2411.03554","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.03554"}},"official":{"repos":["safolab-wisc/fiubench"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/identify-backdoored-model-in-federated","slug":"identify-backdoored-model-in-federated","title":"Identify Backdoored Model in Federated Learning via Individual Unlearning","date":"2024-11-01","arxiv_id":"2411.01040","repositories_listed":1,"syntology":null},{"url":"/paper/protecting-privacy-in-multimodal-large","slug":"protecting-privacy-in-multimodal-large","title":"Protecting Privacy in Multimodal Large Language Models with MLLMU-Bench","date":"2024-10-29","arxiv_id":"2410.22108","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/protecting-privacy-in-multimodal-large#ran","syntology_url":"https://syntology.ai/paper/2410.22108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.22108"}},"official":{"repos":["franciscoliu/MLLMU-Bench"],"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/clear-character-unlearning-in-textual-and","slug":"clear-character-unlearning-in-textual-and","title":"CLEAR: Character Unlearning in Textual and Visual Modalities","date":"2024-10-23","arxiv_id":"2410.18057","repositories_listed":1,"syntology":null},{"url":"/paper/does-your-llm-truly-unlearn-an-embarrassingly","slug":"does-your-llm-truly-unlearn-an-embarrassingly","title":"Catastrophic Failure of LLM Unlearning via Quantization","date":"2024-10-21","arxiv_id":"2410.16454","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":9,"phrase":"6 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/does-your-llm-truly-unlearn-an-embarrassingly#ran","syntology_url":"https://syntology.ai/paper/2410.16454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.16454"}},"official":{"repos":["zzwjames/failurellmunlearning"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/scalability-of-memorization-based-machine","slug":"scalability-of-memorization-based-machine","title":"Scalability of memorization-based machine unlearning","date":"2024-10-21","arxiv_id":"2410.16516","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-deep-unlearning-in-large-language","slug":"evaluating-deep-unlearning-in-large-language","title":"Evaluating Deep Unlearning in Large Language Models","date":"2024-10-19","arxiv_id":"2410.15153","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":5,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/evaluating-deep-unlearning-in-large-language#ran","syntology_url":"https://syntology.ai/paper/2410.15153","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.15153"}},"official":{"repos":["wrh14/deep_unlearning"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/edge-unlearning-is-not-on-edge-an-adaptive","slug":"edge-unlearning-is-not-on-edge-an-adaptive","title":"Edge Unlearning is Not \"on Edge\"! An Adaptive Exact Unlearning System on Resource-Constrained Devices","date":"2024-10-14","arxiv_id":"2410.10128","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/edge-unlearning-is-not-on-edge-an-adaptive#ran","syntology_url":"https://syntology.ai/paper/2410.10128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.10128"}},"official":{"repos":["xlab-hub/cause"],"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/efficient-federated-unlearning-under","slug":"efficient-federated-unlearning-under","title":"Efficient Federated Unlearning under Plausible Deniability","date":"2024-10-13","arxiv_id":"2410.09947","repositories_listed":1,"syntology":null},{"url":"/paper/muso-achieving-exact-machine-unlearning-in","slug":"muso-achieving-exact-machine-unlearning-in","title":"MUSO: Achieving Exact Machine Unlearning in Over-Parameterized Regimes","date":"2024-10-11","arxiv_id":"2410.08557","repositories_listed":1,"syntology":null},{"url":"/paper/a-closer-look-at-machine-unlearning-for-large","slug":"a-closer-look-at-machine-unlearning-for-large","title":"A Closer Look at Machine Unlearning for Large Language Models","date":"2024-10-10","arxiv_id":"2410.08109","repositories_listed":1,"syntology":{"n":17,"n_ran":12,"n_constructed":0,"n_ran_checked":5,"n_instrument":7,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":17,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 7 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/a-closer-look-at-machine-unlearning-for-large#ran","syntology_url":"https://syntology.ai/paper/2410.08109","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.08109"}},"official":{"repos":["sail-sg/closer-look-llm-unlearning"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/negmerge-consensual-weight-negation-for","slug":"negmerge-consensual-weight-negation-for","title":"NegMerge: Consensual Weight Negation for Strong Machine Unlearning","date":"2024-10-08","arxiv_id":"2410.05583","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":6,"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) · 3 unverified","sample_list":"/paper/negmerge-consensual-weight-negation-for#ran","syntology_url":"https://syntology.ai/paper/2410.05583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.05583"}},"official":{"repos":["naver-ai/negmerge"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/mitigating-memorization-in-language-models","slug":"mitigating-memorization-in-language-models","title":"Mitigating Memorization In Language Models","date":"2024-10-03","arxiv_id":"2410.02159","repositories_listed":1,"syntology":null},{"url":"/paper/dynfrs-an-efficient-framework-for-machine","slug":"dynfrs-an-efficient-framework-for-machine","title":"DynFrs: An Efficient Framework for Machine Unlearning in Random Forest","date":"2024-10-02","arxiv_id":"2410.01588","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/dynfrs-an-efficient-framework-for-machine#ran","syntology_url":"https://syntology.ai/paper/2410.01588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.01588"}},"official":{"repos":["shurongwang/DynFrs"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/an-adversarial-perspective-on-machine","slug":"an-adversarial-perspective-on-machine","title":"An Adversarial Perspective on Machine Unlearning for AI Safety","date":"2024-09-26","arxiv_id":"2409.18025","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/an-adversarial-perspective-on-machine#ran","syntology_url":"https://syntology.ai/paper/2409.18025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.18025"}},"official":{"repos":["ethz-spylab/unlearning-vs-safety"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/distribution-level-feature-distancing-for","slug":"distribution-level-feature-distancing-for","title":"Distribution-Level Feature Distancing for Machine Unlearning: Towards a Better Trade-off Between Model Utility and Forgetting","date":"2024-09-23","arxiv_id":"2409.14747","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/distribution-level-feature-distancing-for#ran","syntology_url":"https://syntology.ai/paper/2409.14747","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.14747"}},"official":{"repos":["Dasol-Choi/DLFD"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/alternate-preference-optimization-for","slug":"alternate-preference-optimization-for","title":"Alternate Preference Optimization for Unlearning Factual Knowledge in Large Language Models","date":"2024-09-20","arxiv_id":"2409.13474","repositories_listed":1,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":9,"phrase":"4 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; 4 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/alternate-preference-optimization-for#ran","syntology_url":"https://syntology.ai/paper/2409.13474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.13474"}},"official":{"repos":["molereddy/Alternate-Preference-Optimization"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/rewind-to-delete-certified-machine-unlearning","slug":"rewind-to-delete-certified-machine-unlearning","title":"Rewind-to-Delete: Certified Machine Unlearning for Nonconvex Functions","date":"2024-09-15","arxiv_id":"2409.09778","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"4 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rewind-to-delete-certified-machine-unlearning#ran","syntology_url":"https://syntology.ai/paper/2409.09778","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.09778"}},"official":{"repos":["anonymous-1234567/r2d"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/llm-defenses-are-not-robust-to-multi-turn","slug":"llm-defenses-are-not-robust-to-multi-turn","title":"LLM Defenses Are Not Robust to Multi-Turn Human Jailbreaks Yet","date":"2024-08-27","arxiv_id":"2408.15221","repositories_listed":1,"syntology":null},{"url":"/paper/cure4rec-a-benchmark-for-recommendation","slug":"cure4rec-a-benchmark-for-recommendation","title":"CURE4Rec: A Benchmark for Recommendation Unlearning with Deeper Influence","date":"2024-08-26","arxiv_id":"2408.14393","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"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) · 1 unverified","sample_list":"/paper/cure4rec-a-benchmark-for-recommendation#ran","syntology_url":"https://syntology.ai/paper/2408.14393","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.14393"}},"official":{"repos":["xiye7lai/cure4rec"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-robust-and-cost-efficient-knowledge","slug":"towards-robust-and-cost-efficient-knowledge","title":"Towards Robust and Parameter-Efficient Knowledge Unlearning for LLMs","date":"2024-08-13","arxiv_id":"2408.06621","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-robust-and-cost-efficient-knowledge#ran","syntology_url":"https://syntology.ai/paper/2408.06621","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.06621"}},"official":{"repos":["csm9493/efficient-llm-unlearning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/preserving-privacy-in-large-language-models-a","slug":"preserving-privacy-in-large-language-models-a","title":"Preserving Privacy in Large Language Models: A Survey on Current Threats and Solutions","date":"2024-08-10","arxiv_id":"2408.05212","repositories_listed":1,"syntology":null},{"url":"/paper/neural-machine-unranking","slug":"neural-machine-unranking","title":"Neural Machine Unranking","date":"2024-08-09","arxiv_id":"2408.05330","repositories_listed":1,"syntology":null},{"url":"/paper/2408-00920","slug":"2408-00920","title":"Towards Certified Unlearning for Deep Neural Networks","date":"2024-08-01","arxiv_id":"2408.00920","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/2408-00920#ran","syntology_url":"https://syntology.ai/paper/2408.00920","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.00920"}},"official":{"repos":["zhangbinchi/certified-deep-unlearning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/2408-00929","slug":"2408-00929","title":"Verification of Machine Unlearning is Fragile","date":"2024-08-01","arxiv_id":"2408.00929","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/2408-00929#ran","syntology_url":"https://syntology.ai/paper/2408.00929","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.00929"}},"official":{"repos":["zhangbinchi/unlearning-verification-is-fragile"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/machine-unlearning-in-generative-ai-a-survey","slug":"machine-unlearning-in-generative-ai-a-survey","title":"Machine Unlearning in Generative AI: A Survey","date":"2024-07-30","arxiv_id":"2407.20516","repositories_listed":1,"syntology":null},{"url":"/paper/one-shot-unlearning-of-personal-identities","slug":"one-shot-unlearning-of-personal-identities","title":"One-Shot Unlearning of Personal Identities","date":"2024-07-16","arxiv_id":"2407.12069","repositories_listed":1,"syntology":null},{"url":"/paper/single-layer-single-gradient-unlearning","slug":"single-layer-single-gradient-unlearning","title":"Unlearning Targeted Information via Single Layer Unlearning Gradient","date":"2024-07-16","arxiv_id":"2407.11867","repositories_listed":1,"syntology":{"n":24,"n_ran":16,"n_constructed":0,"n_ran_checked":10,"n_instrument":6,"n_unverified":8,"n_honours":1,"n_violates":4,"n_no_contract":5,"n_pointer_only":24,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 4 violated, 5 with no contract checked; 6 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/single-layer-single-gradient-unlearning#ran","syntology_url":"https://syntology.ai/paper/2407.11867","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.11867"}},"official":{"repos":["CSIPlab/slug"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-refuse-towards-mitigating-privacy","slug":"learning-to-refuse-towards-mitigating-privacy","title":"Learning to Refuse: Towards Mitigating Privacy Risks in LLMs","date":"2024-07-14","arxiv_id":"2407.10058","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"6 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-refuse-towards-mitigating-privacy#ran","syntology_url":"https://syntology.ai/paper/2407.10058","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.10058"}},"official":{"repos":["zhliu0106/learning-to-refuse"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/practical-unlearning-for-large-language","slug":"practical-unlearning-for-large-language","title":"On Large Language Model Continual Unlearning","date":"2024-07-14","arxiv_id":"2407.10223","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":4,"n_instrument":8,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":13,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 8 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/practical-unlearning-for-large-language#ran","syntology_url":"https://syntology.ai/paper/2407.10223","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.10223"}},"official":{"repos":["gcyzsl/o3-llm-unlearning"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/zero-shot-class-unlearning-in-clip-with","slug":"zero-shot-class-unlearning-in-clip-with","title":"Zero-Shot Class Unlearning in CLIP with Synthetic Samples","date":"2024-07-10","arxiv_id":"2407.07485","repositories_listed":1,"syntology":null},{"url":"/paper/composable-interventions-for-language-models","slug":"composable-interventions-for-language-models","title":"Composable Interventions for Language Models","date":"2024-07-09","arxiv_id":"2407.06483","repositories_listed":1,"syntology":{"n":17,"n_ran":8,"n_constructed":0,"n_ran_checked":3,"n_instrument":5,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":17,"phrase":"8 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; 5 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/composable-interventions-for-language-models#ran","syntology_url":"https://syntology.ai/paper/2407.06483","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.06483"}},"official":{"repos":["hartvigsen-group/composable-interventions"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/machine-unlearning-fails-to-remove-data","slug":"machine-unlearning-fails-to-remove-data","title":"Machine Unlearning Fails to Remove Data Poisoning Attacks","date":"2024-06-25","arxiv_id":"2406.17216","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/machine-unlearning-fails-to-remove-data#ran","syntology_url":"https://syntology.ai/paper/2406.17216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17216"}},"official":{"repos":["martinpawel/openunlearn"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/blind-baselines-beat-membership-inference","slug":"blind-baselines-beat-membership-inference","title":"Blind Baselines Beat Membership Inference Attacks for Foundation Models","date":"2024-06-23","arxiv_id":"2406.16201","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":3,"n_honours":2,"n_violates":1,"n_no_contract":2,"n_pointer_only":11,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 1 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/blind-baselines-beat-membership-inference#ran","syntology_url":"https://syntology.ai/paper/2406.16201","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.16201"}},"official":{"repos":["ethz-spylab/Blind-MIA"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/mu-bench-a-multitask-multimodal-benchmark-for","slug":"mu-bench-a-multitask-multimodal-benchmark-for","title":"MU-Bench: A Multitask Multimodal Benchmark for Machine Unlearning","date":"2024-06-21","arxiv_id":"2406.14796","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mu-bench-a-multitask-multimodal-benchmark-for#ran","syntology_url":"https://syntology.ai/paper/2406.14796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14796"}},"official":{"repos":["clu-uml/mu-bench"],"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/jogging-the-memory-of-unlearned-model-through","slug":"jogging-the-memory-of-unlearned-model-through","title":"Jogging the Memory of Unlearned LLMs Through Targeted Relearning Attacks","date":"2024-06-19","arxiv_id":"2406.13356","repositories_listed":1,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":6,"n_instrument":7,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"13 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; 7 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/jogging-the-memory-of-unlearned-model-through#ran","syntology_url":"https://syntology.ai/paper/2406.13356","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.13356"}},"official":{"repos":["s-huu/jog_llm_memory"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/cross-lingual-unlearning-of-selective","slug":"cross-lingual-unlearning-of-selective","title":"Cross-Lingual Unlearning of Selective Knowledge in Multilingual Language Models","date":"2024-06-18","arxiv_id":"2406.12354","repositories_listed":1,"syntology":null},{"url":"/paper/soft-prompting-for-unlearning-in-large","slug":"soft-prompting-for-unlearning-in-large","title":"Soft Prompting for Unlearning in Large Language Models","date":"2024-06-17","arxiv_id":"2406.12038","repositories_listed":1,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":8,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/soft-prompting-for-unlearning-in-large#ran","syntology_url":"https://syntology.ai/paper/2406.12038","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12038"}},"official":{"repos":["karuna-bhaila/llm_unlearning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/avoiding-copyright-infringement-via-machine","slug":"avoiding-copyright-infringement-via-machine","title":"Avoiding Copyright Infringement via Large Language Model Unlearning","date":"2024-06-16","arxiv_id":"2406.10952","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/avoiding-copyright-infringement-via-machine#ran","syntology_url":"https://syntology.ai/paper/2406.10952","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10952"}},"official":{"repos":["guangyaodou/SSU_Unlearn"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rwku-benchmarking-real-world-knowledge","slug":"rwku-benchmarking-real-world-knowledge","title":"RWKU: Benchmarking Real-World Knowledge Unlearning for Large Language Models","date":"2024-06-16","arxiv_id":"2406.10890","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/rwku-benchmarking-real-world-knowledge#ran","syntology_url":"https://syntology.ai/paper/2406.10890","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10890"}},"official":{"repos":["jinzhuoran/rwku"],"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/towards-efficient-target-level-machine","slug":"towards-efficient-target-level-machine","title":"Towards Efficient Target-Level Machine Unlearning Based on Essential Graph","date":"2024-06-16","arxiv_id":"2406.10954","repositories_listed":1,"syntology":null}],"syntology_records":51,"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"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":89,"papers_where_code_ran_first_page":"/task/machine-unlearning/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":5,"url":"/task/machine-unlearning/papers/2","json":"/task/machine-unlearning/papers/2.json","rows":100},{"order":"archive","page":3,"of":5,"url":"/task/machine-unlearning/papers/3","json":"/task/machine-unlearning/papers/3.json","rows":100},{"order":"archive","page":4,"of":5,"url":"/task/machine-unlearning/papers/4","json":"/task/machine-unlearning/papers/4.json","rows":100},{"order":"archive","page":5,"of":5,"url":"/task/machine-unlearning/papers/5","json":"/task/machine-unlearning/papers/5.json","rows":38},{"order":"ran","page":1,"of":1,"url":"/task/machine-unlearning/papers/ran/1","json":"/task/machine-unlearning/papers/ran/1.json","rows":89}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"5ba70c46c99ab191f8d0ab48f5f799b65ed0491991a8def95bb838e2d7571aa3","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}