cs.CVMay 3, 2026

Dual-branch Robust Unlearnable Examples

Authors: Xianlong WangHangtao ZhangWenbo PanZiqi ZhouChangsong JiangLi ZengXiaohua Jia

Organizations: Department of Computer Science, City University of Hong Kong, Hong Kong SAR, China · University of Pennsylvania, Philadelphia, USA · Huazhong University of Science and Technology, Wuhan, China · University of Electronic Science and Technology of China, Chengdu, China · Changsha University of Science and Technology, Changsha, China

Abstract

Unlearnable examples (UEs) aim to compromise model training by injecting imperceptible perturbations to clean samples. However, existing UE schemes exhibit limited robustness against advanced defenses due to their heuristic design or narrowly scoped domain perturbations. To address this, we propose \texttt{DUNE}, a \underline{\textbf{D}}ual-branch \underline{\textbf{UN}}learnable \underline{\textbf{E}}nsemble perturbation optimization approach. Specifically, \texttt{DUNE} separately optimizes perturbations in the spatial and color domains to establish the mapping between perturbations and shift-induced labels. This design extends the perturbation domain to increase noise intensity for improving robustness and drives the models to learn perturbation-oriented features with degraded generalization, thereby achieving unlearnability. To strengthen \texttt{DUNE}'s performance, we further propose an unlearnability-enhancing ensemble strategy that aggregates diverse pre-trained models during the dual-branch optimization. Extensive experiments on benchmark datasets CIFAR-10 and ImageNet verify that \texttt{DUNE}'s robustness outperforms 12 SOTA UE schemes under 7 mainstream defenses, yielding a lower average test accuracy of 14.95% to 50.82%.

Explore similar work

CardsList