UnAct: Gradient-Free Unlearning via Targeted Activation Intervention
cs.LG, cs.CV
Submitted: 2026-10-03
Updated: 2026-10-03
Code: https://github.com/abdulmuizz0903/UnAct
License: http://creativecommons.org/licenses/by/4.0/
The gist: Machine unlearning seeks to remove the influence of designated training data from a trained model without retraining from scratch.
Abstract
Machine unlearning seeks to remove the influence of designated training data from a trained model without retraining from scratch. Retrain-free methods such as Selective Synaptic Dampening (SSD) and its label-free variant LFSSD avoid full retraining but still require backpropagation and parameter importance computed over the entire dataset. We ask: what happens when a deletion request arrives with only a few images of the class to be forgotten? To answer this question, we introduce UnAct, a gradient-free class-unlearning method that needs only forward passes over the forget images. UnAct scores late-layer units by their responses, attenuates the most responsive connections, and repeats this for up to 20 rounds using no gradients, no labels, and no retained data. On ResNet-18 trained with CIFAR-10, CIFAR-20, and CIFAR-100, UnAct is competitive with SSD and LFSSD when forgetting entire classes and, unlike them, never collapses the network when forget data is scarce. On ResNet-18, across all tested sizes, UnAct's retain accuracy stays within 2.5 points of retraining, while SSD and LFSSD, at their full-class operating points, lose up to 86 points on some classes. With five forget images on CIFAR-10, UnAct's distance to retraining is 0.21 points, against 67 for LFSSD and 90 for SSD, and re-selecting SSD's threshold at each size with an oracle does not close the gap. In preliminary transfer to ViT-B/16, UnAct's distance to retraining is 11.5 against 33.7 for SSD, and a request is 19x faster than SSD when SSD computes its importance at request time. The code is available at https://github.com/abdulmuizz0903/UnAct
Sources
- Zero-shot Class Unlearning via Layer-wise Relevance Analysis and Neuronal Path Perturbation
- An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale
- An Information Theoretic Approach to Machine Unlearning
- Loss-Free Machine Unlearning
- Inexact Unlearning Needs More Careful Evaluations to Avoid a False Sense of Privacy
- Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architectures
- Unified Gradient-Based Machine Unlearning with Remain Geometry Enhancement
- Model Sparsity Can Simplify Machine Unlearning
- Pruning Filters for Efficient ConvNets
- Eight Methods to Evaluate Robust Unlearning in LLMs
- Pruning Convolutional Neural Networks for Resource Efficient Inference
- Dissecting Language Models: Machine Unlearning via Selective Pruning
- Parameter-tuning-free data entry error unlearning with adaptive selective synaptic dampening
- Few-Shot Unlearning by Model Inversion
- What makes unlearning hard and what to do about it
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks