arXiv

PURGE: Projected Unlearning via Retain-Guided Erasure

Title: PURGE: Projected Unlearning via Retain-Guided Erasure

Abstract: This paper introduces PURGE, a machine unlearning (MU) method grounded in the premise that continual learning (CL) and MU are essentially dual problems sharing a core tension in opposing directions. While CL aims to acquire new knowledge without discarding previous learning, MU seeks to excise specific data points while preserving performance on remaining data. PURGE capitalizes on this relationship by modifying the gradient projection technique from A-GEM (Chaudhry et al., 2019) to ensure that each unlearning step does not elevate the loss associated with the retained dataset. Beyond this constraint, the algorithm implements multi-layer representation erasure, which drives the activations of the forget-set in intermediate layers toward the distribution of the retain-set. This approach removes information from hidden representations entirely, rather than merely suppressing it at the output stage. A critical innovation in PURGE’s design is the retain-confusion target. Instead of forcing forget-set outputs toward a uniform distribution—a strategy we discovered is surprisingly vulnerable to membership inference attacks (MIA)—the method targets the model’s inherent confusion patterns when processing retain data. Consequently, the resulting unlearned model becomes difficult to differentiate from one trained from scratch. The algorithm employs two self-regulating termination conditions, specifically a retain-loss budget and a forget-accuracy target, which automatically determine when the process should conclude, thereby eliminating the need for manual epoch adjustments. Evaluated across 22 class-level forgetting tasks on five datasets (CIFAR-10, MNIST, SVHN, STL10, and PathMNIST), PURGE consistently maintains retain accuracy above 96% while achieving MIA AUROC scores near 0.5, considered the ideal outcome. These results demonstrate superior performance on the privacy-utility frontier compared to gradient ascent, KL-uniform, and several existing baselines.


Source: arXiv Generated at: 2026-06-03 00:00:00 UTC

Related Articles

TikTok Billionaire Tops Ambani as Asia’s Second-Richest
Bloomberg

TikTok Billionaire Tops Ambani as Asia’s Second-Richest

TikTok founder surpasses Mukesh Ambani to become Asia’s second-richest person, marking a significant shift in the region...

Publishers in UK can opt out of Google AI search results
BBC News

Publishers in UK can opt out of Google AI search results

UK publishers can now opt out of Google’s AI search summaries, a CMA ruling designed to boost their bargaining power and...

Kioxia Edges Nearer Toyota’s Market Cap in Shakeup to Japan Inc.
Bloomberg

Kioxia Edges Nearer Toyota’s Market Cap in Shakeup to Japan Inc.

Kioxia’s market cap nears Toyota’s, signaling a major shift in Japan’s corporate hierarchy. This narrowing gap highlight...

Reuters

Morning Bid: Marvell, a fitting name for the latest AI darling

Reuters highlights Marvell as a top AI stock, noting its name perfectly suits its status as the newest market darling.

Financial Times

Tim Hayward: I built the Jaguar E-Type of computer keyboards

Tim Hayward compares his bespoke keyboard designs to the Jaguar E-Type. He explores high-end customization for personal ...

Financial Times

AI Labs: Zuckerberg’s $100bn gamble

Meta’s $100 billion AI investment aims to secure AI dominance, but questions remain whether sheer spending can outpace c...