Stealth edits to large language models
Not on the map. Why?
Abstract (arXiv)
We reveal the theoretical foundations of techniques for editing large language models, and present new methods which can do so without requiring retraining. Our theoretical insights show that a single metric (a measure of the intrinsic dimension of the model's features) can be used to assess a model's editability and reveals its previously unrecognised susceptibility to malicious stealth attacks. This metric is fundamental to predicting the success of a variety of editing approaches, and reveals new bridges between disparate families of editing methods. We collectively refer to these as stealth editing methods, because they directly update a model's weights to specify its response to specific known hallucinating prompts without affecting other model behaviour. By carefully applying our theoretical insights, we are able to introduce a new jet-pack network block which is optimised for highly selective model editing, uses only standard network operations, and can be inserted into existing networks. We also reveal the vulnerability of language models to stealth attacks: a small change to a model's weights which fixes its response to a single attacker-chosen prompt. Stealth attacks are computationally simple, do not require access to or knowledge of the model's training data, and therefore represent a potent yet previously unrecognised threat to redistributed foundation models. Extensive experimental results illustrate and support our methods and their theoretical underpinnings. Demos and source code are available at https://github.com/qinghua-zhou/stealth-edits.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 29 of its 42 references that are in the map. First posted on arXiv 18 Jun 2024.
Builds on
29 of 42 references.
References · 29
- 2017Attention Is All You Needcited by 60,361
- 2022Training language models to follow instructions with human feedbackcited by 15,971
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,297
- 2016Layer Normalizationcited by 5,669
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
- 2022Locating and Editing Factual Associations in GPTcited by 2,691
- 2022Survey of Hallucination in Natural Language Generationcited by 2,075
- 2019Root Mean Square Layer Normalizationcited by 1,480
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,336
- 2017Targeted Backdoor Attacks on Deep Learning Systems Using Data Poisoningcited by 1,055
- 2022Mass-Editing Memory in a Transformercited by 1,001
- 2017Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learningcited by 950
17 more
- 2021Fast Model Editing at Scalecited by 498
- 2024Hallucination is Inevitable: An Innate Limitation of Large Language Modelscited by 332
- 2024tinyBenchmarks: evaluating LLMs with fewer examplescited by 310
- 2022Aging with GRACE: Lifelong Model Editing with Discrete Key-Value Adaptorscited by 271
- 2022On the Origin of Hallucinations in Conversational Models: Is it the Datasets or the Models?cited by 138
- 2023Calibrated Language Models Must Hallucinatecited by 115
- 2021Be Careful about Poisoned Word Embeddings: Exploring the Vulnerability of the Embedding Layers in NLP Modelscited by 105
- 2020The Cost of Training NLP Models: A Concise Overviewcited by 98
- 2024BadEdit: Backdooring large language models by model editingcited by 96
- 2023On the Expressivity Role of LayerNorm in Transformers' Attentioncited by 33
- 2023Training-free Lexical Backdoor Attacks on Language Modelscited by 31
- 2022Neural Knowledge Bank for Pretrained Transformerscited by 16
- 2020On Adversarial Examples and Stealth Attacks in Artificial Intelligence Systemscited by 13
- 2021The Feasibility and Inevitability of Stealth Attackscited by 12
- 2018The unreasonable effectiveness of small neural ensembles in high-dimensional braincited by 10
- 2023Relative intrinsic dimensionality is intrinsic to learningcited by 6
- 2023How adversarial attacks can disrupt seemingly stable accurate classifierscited by 4
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.