LadderEdit: Edit-Level Residual Compression for Memory-Efficient Lifelong Editing of LLMs

Xiaobing Yu, Peijie Qiu, Jin Yang, Xuanzhao Dong, Weiwei Ma +3 more
10/8/2026
cs.CLcs.CVcs.LG

No confident code implementation found for this paper.

Abstract

Lifelong editing of LLMs requires storing thousands of edits after acquisition. A widely used family of approaches attaches one LoRA adapter per edit, which preserves behavior but grows linearly in storage. To address this challenge, we propose LadderEdit, a method that compresses each LoRA adapter after it is acquired. Each edit is first stored at low rank as a cheap sketch. We then check whether this sketch still satisfies the rewrite, generalization, and locality contract on probe prompts. Edits that pass keep the sketch; those that fail are promoted to a higher rank along a ladder until the contract is met. Because every edit retains some representation, coverage is maintained, and only hard edits consume more rank. Across ZsRE, CounterFact, and WikiBigEdit benchmarks on LLaMA-3-8B, Mistral-7B, and Qwen2.5-7B, LadderEdit tracks exact LoRA storage at 5.2x less memory and remains effective at 50,000 sequential edits.

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. Any repos shown below are weak matches — 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{yu2026ladderedit,
  title  = {LadderEdit: Edit-Level Residual Compression for Memory-Efficient Lifelong Editing of LLMs},
  author = {Xiaobing Yu and Peijie Qiu and Jin Yang and Xuanzhao Dong and Weiwei Ma and Zhaoqi An and Xiaoqi Zhao and Xiaofeng Liu},
  year   = {2026},
  eprint = {2610.11160},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2610.11160v1}
}

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/2610.11160.svg)](https://codeofpaper.com/paper/2610.11160)

Discussion