Powerful Training-Free Membership Inference Against Fine-Tuned Autoregressive Language Models (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for auditing fine-tuned language models have limited detection rates . membership inference attacks aim to determine if a specific record was in a model's training set . |
| Approach: | They propose a membership inference attack that exploits memorization at error positions . EZ-MIA achieves 3.8 higher detection than previous state-of-the-art . |
| Outcome: | The proposed attack achieves 3.8 higher detection than previous state-of-the-art models . EZ-MIA achieves 8 higher detectability than prior work, requiring no model training . |
Similar Papers
An Empirical Analysis of Memorization in Fine-tuned Autoregressive Language Models (2022.emnlp-main)
Copied to clipboard
| Challenge: | Large language models are shown to present privacy risks through memorization of training data, but little attention has been given to the fine-tuning phase. |
| Approach: | They empirically study memorization of fine-tuning methods using membership inference and extraction attacks and show that fine-timing the head of the model has the highest susceptibility to attacks. |
| Outcome: | The proposed methods have the highest memorization risk, whereas the smaller adapters are less vulnerable to known extraction attacks. |
Order of Magnitude Speedups for LLM Membership Inference (2024.emnlp-main)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are complex and require fine-tuning on proprietary datasets to improve performance and relevance. |
| Approach: | They propose a low-cost membership inference attack that leverages an ensemble of small quantile regression models to determine if a document belongs to the model’s training set. |
| Outcome: | The proposed approach achieves comparable or improved accuracy on fine-tuned LLMs of varying families and across multiple datasets. |
CheckMIABench: Firm Foundations For Membership Inference Attacks on Language Models (2026.acl-short)
Copied to clipboard
| Challenge: | Membership inference attacks are a canonical way to assess a machine learning model’s privacy properties. |
| Approach: | They propose a framework for principled evaluation of membership inference attacks against large language models by leveraging the insight that training data before and after a fixed point during training are drawn from the same distribution. |
| Outcome: | The proposed framework can be used to evaluate membership inference attacks against large language models. |
Detecting Training Data of Large Language Models via Expectation Maximization (2026.eacl-long)
Copied to clipboard
| Challenge: | Membership inference attacks aim to determine whether a specific example was used to train a given language model. |
| Approach: | They propose a membership inference approach that iteratively refines prefix effectiveness and membership scores using an expectation-maximization strategy without requiring labeled non-member examples. |
| Outcome: | The proposed approach outperforms baselines under systematically varied distributional overlap and difficulty. |
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. |
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. |
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. |
Robust Membership Inference for Large Language Models under Adversarial Generative Corruption (2026.acl-long)
Copied to clipboard
Yuanhong Huang, Huili Wang, Xueying Bai, Jinrui Wang, Jiajun Liu, Ziqin Wang, Wanchun Ni, Shangguang Wang, Tao Qi
| Challenge: | Membership inference attacks are a promising tool for auditing training data of LLMs . existing methods rely on the assumption that LLM's assign higher confidence scores to training samples than to non-training ones. |
| Approach: | They propose a membership inference framework that can be robust against adversarial MIAs. |
| Outcome: | The proposed framework can be robust against adversarial MIA methods and AIGT detectors while maintaining the performance of baselines. |
Membership Inference Attacks against Language Models via Neighbourhood Comparison (2023.findings-acl)
Copied to clipboard
Justus Mattern, Fatemehsadat Mireshghallah, Zhijing Jin, Bernhard Schoelkopf, Mrinmaya Sachan, Taylor Berg-Kirkpatrick
| Challenge: | Existing membership inference attacks aim to predict whether a data sample was present in training data of a machine learning model. |
| Approach: | They propose to compare model scores to neighbour texts to eliminate access to training data by comparing model scores with a given sample. |
| Outcome: | The proposed attacks outperform reference-based attacks with perfect knowledge of the training data distribution and outperformed reference-free attacks with imperfect knowledge. |
Quantifying Privacy Risks of Masked Language Models Using Membership Inference Attacks (2022.emnlp-main)
Copied to clipboard
| Challenge: | Prior attempts at measuring leakage of MLMs via membership inference attacks have been inconclusive, implying potential robustness of Mlms to privacy attacks. |
| Approach: | They propose a stronger membership inference attack based on likelihood ratio hypothesis testing that involves an additional MLM to more accurately quantify the privacy risks of memorization in MLMs. |
| Outcome: | The proposed attack improves the AUC of prior membership inference attacks from 0.66 to an alarmingly high 0.90 level on models trained on medical notes. |