Tag&Tab: Pretraining Data Detection in Large Language Models Using Keyword-Based Membership Inference Attack (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Recent studies on detecting pretraining data in large language models have focused on sentence-level membership inference attacks (MIAs) but these methods often exhibit poor accuracy, failing to account for the semantic importance of textual content and word significance. |
| Approach: | They propose a method that leverages established natural language processing techniques to tag keywords in input text and then uses them to obtain probabilities and calculate their average log-likelihood to determine input text membership. |
| Outcome: | The proposed method exploits established natural language processing techniques to tag keywords in input text and calculate their average log-likelihood to determine input text membership. |
Similar Papers
Context-Aware Membership Inference Attacks against Pre-trained Large Language Models (2025.emnlp-main)
Copied to clipboard
| Challenge: | Prior Membership Inference Attacks on pre-trained Large Language Models fail at LLMs due to ignoring the generative nature of LLM data. |
| Approach: | They propose a method that adapts MIA statistical tests to the perplexity dynamics of subsequences within a data point. |
| Outcome: | The proposed method significantly outperforms prior approaches, revealing context-dependent memorization patterns in pre-trained LLMs. |
Does Data Contamination Detection Work (Well) for LLMs? A Survey and Evaluation on Detection Assumptions (2025.findings-naacl)
Copied to clipboard
| Challenge: | Large language models have demonstrated great performance across various benchmarks, but data contamination is a concern in their evaluation. |
| Approach: | They analyze 50 papers on data contamination detection and test three of them as case studies to identify the possibility of data contamination. |
| Outcome: | The proposed methods can detect membership inference attacks on instance-level data, and can perform similar to random guessing on LLM pretraining datasets. |
Pretraining Data Detection for Large Language Models: A Divergence-based Calibration Method (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to detect text in training corpus are limited due to their low token probabilities. |
| Approach: | They propose a method to calibrate token probabilities for pretraining data detection by using a divergence-based calibration method. |
| Outcome: | The proposed method significantly outperforms existing methods on Chinese text on English-language benchmarks and patents. |
DPDLLM: A Black-box Framework for Detecting Pre-training Data from Large Language Models (2024.findings-acl)
Copied to clipboard
Baohang Zhou, Zezhong Wang, Lingzhi Wang, Hongru Wang, Ying Zhang, Kehui Song, Xuhui Sui, Kam-Fai Wong
| Challenge: | Existing methods to detect pretraining data from large language models are unrealistic to them. |
| Approach: | They propose to detect pre-training data from LLM in a black-box way by using GPT-2 as reference model and feed it with sequence probabilities to detect whether it was used to train it. |
| Outcome: | The proposed framework outperforms existing methods on the benchmark datasets and shows that it is effective on different popular LLMs. |
Scaling Up Membership Inference: When and How Attacks Succeed on Large Language Models (2025.findings-naacl)
Copied to clipboard
| Challenge: | Membership inference attacks (MIAs) attempt to verify the membership of a data sample in the training set for a model. |
| Approach: | They propose to use membership inference attacks to verify the membership of a given data sample in a model training set. |
| Outcome: | The proposed methods are based on a new benchmark that measures the performance of membership inference attacks on large language models at a continuous scale. |
Con-ReCall: Detecting Pre-training Data in LLMs via Contrastive Decoding (2025.coling-main)
Copied to clipboard
| Challenge: | Existing methods analyze training data with member and non-member contexts, overlooking potential insights from both member and not-member. |
| Approach: | They propose a method that leverages asymmetric distributional shifts induced by member and non-member contexts through contrastive decoding to enhance membership inference. |
| Outcome: | The proposed approach outperforms the current state-of-the-art on the WikiMIA benchmark and is robust against various text manipulation techniques. |
A Statistical and Multi-Perspective Revisiting of the Membership Inference Attack in Large Language Models (2025.acl-long)
Copied to clipboard
| Challenge: | Membership Inference Attack (MIA) is a method that differentiates trained (member) and untrained (non-member) data. |
| Approach: | They used thousands of experiments to examine membership inference attacks from different settings and then revisited them with thousands of different methods. |
| Outcome: | The proposed methods outperform baselines in the study and improve with model size and varies with domains. |
Tokens for Learning, Tokens for Unlearning: Mitigating Membership Inference Attacks in Large Language Models via Dual-Purpose Training (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing defenses for large language models do not account for the sequential nature of text data. |
| Approach: | They propose a lightweight yet effective empirical privacy defense that leverages token-specific characteristics to protect training data of large language models. |
| Outcome: | The proposed approach provides strong protection against membership inference attacks and improves language modeling performance by 10% across different LLM architectures and datasets compared to baselines. |
ReCaLL: Membership Inference via Relative Conditional Log-Likelihoods (2024.emnlp-main)
Copied to clipboard
| Challenge: | ReCaLL (Relative Conditional Log-Likelihood) is a membership inference attack that can detect LLMs’ pretraining data by leveraging their conditional language modeling capabilities. |
| Approach: | They propose a membership inference attack to detect LLMs’ pretraining data by leveraging their conditional language modeling capabilities. |
| Outcome: | The proposed model achieves state-of-the-art performance on the WikiMIA dataset, even with random and synthetic prefixes, and can be further improved using an ensemble approach. |
Identifying Pre-training Data in LLMs: A Neuron Activation-Based Detection Framework (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for detecting pre-training data in large language models rely on superficial features like prediction confidence and loss, resulting in mediocre performance. |
| Approach: | They propose a new algorithm to analyze neuron activation patterns between training and non-training data in large language models to improve their performance. |
| Outcome: | The proposed algorithm outperforms existing methods across three benchmarks and multiple LLMs. |