ReCaLL: Membership Inference via Relative Conditional Log-Likelihoods
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909620490993664 |
|---|---|
| author | Xie, Roy Wang, Junlin Huang, Ruomin Zhang, Minxing Ge, Rong Pei, Jian Gong, Neil Zhenqiang Dhingra, Bhuwan |
| author_facet | Xie, Roy Wang, Junlin Huang, Ruomin Zhang, Minxing Ge, Rong Pei, Jian Gong, Neil Zhenqiang Dhingra, Bhuwan |
| contents | The rapid scaling of large language models (LLMs) has raised concerns about the transparency and fair use of the data used in their pretraining. Detecting such content is challenging due to the scale of the data and limited exposure of each instance during training. We propose ReCaLL (Relative Conditional Log-Likelihood), a novel membership inference attack (MIA) to detect LLMs' pretraining data by leveraging their conditional language modeling capabilities. ReCaLL examines the relative change in conditional log-likelihoods when prefixing target data points with non-member context. Our empirical findings show that conditioning member data on non-member prefixes induces a larger decrease in log-likelihood compared to non-member data. We conduct comprehensive experiments and show that ReCaLL 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. Moreover, we conduct an in-depth analysis of LLMs' behavior with different membership contexts, providing insights into how LLMs leverage membership information for effective inference at both the sequence and token level. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_15968 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | ReCaLL: Membership Inference via Relative Conditional Log-Likelihoods Xie, Roy Wang, Junlin Huang, Ruomin Zhang, Minxing Ge, Rong Pei, Jian Gong, Neil Zhenqiang Dhingra, Bhuwan Computation and Language Machine Learning The rapid scaling of large language models (LLMs) has raised concerns about the transparency and fair use of the data used in their pretraining. Detecting such content is challenging due to the scale of the data and limited exposure of each instance during training. We propose ReCaLL (Relative Conditional Log-Likelihood), a novel membership inference attack (MIA) to detect LLMs' pretraining data by leveraging their conditional language modeling capabilities. ReCaLL examines the relative change in conditional log-likelihoods when prefixing target data points with non-member context. Our empirical findings show that conditioning member data on non-member prefixes induces a larger decrease in log-likelihood compared to non-member data. We conduct comprehensive experiments and show that ReCaLL 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. Moreover, we conduct an in-depth analysis of LLMs' behavior with different membership contexts, providing insights into how LLMs leverage membership information for effective inference at both the sequence and token level. |
| title | ReCaLL: Membership Inference via Relative Conditional Log-Likelihoods |
| topic | Computation and Language Machine Learning |
| url | https://arxiv.org/abs/2406.15968 |