mlsanityData to 14 Oct 2026

Restoring Pruned Large Language Models via Lost Component Compensation

arXiv 2510.21834 ↗First posted 22 Oct 2025cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Pruning is a widely used technique to reduce the size and inference cost of large language models (LLMs), but it often causes performance degradation. To mitigate this, existing restoration methods typically employ parameter-efficient fine-tuning (PEFT), such as LoRA, to recover the pruned model's performance. However, most PEFT methods are designed for dense models and overlook the distinct properties of pruned models, often resulting in suboptimal recovery. In this work, we propose a targeted restoration strategy for pruned models that restores performance while preserving their low cost and high efficiency. We observe that pruning-induced information loss is reflected in attention activations, and selectively reintroducing components of this information can significantly recover model performance. Based on this insight, we introduce RestoreLCC (Restoring Pruned LLMs via Lost Component Compensation), a plug-and-play method that contrastively probes critical attention heads via activation editing, extracts lost components from activation differences, and finally injects them back into the corresponding pruned heads for compensation and recovery. RestoreLCC is compatible with structured, semi-structured, and unstructured pruning schemes. Extensive experiments demonstrate that RestoreLCC consistently outperforms state-of-the-art baselines in both general and task-specific performance recovery, without compromising the sparsity or inference efficiency of pruned models.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 44 of its 52 references that are in the map. First posted on arXiv 22 Oct 2025.

Builds on

44 of 52 references.

References · 44

  1. 2023GPT-4 Technical Reportcited by 18,396
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  3. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  4. 2025Qwen3 Technical Reportcited by 8,820
  5. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,626
  6. 2024Qwen2.5 Technical Reportcited by 4,942
  7. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  8. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  9. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
  10. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  11. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
  12. 2016Pointer Sentinel Mixture Modelscited by 3,096
32 more
  1. 2022Locating and Editing Factual Associations in GPTcited by 2,691
  2. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  3. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
  4. 2020MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformerscited by 1,463
  5. 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,336
  6. 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,165
  7. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
  8. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
  9. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
  10. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
  11. 2023Model Tells You What to Discard: Adaptive KV Cache Compression for LLMscited by 474
  12. 2021Compacter: Efficient Low-Rank Hypercomplex Adapter Layerscited by 460
  13. 2023Function Vectors in Large Language Modelscited by 308
  14. 2021Parameter-efficient Multi-task Fine-tuning for Transformers via Shared Hypernetworkscited by 284
  15. 2023Camels in a Changing Climate: Enhancing LM Adaptation with Tulu 2cited by 229
  16. 2021Accelerating Sparse Deep Neural Networkscited by 223
  17. 2024ReFT: Representation Finetuning for Language Modelscited by 197
  18. 2022Analyzing Transformers in Embedding Spacecited by 132
  19. 2023Fluctuation-based Adaptive Structured Pruning for Large Language Modelscited by 111
  20. 2023Residual Prompt Tuning: Improving Prompt Tuning with Residual Reparameterizationcited by 64
  21. 2023Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMscited by 61
  22. 2024LoFiT: Localized Fine-tuning on LLM Representationscited by 57
  23. 2023LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuningcited by 53
  24. 2024Interpreting and Improving Large Language Models in Arithmetic Calculationcited by 45
  25. 2024SlimGPT: Layer-wise Structured Pruning for Large Language Modelscited by 44
  26. 2024Advancing Parameter Efficiency in Fine-tuning via Representation Editingcited by 37
  27. 2023Compresso: Structured Pruning with Collaborative Prompting Learns Compact Large Language Modelscited by 19
  28. 2024ALPS: Improved Optimization for Highly Sparse One-Shot Pruning for Large Language Modelscited by 19
  29. 2024AFLoRA: Adaptive Freezing of Low Rank Adaptation in Parameter Efficient Fine-Tuning of Large Modelscited by 15
  30. 2025DRESSing Up LLM: Efficient Stylized Question-Answering via Style Subspace Editingcited by 10
  31. 2022Overparameterized random feature regression with nearly orthogonal datacited by 7
  32. 2020Using noise to probe recurrent neural network structure and prune synapsescited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 3.

3 papers.