Challenge: Large language models (LLMs) are the foundation of modern natural language processing, powering applications across diverse domains.
Approach: They propose a model-agnostic defense framework which aggregates and evaluates the outputs of a knowledge-injected LLM, a base LLM and a dedicated judge model to enhance resistance against membership inference attacks.
Outcome: The proposed framework reduces MIA success by up to 27.8% for SFT and 526.3% for RAG compared to inference-time baseline while maintaining answer quality.

Similar Papers

Safeguarding Privacy of Retrieval Data against Membership Inference Attacks: Is This Query Too Close to Home? (2025.findings-emnlp)

Copied to clipboard

Challenge: delivering private retrieved documents directly to LLMs introduces vulnerability to membership inference attacks .
Approach: They propose a similarity-based membership inference attack detection framework for RAG . they propose obfuscate attackers, maintain data utility, and remain system-agnostic .
Outcome: The proposed framework can detect and hide membership inference attacks, while remaining system-agnostic against them.
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.
Robust Membership Inference for Large Language Models under Adversarial Generative Corruption (2026.acl-long)

Copied to clipboard

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.
RAG in the Wild: On the (In)effectiveness of LLMs with Mixture-of-Knowledge Retrieval Augmentation (2026.findings-acl)

Copied to clipboard

Challenge: Retrieval-augmented generation (RAG) enhances large language models by integrating external knowledge retrieved at inference time.
Approach: They evaluate RAG systems using MassiveDS, a large-scale datastore with mixture of knowledge.
Outcome: The proposed approach improves performance on knowledge-intensive NLP tasks.
The Good and The Bad: Exploring Privacy Issues in Retrieval-Augmented Generation (RAG) (2024.findings-acl)

Copied to clipboard

Challenge: Retrieval-augmented generation (RAG) is a powerful technique to facilitate language model generation with proprietary and private data, where data privacy is . a privacy issue that is currently under-explored, is posed by RAG.
Approach: They propose to use retrieval-augmented generation (RAG) to facilitate language model generation with proprietary and private data where data privacy is a pivotal concern.
Outcome: The proposed attack methods demonstrate that RAG can mitigate the old risks, i.e., leakage of the LLMs’ training data.
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.
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 .
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.
Open Schrödinger’s Closed Box: Identifying Retrieval Augmented Generation in API-Accessible Large Language Model Services (2026.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) are powerful at question-answering but prone to hallucinations due to limited domain-specific or up-to-date knowledge.
Approach: They propose a framework for IDentifying RAG properties in LLM services that integrates LLMs with retrieval systems and adds an external retriever and knowledge database to mitigate hallucinations.
Outcome: The proposed framework detects RAG-enhanced LLMs with 99.97% accuracy with partial or no optional knowledge and nearly 100% when the LLM and database are known.
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.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations