Towards Provably Unlearnable Examples via Bayes Error Optimization

Read full text
Authors: Association for Artificial Intelligence 2026, Ee-Peng Lim, Jun Sun, Ruihan Zhang, Peixin Zhang
Cited by: 0

Abstract

The recent success of machine learning models, especially large-scale classifiers and language models, relies heavily on training with massive data. These data are often collected from online sources. This raises serious concerns about the protection of user data, as individuals may not have given consent for their data to be used in training. To address this concern, recent studies introduce the concept of unlearnable examples, i.e., data instances that appear natural but are intentionally altered to prevent models from effectively learning from them. While existing methods demonstrate empirical effectiveness, they typically rely on heuristic trials and lack formal guarantees. Besides, when unlearnable examples are mixed with clean data, as is often the case in practice, their unlearnability disappears. In this work, we propose a novel approach to constructing unlearnable examples by systematically maximising the Bayes error, a measurement of irreducible classification error. We develop an optimisation-based approach and provide an efficient solution using projected gradient ascent. Our method provably increases the Bayes error and remains effective when the unlearning examples are mixed with clean samples. Experimental results across multiple datasets and model architectures are consistent with our theoretical analysis and show that our approach can restrict data learnability, effectively in practice.

Fields of Study & Subjects

Privacy-Preserving Technologies in Data Adversarial Robustness in Machine Learning Machine Learning and Data Classification

Publication details

Journal / source
Underline Science Inc.
Publication date
7 January 2026
Language
EN