arrow
Return

Syntax-Oriented Shortcut: A Syntax Level Perturbing Algorithm for Preventing Text Data From Being Learned

delete2025-10-06
delete0
PRE
AI
B
Bo Li
K
Kun Zhang
陈曦 cover
陈曦 (Xi Chen)
R
Richang Hong
DOI:10.1109/TNNLS.2025.3609842delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The vast availability of free data has been critical to the success of large language models (LLMs). With the widespread use of LLMs, more and more concerns have been raised about the unauthorized use of publicly available data. To protect data from unauthorized use for training models, researchers have proposed adding imperceptible perturbations into image data so that models would be misled by the generated shortcut features and cannot mine information from these images. However, due to the inherent discrete property and semantic complexity of texts, directly applying these methods to text will cause semantic changes, resulting in meaningless shortcut features being constructed. To tackle this problem, in this article, we design a novel Unlearnable text examples generation algorithm via syntax-oriented shortcut (UTE-SS) by incorporating the syntactic structure of texts. Specifically, we propose a syntax template generator (STG) to generate the optimal perturbing syntax for a given category, which will realize imperceptible perturbations. Then, a perturbing text generator (PTG) is designed to perturb the in-class texts with the selected syntax template to stably deviate from the original texts. Along this line, models will be misled to learn the shortcut between the syntax template and the category, so as to keep text examples unlearnable. Extensive experiments over eight advanced Transformer-based pretrained language models (PLMs) on four different natural language processing (NLP) tasks demonstrate the effectiveness and flexibility of our proposed algorithm. Our method is easy to implement, and the code is publicly available at https://github.com/libolb/UTE-SS.
Keywords:
Data security
privacy protection
shortcut learning
unlearnable examples

Journal

IEEE Transactions on Neural Networks and Learning Systems cover
IEEE Transactions on Neural Networks and Learning Systems
IF:
8.9
Papers:
7.6K
Citations:
7.2W

Organization

H
hefei university of technology
Scholars:
2.5W
Papers: 1.7W
Citations: 35
H
hefei comprehensive national science center
Scholars:
202
Papers: 94
Citations: 0
A
anhui university
Scholars:
1.9W
Papers: 1.2W
Citations: 24
researcher View more organizations
Cited Papers

Cited Papers

The PASCAL Recognising Textual Entailment Challenge
err2006-01-01
err0
PREAI
errIdo Dagan; Oren Glickman; Bernardo Magnini
errShare
errSave
A Survey on Federated Unlearning: Challenges, Methods, and Future Directions
err2024-10-07
err0
errOAAI
errLiu, Ziyao; Jiang, Yu; Shen, Jiyuan; Peng, Minyi; Lam, Kwok-Yan; Yuan, Xingliang; Liu, Xiaoning
errShare
errSave
BERT
err
err0
PREAI
errLiu,Francis
errShare
errSave
Description-Enhanced Label Embedding Contrastive Learning for Text Classification
err2024-10-01
err3
errOAAI
errZhang, Kun; Wu, Le; Lv, Guangyi; Chen, Enhong; Ruan, Shulan; Liu, Jing; Zhang, Zhiqiang; Zhou, Jun; Wang, Meng
errShare
errSave
err
IF0
err
err0
errOAAI
err
errShare
errSave
researcher View more