Why Do Unlearnable Examples Work: A Novel Perspective of Mutual Information
Yifan Zhu, Yibo Miao, Yinpeng Dong, Xiao-Shan Gao

TL;DR
This paper introduces a mutual information perspective to understand and improve unlearnable examples, proposing a new method that effectively impedes model generalization by reducing mutual information through covariance minimization.
Contribution
It provides a theoretical analysis linking mutual information reduction to unlearnability and proposes a novel method, MI-UE, that outperforms existing approaches.
Findings
Effective unlearnable examples decrease mutual information between features.
Deeper networks benefit more from mutual information reduction.
Proposed MI-UE method outperforms previous methods under defenses.
Abstract
The volume of freely scraped data on the Internet has driven the tremendous success of deep learning. Along with this comes the growing concern about data privacy and security. Numerous methods for generating unlearnable examples have been proposed to prevent data from being illicitly learned by unauthorized deep models by impeding generalization. However, the existing approaches primarily rely on empirical heuristics, making it challenging to enhance unlearnable examples with solid explanations. In this paper, we analyze and improve unlearnable examples from a novel perspective: mutual information reduction. We demonstrate that effective unlearnable examples always decrease mutual information between clean features and poisoned features, and when the network gets deeper, the unlearnability goes better together with lower mutual information. Further, we prove from a covariance reduction…
Peer Reviews
Decision·ICLR 2026 Poster
1. Novel theoretical lens: Introduces mutual-information reduction as a unified explanation for UE effectiveness, filling a conceptual gap in a field often driven by heuristics. 2. Strong empirical evidence: Comprehensive experiments across datasets, models (CNNs and ViTs), and defense scenarios support claims. 3. Clear practical contributions: Proposed MI-UE method is simple, effective, and broadly transferable across architectures. 4. Good analysis of model depth effect: Demonstrates that d
1. Limited analysis of failure modes and defenses. While MI-UE achieves strong performance under many settings, it still degrades against certain tailored UE defenses (e.g., ISS, AVA) and does not universally dominate all specialized defense configurations. The paper acknowledges this but does not deeply examine why MI-UE fails in these cases, what properties of MI-based poisoning are being countered, or whether failure arises from optimization constraints, feature collapse dynamics, or assumpti
- The paper presents a interesting perspective on unlearnable examples, introducing MI reduction as the key mechanism. This approach is novel and provides a theoretical understanding of how UEs work, going beyond empirical heuristics. - The paper includes theoretical grounding, demonstrating a connection between MI reduction and unlearnability. The experiments are well-designed, comparing MI-UE with several baseline methods and across different model architectures. - The paper is well-written,
- The paper acknowledges the challenges in optimizing MI and covariance, but the proposed solution still relies on a relatively simple optimization process. Further exploration into alternative optimization strategies could strengthen the paper's impact. - The bi-level optimization lacks sufficient theoretical analysis. Given that first-order gradient-based methods for solving bi-level optimization problems face well-known convergence challenges in non-convex scenarios, the absence of theoretic
Please see above.
Please see above.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Privacy-Preserving Technologies in Data · Machine Learning and Data Classification
