Window-based Membership Inference Attacks Against Fine-tuned Large Language Models

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Chen, Yuetian, Du, Yuntao, Zhang, Kaiyuan, Kundu, Ashish, Fleming, Charles, Ribeiro, Bruno, Li, Ninghui
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866918373537873920
author Chen, Yuetian
Du, Yuntao
Zhang, Kaiyuan
Kundu, Ashish
Fleming, Charles
Ribeiro, Bruno
Li, Ninghui
author_facet Chen, Yuetian
Du, Yuntao
Zhang, Kaiyuan
Kundu, Ashish
Fleming, Charles
Ribeiro, Bruno
Li, Ninghui
contents Most membership inference attacks (MIAs) against Large Language Models (LLMs) rely on global signals, like average loss, to identify training data. This approach, however, dilutes the subtle, localized signals of memorization, reducing attack effectiveness. We challenge this global-averaging paradigm, positing that membership signals are more pronounced within localized contexts. We introduce WBC (Window-Based Comparison), which exploits this insight through a sliding window approach with sign-based aggregation. Our method slides windows of varying sizes across text sequences, with each window casting a binary vote on membership based on loss comparisons between target and reference models. By ensembling votes across geometrically spaced window sizes, we capture memorization patterns from token-level artifacts to phrase-level structures. Extensive experiments across eleven datasets demonstrate that WBC substantially outperforms established baselines, achieving higher AUC scores and 2-3 times improvements in detection rates at low false positive thresholds. Our findings reveal that aggregating localized evidence is fundamentally more effective than global averaging, exposing critical privacy vulnerabilities in fine-tuned LLMs.
format Preprint
id arxiv_https___arxiv_org_abs_2601_02751
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Window-based Membership Inference Attacks Against Fine-tuned Large Language Models
Chen, Yuetian
Du, Yuntao
Zhang, Kaiyuan
Kundu, Ashish
Fleming, Charles
Ribeiro, Bruno
Li, Ninghui
Computation and Language
Artificial Intelligence
Cryptography and Security
Most membership inference attacks (MIAs) against Large Language Models (LLMs) rely on global signals, like average loss, to identify training data. This approach, however, dilutes the subtle, localized signals of memorization, reducing attack effectiveness. We challenge this global-averaging paradigm, positing that membership signals are more pronounced within localized contexts. We introduce WBC (Window-Based Comparison), which exploits this insight through a sliding window approach with sign-based aggregation. Our method slides windows of varying sizes across text sequences, with each window casting a binary vote on membership based on loss comparisons between target and reference models. By ensembling votes across geometrically spaced window sizes, we capture memorization patterns from token-level artifacts to phrase-level structures. Extensive experiments across eleven datasets demonstrate that WBC substantially outperforms established baselines, achieving higher AUC scores and 2-3 times improvements in detection rates at low false positive thresholds. Our findings reveal that aggregating localized evidence is fundamentally more effective than global averaging, exposing critical privacy vulnerabilities in fine-tuned LLMs.
title Window-based Membership Inference Attacks Against Fine-tuned Large Language Models
topic Computation and Language
Artificial Intelligence
Cryptography and Security
url https://arxiv.org/abs/2601.02751