{"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/5","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":5,"pages_in_order":5,"rows_per_page":100,"rows":[401,438],"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/papers/4","next":null,"papers":[{"url":null,"slug":"get-rid-of-your-trail-remotely-erasing","title":"Get Rid Of Your Trail: Remotely Erasing Backdoors in Federated Learning","date":"2023-04-20","arxiv_id":"2304.10638","repositories_listed":0,"syntology":null},{"url":null,"slug":"unfolded-self-reconstruction-lsh-towards","title":"Unfolded Self-Reconstruction LSH: Towards Machine Unlearning in Approximate Nearest Neighbour Search","date":"2023-04-05","arxiv_id":"2304.02350","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-class-explainable-unlearning-for-image","title":"Multi-Class Unlearning for Image Classification via Weight Filtering","date":"2023-04-04","arxiv_id":"2304.02049","repositories_listed":0,"syntology":null},{"url":null,"slug":"boundary-unlearning","title":"Boundary Unlearning","date":"2023-03-21","arxiv_id":"2303.11570","repositories_listed":0,"syntology":null},{"url":null,"slug":"netflix-and-forget-efficient-and-exact","title":"Netflix and Forget: Efficient and Exact Machine Unlearning from Bi-linear Recommendations","date":"2023-02-13","arxiv_id":"2302.06676","repositories_listed":0,"syntology":null},{"url":null,"slug":"to-be-forgotten-or-to-be-fair-unveiling","title":"To Be Forgotten or To Be Fair: Unveiling Fairness Implications of Machine Unlearning Methods","date":"2023-02-07","arxiv_id":"2302.03350","repositories_listed":0,"syntology":null},{"url":null,"slug":"boundary-unlearning-rapid-forgetting-of-deep","title":"Boundary Unlearning: Rapid Forgetting of Deep Networks via Shifting the Decision Boundary","date":"2023-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"muter-machine-unlearning-on-adversarially","title":"MUter: Machine Unlearning on Adversarially Trained Models","date":"2023-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"policycleanse-backdoor-detection-and","title":"PolicyCleanse: Backdoor Detection and Mitigation for Competitive Reinforcement Learning","date":"2023-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"privacy-adhering-machine-un-learning-in-nlp","title":"Privacy Adhering Machine Un-learning in NLP","date":"2022-12-19","arxiv_id":"2212.09573","repositories_listed":0,"syntology":null},{"url":null,"slug":"pre-trained-encoders-in-self-supervised","title":"Pre-trained Encoders in Self-Supervised Learning Improve Secure and Privacy-preserving Supervised Learning","date":"2022-12-06","arxiv_id":"2212.03334","repositories_listed":0,"syntology":null},{"url":null,"slug":"legonet-a-fast-and-exact-unlearning","title":"LegoNet: A Fast and Exact Unlearning Architecture","date":"2022-10-28","arxiv_id":"2210.16023","repositories_listed":0,"syntology":null},{"url":null,"slug":"forget-unlearning-towards-true-data-deletion","title":"Forget Unlearning: Towards True Data-Deletion in Machine Learning","date":"2022-10-17","arxiv_id":"2210.08911","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-unlearning-method-based-on-projection","title":"Machine Unlearning Method Based On Projection Residual","date":"2022-09-30","arxiv_id":"2209.15276","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-introduction-to-machine-unlearning","title":"An Introduction to Machine Unlearning","date":"2022-09-02","arxiv_id":"2209.00939","repositories_listed":0,"syntology":null},{"url":null,"slug":"forgetting-fast-in-recommender-systems","title":"Forgetting Fast in Recommender Systems","date":"2022-08-14","arxiv_id":"2208.06875","repositories_listed":0,"syntology":null},{"url":null,"slug":"challenges-and-pitfalls-of-bayesian","title":"Challenges and Pitfalls of Bayesian Unlearning","date":"2022-07-07","arxiv_id":"2207.03227","repositories_listed":0,"syntology":null},{"url":null,"slug":"few-shot-unlearning-by-model-inversion","title":"Few-Shot Unlearning by Model Inversion","date":"2022-05-31","arxiv_id":"2205.15567","repositories_listed":0,"syntology":null},{"url":null,"slug":"making-recommender-systems-forget-learning","title":"Making Recommender Systems Forget: Learning and Unlearning for Erasable Recommendation","date":"2022-03-22","arxiv_id":"2203.11491","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-right-to-be-forgotten-in-federated","title":"The Right to be Forgotten in Federated Learning: An Efficient Realization with Rapid Retraining","date":"2022-03-14","arxiv_id":"2203.07320","repositories_listed":0,"syntology":null},{"url":null,"slug":"markov-chain-monte-carlo-based-machine","title":"Markov Chain Monte Carlo-Based Machine Unlearning: Unlearning What Needs to be Forgotten","date":"2022-02-28","arxiv_id":"2202.13585","repositories_listed":0,"syntology":null},{"url":null,"slug":"vertical-machine-unlearning-selectively","title":"Efficient Attribute Unlearning: Towards Selective Removal of Input Attributes from Feature Representations","date":"2022-02-27","arxiv_id":"2202.13295","repositories_listed":0,"syntology":null},{"url":null,"slug":"bounding-membership-inference-1","title":"Bounding Membership Inference","date":"2022-02-24","arxiv_id":"2202.12232","repositories_listed":0,"syntology":null},{"url":null,"slug":"backdoor-detection-in-reinforcement-learning","title":"PolicyCleanse: Backdoor Detection and Mitigation in Reinforcement Learning","date":"2022-02-08","arxiv_id":"2202.03609","repositories_listed":0,"syntology":null},{"url":null,"slug":"deletion-inference-reconstruction-and","title":"Deletion Inference, Reconstruction, and Compliance in Machine (Un)Learning","date":"2022-02-07","arxiv_id":"2202.03460","repositories_listed":0,"syntology":null},{"url":null,"slug":"backdoor-defense-with-machine-unlearning","title":"Backdoor Defense with Machine Unlearning","date":"2022-01-24","arxiv_id":"2201.09538","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-unlearning-learning-polluting-and","title":"An Investigation on Learning, Polluting, and Unlearning the Spam Emails for Lifelong Learning","date":"2021-11-26","arxiv_id":"2111.14609","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-unlearning-via-gan","title":"Machine unlearning via GAN","date":"2021-11-22","arxiv_id":"2111.11869","repositories_listed":0,"syntology":null},{"url":null,"slug":"lightweight-machine-unlearning-in-neural","title":"Lightweight machine unlearning in neural network","date":"2021-11-10","arxiv_id":"2111.05528","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-necessity-of-auditable-algorithmic","title":"On the Necessity of Auditable Algorithmic Definitions for Machine Unlearning","date":"2021-10-22","arxiv_id":"2110.11891","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-zest-of-lime-towards-architecture","title":"A Zest of LIME: Towards Architecture-Independent Model Distances","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-pac-bayesian-framework-for-machine","title":"A unified PAC-Bayesian framework for machine unlearning via information risk minimization","date":"2021-06-01","arxiv_id":"2106.00265","repositories_listed":0,"syntology":null},{"url":null,"slug":"deepobliviate-a-powerful-charm-for-erasing","title":"DeepObliviate: A Powerful Charm for Erasing Data Residual Memory in Deep Neural Networks","date":"2021-05-13","arxiv_id":"2105.06209","repositories_listed":0,"syntology":null},{"url":null,"slug":"remember-what-you-want-to-forget-algorithms","title":"Remember What You Want to Forget: Algorithms for Machine Unlearning","date":"2021-03-04","arxiv_id":"2103.03279","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-unlearning-via-algorithmic-stability","title":"Machine Unlearning via Algorithmic Stability","date":"2021-02-25","arxiv_id":"2102.13179","repositories_listed":0,"syntology":null},{"url":null,"slug":"coded-machine-unlearning","title":"Coded Machine Unlearning","date":"2020-12-31","arxiv_id":"2012.15721","repositories_listed":0,"syntology":null},{"url":null,"slug":"learn-to-forget-user-level-memorization","title":"Learn to Forget: Machine Unlearning via Neuron Masking","date":"2020-03-24","arxiv_id":"2003.10933","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-unlearning-linear-filtration-for","title":"Machine Unlearning: Linear Filtration for Logit-based Classifiers","date":"2020-02-07","arxiv_id":"2002.02730","repositories_listed":0,"syntology":null}],"record_sha256":"42700b0b9c5b9817840db3d19211c1a953fa82e2f64b6164d80049ccce570196","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}