PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
April 2, 20240 citationsOpen Access

Efficient Online Unlearning via Hessian-Free Recollection of Individual Data Statistics

View Full Paper
XQXinbao QiaoMZMeng ZhangMTMing Tang

Key Points

Key points are not available for this paper at this time.

Abstract

Machine unlearning strives to uphold the data owners' right to be forgotten by enabling models to selectively forget specific data. Recent methods suggest that one approach of data forgetting is by precomputing and storing statistics carrying second-order information to improve computational and memory efficiency. However, they rely on restrictive assumptions and the computation/storage suffer from the curse of model parameter dimensionality, making it challenging to apply to most deep neural networks. In this work, we propose a Hessian-free online unlearning method. We propose to maintain a statistical vector for each data point, computed through affine stochastic recursion approximation of the difference between retrained and learned models. Our proposed algorithm achieves near-instantaneous online unlearning as it only requires a vector addition operation. Based on the strategy that recollecting statistics for forgetting data, the proposed method significantly reduces the unlearning runtime. Experimental studies demonstrate that the proposed scheme surpasses existing results by orders of magnitude in terms of time and memory costs, while also enhancing accuracy.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Qiao et al. (2024) studied this question.

synapsesocial.com/papers/68e70c60b6db643587686622https://doi.org/10.48550/arxiv.2404.01712
Ask AI
Helpful
Bookmark
Share
View Full Paper