Unmerge: Efficient Machine Unlearning via Task Arithmetic
Quick summary
arXiv:2609.38895v1 Announce Type: cross Abstract: Approximate machine unlearning seeks to remove the influence of a forget set from a trained model without full retraining. Existing gradient-based methods require data-dependent hyperparameter search, struggle when forget and retain knowledge are entangled, and offer little insight into where unlearning actually happens inside the network. We recast unlearning through the lens of task arithmetic: if finetuning produces a merged task vector $\tau_m$ that combines learning on forget and retain sets, unlearning is the inverse operation that subtra
Key takeaways
- arXiv:2609.38895v1 Announce Type: cross Abstract: Approximate machine unlearning seeks to remove the influence of a forget set from a trained model without full retraining.
- Existing gradient-based methods require data-dependent hyperparameter search, struggle when forget and retain knowledge are entangled, and offer little insight into where unlearning actually happens inside the network.
- We recast unlearning through the lens of task arithmetic: if finetuning produces a merged task vector $\tau_m$ that combines learning on forget and retain sets, unlearning is the inverse operation that subtra
Why it matters
“Unmerge: Efficient Machine Unlearning via Task Arithmetic” should be evaluated beyond branding and benchmark scores. Its practical importance will emerge in task accuracy, latency, unit cost, safety and integration with real workflows.
Member comments