English

Efficiently Attacking Memorization Scores

Machine Learning 2025-09-30 v2

Abstract

Influence estimation tools -- such as memorization scores -- are widely used to understand model behavior, attribute training data, and inform dataset curation. However, recent applications in data valuation and responsible machine learning raise the question: can these scores themselves be adversarially manipulated? In this work, we present a systematic study of the feasibility of attacking memorization-based influence estimators. We characterize attacks for producing highly memorized samples as highly sensitive queries in the regime where a trained algorithm is accurate. Our attack (calculating the pseudoinverse of the input) is practical, requiring only black-box access to model outputs and incur modest computational overhead. We empirically validate our attack across a wide suite of image classification tasks, showing that even state-of-the-art proxies are vulnerable to targeted score manipulations. In addition, we provide a theoretical analysis of the stability of memorization scores under adversarial perturbations, revealing conditions under which influence estimates are inherently fragile. Our findings highlight critical vulnerabilities in influence-based attribution and suggest the need for robust defenses. All code can be found at https://github.com/tuedo2/MemAttack

Keywords

Cite

@article{arxiv.2509.20463,
  title  = {Efficiently Attacking Memorization Scores},
  author = {Tue Do and Varun Chandrasekaran and Daniel Alabi},
  journal= {arXiv preprint arXiv:2509.20463},
  year   = {2025}
}

Comments

Updated github codebase link to the correct url

R2 v1 2026-07-01T05:54:47.574Z