Papers › Can Sensitive Information Be Deleted From LLMs? Objectives for Defending Against...

Can Sensitive Information Be Deleted From LLMs? Objectives for Defending Against Extraction Attacks

29 Sep 2023arXiv:2309.17410archive 2025-07-28

Vaidehi Patil, Peter Hase, Mohit Bansal

Pretrained language models sometimes possess knowledge that we do not wish them to, including memorized personal information and knowledge that could be used to harm people. They can also output toxic or harmful text. To mitigate these safety and informational issues, we propose an attack-and-defense framework for studying the task of deleting sensitive information directly from model weights. We study direct edits to model weights because (1) this approach should guarantee that particular deleted information is never extracted by future prompt attacks, and (2) it should protect against whitebox attacks, which is necessary for making claims about safety/privacy in a setting where publicly available model weights could be used to elicit sensitive information. Our threat model assumes that an attack succeeds if the answer to a sensitive question is located among a set of B generated candidates, based on scenarios where the information would be insecure if the answer is among B candidates. Experimentally, we show that even state-of-the-art model editing methods such as ROME struggle to truly delete factual information from models like GPT-J, as our whitebox and blackbox attacks can recover "deleted" information from an edited model 38% of the time. These attacks leverage two key observations: (1) that traces of deleted information can be found in intermediate model hidden states, and (2) that applying an editing method for one question may not delete information across rephrased versions of the question. Finally, we provide new defense methods that protect against some extraction attacks, but we do not find a single universally effective defense method. Our results suggest that truly deleting sensitive information is a tractable but difficult problem, since even relatively low attack success rates have potentially severe societal implications for real-world deployment of language models.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2309.17410")

Code

Syntology Ran 9 of 14 code samples harvested from 1 repository linked to this paper; 5 have no recorded run. Of those that ran: 9 ran with no contract checked.

By repository: official repository: 14 samples from 1 repository, 9 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

vaidehi99/infodeletionattacks officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

14 samples harvested; 9 ran; 0 honoured the contract we drafted; 5 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

9ran
5unverified

Licence: 0 of the 14 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from vaidehi99/infodeletionattacks. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

blocks_input_locator vaidehi99/infodeletionattacks/transformer_utils/src/transformer_utils/logit_lens/hooks.py official repository ran MIT (permissive) · 92f6c49ecd85ec5b · report
collect_logits vaidehi99/infodeletionattacks/transformer_utils/src/transformer_utils/logit_lens/plotting.py official repository ran MIT (permissive) · c2fd2fc3dcf6a037 · report
final_layernorm_locator vaidehi99/infodeletionattacks/transformer_utils/src/transformer_utils/logit_lens/hooks.py official repository ran MIT (permissive) · 545f704e0ca27e96 · report
get_child_module_by_names vaidehi99/infodeletionattacks/transformer_utils/src/transformer_utils/util/module_utils.py official repository ran MIT (permissive) · 7aa7d15b17e07438 · report
get_value_at_preds vaidehi99/infodeletionattacks/transformer_utils/src/transformer_utils/logit_lens/plotting.py official repository ran MIT (permissive) · ce37c1e5ca45da4c · report
huggingface_model_local_paths vaidehi99/infodeletionattacks/transformer_utils/src/transformer_utils/util/tfm_utils.py official repository ran MIT (permissive) · 5320ade14843dae2 · report
make_decoder vaidehi99/infodeletionattacks/transformer_utils/src/transformer_utils/logit_lens/hooks.py official repository ran MIT (permissive) · ab1cdc57445d3f76 · report
normalize_inconsistent_state_dict_keys vaidehi99/infodeletionattacks/transformer_utils/src/transformer_utils/util/tfm_utils.py official repository ran MIT (permissive) · 78e83f431d38e8bb · report
postprocess_logits vaidehi99/infodeletionattacks/transformer_utils/src/transformer_utils/logit_lens/plotting.py official repository ran fingerprinted MIT (permissive) · b639e905c59033d4 · report
get_leaf_modules vaidehi99/infodeletionattacks/transformer_utils/src/transformer_utils/util/module_utils.py official repository unverified MIT (permissive) · 390ee5748e50d330 · report
get_local_path_from_huggingface_cdn vaidehi99/infodeletionattacks/transformer_utils/src/transformer_utils/util/tfm_utils.py official repository unverified MIT (permissive) · e759667d86453174 · report
low_memory_from_pretrained vaidehi99/infodeletionattacks/transformer_utils/src/transformer_utils/low_memory/enable.py official repository unverified MIT (permissive) · a444132567003b3e · report
low_memory_load vaidehi99/infodeletionattacks/transformer_utils/src/transformer_utils/low_memory/load.py official repository unverified MIT (permissive) · ad9a1b60539e7185 · report
make_layer_names vaidehi99/infodeletionattacks/transformer_utils/src/transformer_utils/logit_lens/layer_names.py official repository unverified MIT (permissive) · 03f5b2a1c286c0a7 · report

Tasks

Model Editing

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

ROME

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections