Towards Unbounded Machine Unlearning
Deep machine unlearning is the problem of `removing' from a trained neural network a subset of its training set. This problem is very timely and has many applications, including the key tasks of removing biases (RB), resolving confusion (RC) (caused by mislabelled data in trained models), as we...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Journal Article |
Language: | English |
Published: |
20-02-2023
|
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Abstract | Deep machine unlearning is the problem of `removing' from a trained neural
network a subset of its training set. This problem is very timely and has many
applications, including the key tasks of removing biases (RB), resolving
confusion (RC) (caused by mislabelled data in trained models), as well as
allowing users to exercise their `right to be forgotten' to protect User
Privacy (UP). This paper is the first, to our knowledge, to study unlearning
for different applications (RB, RC, UP), with the view that each has its own
desiderata, definitions for `forgetting' and associated metrics for forget
quality. For UP, we propose a novel adaptation of a strong Membership Inference
Attack for unlearning. We also propose SCRUB, a novel unlearning algorithm,
which is the only method that is consistently a top performer for forget
quality across the different application-dependent metrics for RB, RC, and UP.
At the same time, SCRUB is also consistently a top performer on metrics that
measure model utility (i.e. accuracy on retained data and generalization), and
is more efficient than previous work. The above are substantiated through a
comprehensive empirical evaluation against previous state-of-the-art. |
---|---|
AbstractList | Deep machine unlearning is the problem of `removing' from a trained neural
network a subset of its training set. This problem is very timely and has many
applications, including the key tasks of removing biases (RB), resolving
confusion (RC) (caused by mislabelled data in trained models), as well as
allowing users to exercise their `right to be forgotten' to protect User
Privacy (UP). This paper is the first, to our knowledge, to study unlearning
for different applications (RB, RC, UP), with the view that each has its own
desiderata, definitions for `forgetting' and associated metrics for forget
quality. For UP, we propose a novel adaptation of a strong Membership Inference
Attack for unlearning. We also propose SCRUB, a novel unlearning algorithm,
which is the only method that is consistently a top performer for forget
quality across the different application-dependent metrics for RB, RC, and UP.
At the same time, SCRUB is also consistently a top performer on metrics that
measure model utility (i.e. accuracy on retained data and generalization), and
is more efficient than previous work. The above are substantiated through a
comprehensive empirical evaluation against previous state-of-the-art. |
Author | Triantafillou, Peter Hayes, Jamie Kurmanji, Meghdad Triantafillou, Eleni |
Author_xml | – sequence: 1 givenname: Meghdad surname: Kurmanji fullname: Kurmanji, Meghdad – sequence: 2 givenname: Peter surname: Triantafillou fullname: Triantafillou, Peter – sequence: 3 givenname: Jamie surname: Hayes fullname: Hayes, Jamie – sequence: 4 givenname: Eleni surname: Triantafillou fullname: Triantafillou, Eleni |
BackLink | https://doi.org/10.48550/arXiv.2302.09880$$DView paper in arXiv |
BookMark | eNotzrkOwjAQRVEXULB9ABUUtAmTOE7sEiE2CUQT6mjsjCESOMiI7e9Zqyfd4um0WcPVjhjrRxAmUggYo39UtzDmEIegpIQWG-X1HX15Ge6crq-upHK4QXOoHL3LkdC7yu27rGnxeKHefzssn8_y6TJYbxer6WQdYJpBIECkQkmyGiSB4ZJUBIgQR-8WW60yIyJjUg1CGgulstxmyMFgkmiUxDts8Lv9Mouzr07on8WHW3y5_AU2ATui |
ContentType | Journal Article |
Copyright | http://arxiv.org/licenses/nonexclusive-distrib/1.0 |
Copyright_xml | – notice: http://arxiv.org/licenses/nonexclusive-distrib/1.0 |
DBID | AKY GOX |
DOI | 10.48550/arxiv.2302.09880 |
DatabaseName | arXiv Computer Science arXiv.org |
DatabaseTitleList | |
Database_xml | – sequence: 1 dbid: GOX name: arXiv.org url: http://arxiv.org/find sourceTypes: Open Access Repository |
DeliveryMethod | fulltext_linktorsrc |
ExternalDocumentID | 2302_09880 |
GroupedDBID | AKY GOX |
ID | FETCH-LOGICAL-a670-5056598efb08e0c38e910aa0218ef2fb97c51cc6b058cf0d9f3f7a30ca44ba8e3 |
IEDL.DBID | GOX |
IngestDate | Mon Jan 08 05:40:46 EST 2024 |
IsDoiOpenAccess | true |
IsOpenAccess | true |
IsPeerReviewed | false |
IsScholarly | false |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-a670-5056598efb08e0c38e910aa0218ef2fb97c51cc6b058cf0d9f3f7a30ca44ba8e3 |
OpenAccessLink | https://arxiv.org/abs/2302.09880 |
ParticipantIDs | arxiv_primary_2302_09880 |
PublicationCentury | 2000 |
PublicationDate | 2023-02-20 |
PublicationDateYYYYMMDD | 2023-02-20 |
PublicationDate_xml | – month: 02 year: 2023 text: 2023-02-20 day: 20 |
PublicationDecade | 2020 |
PublicationYear | 2023 |
Score | 1.8740244 |
SecondaryResourceType | preprint |
Snippet | Deep machine unlearning is the problem of `removing' from a trained neural
network a subset of its training set. This problem is very timely and has many... |
SourceID | arxiv |
SourceType | Open Access Repository |
SubjectTerms | Computer Science - Cryptography and Security Computer Science - Learning |
Title | Towards Unbounded Machine Unlearning |
URI | https://arxiv.org/abs/2302.09880 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://sdu.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwdV09T8MwED2RTiwIBKh8KkNXg5PYiT0iaOkCDASpW3S2z4ilQg1F_HxsJwgW1rNl6fyheyffvQcwIy7RukYwK51kwjvHTGFDzmO0tl44V1NMFJfPzeNK3c0jTU7-0wuDm6-3z4Ef2PTXAR-XV1yHO5ZBVpaxZOv-aTV8TiYqrnH-77yAMZPpT5BY7MPeiO7ym-E4DmCH1ocwa1Npap-_rE0UMSKXP6QSRgqWUbXh9Qjaxby9XbJRnIBh3XAWgYPUirzhiritFIW4ixgjJvnSG91YWVhbGy6V9dxpX_kGK25RCIOKqmOYhPyeppCjKeqaGylVaYQmjeGJoQqrC1SFVM0JTJNL3fvAP9FFb7vk7en_Q2ewG5XRU_c1P4fJx2ZLF5D1bnuZNvEbpr1vlQ |
link.rule.ids | 228,230,782,887 |
linkProvider | Cornell University |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Towards+Unbounded+Machine+Unlearning&rft.au=Kurmanji%2C+Meghdad&rft.au=Triantafillou%2C+Peter&rft.au=Hayes%2C+Jamie&rft.au=Triantafillou%2C+Eleni&rft.date=2023-02-20&rft_id=info:doi/10.48550%2Farxiv.2302.09880&rft.externalDocID=2302_09880 |