Skewed Memorization in Large Language Models: Quantification and Decomposition

Hao Li, Di Huang, Ziyu Wang, Amir M. Rahmani
2/3/2025
cs.AIcs.CLcs.LG

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

Memorization in Large Language Models (LLMs) poses privacy and security risks, as models may unintentionally reproduce sensitive or copyrighted data. Existing analyses focus on average-case scenarios, often neglecting the highly skewed distribution of memorization. This paper examines memorization in LLM supervised fine-tuning (SFT), exploring its relationships with training duration, dataset size, and inter-sample similarity. By analyzing memorization probabilities over sequence lengths, we link this skewness to the token generation process, offering insights for estimating memorization and comparing it to established metrics. Through theoretical analysis and empirical evaluation, we provide a comprehensive understanding of memorization behaviors and propose strategies to detect and mitigate risks, contributing to more privacy-preserving LLMs.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{li2025skewed,
  title  = {Skewed Memorization in Large Language Models: Quantification and Decomposition},
  author = {Hao Li and Di Huang and Ziyu Wang and Amir M. Rahmani},
  year   = {2025},
  eprint = {2502.01187},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.01187v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.01187.svg)](https://codeofpaper.com/paper/2502.01187)

Discussion