Knowledge Offloading: Decomposing LLMs into Sparse Backbones and Memory Modules
Not on the map. Why?
Abstract (arXiv)
LLMs encode both general capabilities and domain-specific knowledge in a single set of parameters. We ask whether this capacity can be reorganized: keeping broadly useful computation in a shared backbone, while moving specialized knowledge into external memory modules. We propose knowledge offloading (KOFF), a framework for decomposing a pretrained LLM into a sparse shared backbone and domain-specific memories. Starting from a frozen base model, we jointly learn a structured pruning mask and lightweight recovery modules, implemented as LoRA adapters and learned key-value caches. Across Llama and Qwen models from 3B to 8B, we find that non-trivial capacity can be moved out of the shared backbone without a large loss in model ability. At around 12% global sparsity, KOFF preserves much of the unpruned model's performance, while pruning the same frozen model without memories degrades sharply. Ablations show that LoRA and learned KV memories are complementary, and specialization analyses suggest that the learned decomposition is meaningful: language-specific neurons are preferentially removed while language-general neurons largely remain in the backbone. These results suggest that knowledge can be reallocated between a shared core and swappable external memories.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 18 of its 26 references that are in the map. First posted on arXiv 27 May 2026.
Builds on
18 of 26 references.
References · 18
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
- 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,767
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
6 more
- 2022Sparse Upcycling: Training Mixture-of-Experts from Dense Checkpointscited by 207
- 2022Branch-Train-Merge: Embarrassingly Parallel Training of Expert Language Modelscited by 187
- 2021MoEfication: Transformer Feed-forward Layers are Mixtures of Expertscited by 149
- 2024Branch-Train-MiX: Mixing Expert LLMs into a Mixture-of-Experts LLMcited by 106
- 2022Discovering Language-neutral Sub-networks in Multilingual Language Modelscited by 28
- 2025Pretraining with hierarchical memories: separating long-tail and common knowledgecited by 13
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026NGM: A Plug-and-Play Training-Free Memory Module for LLMs
- 2026Dual-Layer Agentic Memory with Fast Write Routing and Slow Consolidation
- 2024Memory3: Language Modeling with Explicit Memory
- 2026TokenMem: Faithful Knowledge Injection for Frozen LLMs
- 2026Mixture of Chapters: Scaling Learnt Memory in Transformers
- 2025Cache What Lasts: Token Retention for Memory-Bounded KV Cache in LLMs
- 2026NeuroPrefetcher: Storage-Aware Sparse LLM Inference via Delta Prefetching
- 2026Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models