Backdoor Unlearning by Linear Task Decomposition
Amel Abdelraheem, Alessandro Favero, Gerome Bovet, Pascal Frossard
TL;DR
This work tackles backdoor vulnerabilities in foundation models by showing that backdoor behavior can be disentangled from clean knowledge in weight space. It introduces TBAR, a lightweight unlearning method that estimates a trigger direction from a small forget set and subtracts it to recover clean performance, achieving near-perfect unlearning and high clean accuracy on CLIP-based tasks. The method extends to agnostic attacks by leveraging reverse-engineered triggers, and demonstrates strong results across large-scale image-caption datasets and across architectures, often outperforming existing defenses while using far less data. Collectively, these findings highlight a practical, data-efficient path to safe deployment of vision-language models through targeted weight-space manipulations.
Abstract
Foundation models have revolutionized computer vision by enabling broad generalization across diverse tasks. Yet, they remain highly susceptible to adversarial perturbations and targeted backdoor attacks. Mitigating such vulnerabilities remains an open challenge, especially given that the large-scale nature of the models prohibits retraining to ensure safety. Existing backdoor removal approaches rely on costly fine-tuning to override the harmful behavior, and can often degrade performance on other unrelated tasks. This raises the question of whether backdoors can be removed without compromising the general capabilities of the models. In this work, we address this question and study how backdoors are encoded in the model weight space, finding that they are disentangled from other benign tasks. Specifically, this separation enables the isolation and erasure of the backdoor's influence on the model with minimal impact on clean performance. Building on this insight, we introduce a simple unlearning method that leverages such disentanglement. Through extensive experiments with CLIP-based models and common adversarial triggers, we show that, given the knowledge of the attack, our method achieves approximately perfect unlearning, while retaining, on average, 96% of clean accuracy. Additionally, we demonstrate that even when the attack and its presence are unknown, our method successfully unlearns backdoors by proper estimation using reverse-engineered triggers. Overall, our method consistently yields better unlearning and clean accuracy tradeoffs when compared to present state-of-the-art defenses.
