Backdoor Secrets Unveiled: Identifying Backdoor Data with Optimized Scaled Prediction Consistency
Soumyadeep Pal, Yuguang Yao, Ren Wang, Bingquan Shen, Sijia Liu
TL;DR
This work tackles the practical problem of identifying backdoor data within poisoned datasets without access to clean data or predefined detection thresholds. It extends the scaled prediction consistency (SPC) signature by introducing mask-aware SPC (MSPC) and a bi-level optimization scheme to automatically split data into backdoor and clean sets. The approach leverages a learnable mask to preserve the trigger’s effective region and employs alternating optimization to minimize a MSPC-based loss while determining backdoor labels none-the-less. Across CIFAR-10, Tiny-ImageNet, and ImageNet200 with multiple backdoor attacks, MSPC achieves strong AUROC and enables threshold-free identification, with retraining on the identified clean subset significantly reducing attack success rates. This work offers a practically viable, data-sufficient defense for backdoor data, pushing forward threshold-free data cleaning in poisoned training pipelines.
Abstract
Modern machine learning (ML) systems demand substantial training data, often resorting to external sources. Nevertheless, this practice renders them vulnerable to backdoor poisoning attacks. Prior backdoor defense strategies have primarily focused on the identification of backdoored models or poisoned data characteristics, typically operating under the assumption of access to clean data. In this work, we delve into a relatively underexplored challenge: the automatic identification of backdoor data within a poisoned dataset, all under realistic conditions, i.e., without the need for additional clean data or without manually defining a threshold for backdoor detection. We draw an inspiration from the scaled prediction consistency (SPC) technique, which exploits the prediction invariance of poisoned data to an input scaling factor. Based on this, we pose the backdoor data identification problem as a hierarchical data splitting optimization problem, leveraging a novel SPC-based loss function as the primary optimization objective. Our innovation unfolds in several key aspects. First, we revisit the vanilla SPC method, unveiling its limitations in addressing the proposed backdoor identification problem. Subsequently, we develop a bi-level optimization-based approach to precisely identify backdoor data by minimizing the advanced SPC loss. Finally, we demonstrate the efficacy of our proposal against a spectrum of backdoor attacks, encompassing basic label-corrupted attacks as well as more sophisticated clean-label attacks, evaluated across various benchmark datasets. Experiment results show that our approach often surpasses the performance of current baselines in identifying backdoor data points, resulting in about 4%-36% improvement in average AUROC. Codes are available at https://github.com/OPTML-Group/BackdoorMSPC.
