When to Adapt: Conditional Memory Adapters for Retention-Preserving Domain Specialization
Not on the map. Why?
Abstract (arXiv)
Large language models deployed in specialized domains must improve in-domain performance without sacrificing general capabilities. Existing parameter-efficient fine-tuning methods are typically always on: their learned perturbations are applied to every input, which can degrade out-of-domain (OOD) performance. We propose Engram Adapter, a framework that repurposes pretraining-time conditional memory as a post-hoc adapter for frozen LLMs. It uses multi-channel matching over local n-gram patterns with explicit occupancy tracking as a lightweight selectivity prior, making residual injection more likely on in-domain inputs while a learned scalar gate suppresses incoherent OOD retrievals. We evaluate on Qwen3-4B and Qwen3-8B with AG-News and MedMCQA as adaptation tasks and OOD benchmarks spanning reasoning, translation, code generation, and legal reasoning. Engram Adapter improves in-domain accuracy while preserving 99.4%--100.1% of average OOD performance; on LegalBench it slightly exceeds the frozen base model on average, whereas comparable always-on baselines degrade sharply. Mechanistic analyses show that although OOD activations are non-zero, gate and projection attenuation reduce residuals to approximately 0.08% of hidden-state norm, yielding small KL drift and negligible accuracy change. These results suggest conditional activation is a promising route toward modular, retention-preserving domain specialization over frozen backbones.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 20 of its 27 references that are in the map. First posted on arXiv 29 Aug 2026.
Builds on
20 of 27 references.
References · 20
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
- 2025Qwen3 Technical Reportcited by 8,195
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,293
- 2020REALM: Retrieval-Augmented Language Model Pre-Trainingcited by 2,126
- 2018Experience Replay for Continual Learningcited by 1,074
- 2022Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learningcited by 886
- 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
8 more
- 2019Generalization through Memorization: Nearest Neighbor Language Modelscited by 788
- 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 780
- 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 740
- 2022MedMCQA : A Large-scale Multi-Subject Multi-Choice Dataset for Medical domain Question Answeringcited by 525
- 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 337
- 2024PiSSA: Principal Singular Values and Singular Vectors Adaptation of Large Language Modelscited by 261
- 2026Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Modelscited by 78
- 2025SFT Doesn't Always Hurt General Capabilities: Revisiting Domain-Specific Fine-Tuning in LLMscited by 23
Built on by
Citing papers per year: 2026: 1.
1 paper.