paper-with-me

Papers

Efficient Knowledge Deletion from Trained Models through Layer-wise Partial Machine Unlearning

2024-03-12 · Vinay Chakravarthi Gogineni, Esmaeil S. Nadimi

Machine unlearning has garnered significant attention due to its ability to selectively erase knowledge obtained from specific training data samples in an already trained machine learning model. This capability enables data holders to adhere strictly to data protection regulations. However, existing unlearning techniques face practical constraints, often causing performance degradation, demanding brief fine-tuning post unlearning, and requiring significant storage. In response, this paper introduces a novel class of machine unlearning algorithms. First method is partial amnesiac unlearning, integration of layer-wise pruning with amnesiac unlearning. In this method, updates made to the model during training are pruned and stored, subsequently used to forget specific data from trained model. The second method assimilates layer-wise partial-updates into label-flipping and optimization-based unlearning to mitigate the adverse effects of data deletion on model efficacy. Through a detailed experimental evaluation, we showcase the effectiveness of proposed unlearning methods. Experimental results highlight that the partial amnesiac unlearning not only preserves model efficacy but also eliminates the necessity for brief post fine-tuning, unlike conventional amnesiac unlearning. Moreover, employing layer-wise partial updates in label-flipping and optimization-based unlearning techniques demonstrates superiority in preserving model efficacy compared to their naive counterparts.

📄 PDF Abstract BibTeX arXiv:2403.07611

Code (0)

등록된 구현이 없습니다.

Tasks

Machine Unlearning

Methods 이 논문이 사용한 방법론

Pruning 설명 없음

Similar Papers 제목 키워드 기반

Statistical Roughness-Informed Machine Unlearning

2026-02-10 · Mohammad Partohaghighi, Roummel Marcia, Bruce J. West, YangQuan Chen arxiv

Machine unlearning aims to remove the influence of a designated forget set from a trained model while preserving utility on the retained data. In modern deep networks, approximate unlearning frequently fails under large …

Fast Causal Inference with Non-Random Missingness by Test-Wise Deletion

2017-05-25 · Eric V. Strobl, Shyam Visweswaran, Peter L. Spirtes

Many real datasets contain values missing not at random (MNAR). In this scenario, investigators often perform list-wise deletion, or delete samples with any missing values, before applying causal discovery algorithms. Li…

Causal DiscoveryCausal InferenceImputationMissing Values

The Curse of Popularity: Popular Entities have Catastrophic Side Effects when Deleting Knowledge from Language Models

2024-06-10 · Ryosuke Takahashi, Go Kamoda, Benjamin Heinzerling, Keisuke Sakaguchi 외

Language models (LMs) encode world knowledge in their internal parameters through training. However, LMs may learn personal and confidential information from the training data, leading to privacy concerns such as data le…

Knowledge GraphsWorld Knowledge

GNNDelete: A General Strategy for Unlearning in Graph Neural Networks

2023-02-26 · Jiali Cheng, George Dasoulas, Huan He, Chirag Agarwal 외

Graph unlearning, which involves deleting graph elements such as nodes, node labels, and relationships from a trained graph neural network (GNN) model, is crucial for real-world applications where data elements may becom…

Graph Neural Network

Multiple imputation and test-wise deletion for causal discovery with incomplete cohort data

2021-08-30 · Janine Witte, Ronja Foraita, Vanessa Didelez

Causal discovery algorithms estimate causal graphs from observational data. This can provide a valuable complement to analyses focussing on the causal relation between individual treatment-outcome pairs. Constraint-based…

Causal DiscoveryImputationMissing Values