Return
MOEA-SISA: Multiobjective Optimization to Improve Model Performance During Forgetting Data
C
W
C
L
L
DOI:10.23919/cje.2024.00.052.png)
Abstract
En 中文
With the proliferation of shared personal data online, users encounter difficulties in revoking data access permissions and requesting data deletions, thus increasing the risk of privacy breaches. Machine unlearning offers a solution and is useful for sensing-computing integrated chips and systems, but the state-of-the-art shard-ed, isolated, sliced, and aggregated (SISA) method produces models with high complexity and limited generalization ability. This study proposes a novel framework, named multiobjective evolutionary algorithm-SISA (MOEA-SISA), which integrates feature decomposition-based differential grouping (FDbDG) to improve optimization efficiency through dynamic grouping of decision variables. Three optimization objectives can hence be proposed: model accuracy, model complexity, and generalization ability. By optimizing these three objectives, the trained model becomes closer to the retrained results while preventing excessive forgetting. Experimental models including ViT, VGG-16, and ResNet-50 are used for sub-class forgetting tasks. Compared with various state-of-the-art methods, MOEA-SISA offers advantages across these models, especially in terms of model complexity and generalization ability. Tests against membership inference attacks demonstrate that MOEA-SISA effectively retains accuracy and enhances the generalization ability in sub-class forgetting scenarios. Additionally, the proposed approach offers significant advantages for improving the efficiency and performance of sensing-computing integrated chips and systems.
Keywords:
Recommender systems
Information filtering
Electronic mail
Internet of Things
Storage area networks
Protocols
Communication systems
Internet
Computer networks
Vehicular ad hoc networks
Machine unlearning
Sharded
isolated
sliced
and aggregated (SISA)
Forgetting
Multiobjective evolution
Multiobjective problems
Journal
C
IF:
3
Papers:
62
Citations:
1.7K
