mlsanityData to 14 Oct 2026

SimDiff: Depth Pruning via Similarity and Difference

arXiv 2604.19520 ↗First posted 21 Apr 2026cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Depth pruning improves the deployment efficiency of large language models (LLMs) by identifying and removing redundant layers. A widely accepted standard for this identification process is to measure the similarity between layers using cosine distance. However, we find that methods relying solely on this one-dimensional heuristic can exhibit unpredictable performance and even catastrophic collapse across different architectures. To address this issue, we propose SimDiff, a novel layer importance criterion that jointly evaluates layers from two orthogonal perspectives: representational similarity and transformation difference. The difference is quantified using two distinct metrics: MSSD, which is sensitive to outliers and identifies layers that make decisive corrections, and MASD, which robustly measures a layer's average contribution. Extensive experiments on multiple models ranging from 0.5B to 13B parameters demonstrate that SimDiff significantly outperforms state-of-the-art baselines across various pruning ratios. Notably, our method retains over 91% of LLaMA2-7B's performance at a 25% pruning ratio and achieves up to a 1.49x inference speedup when pruning 12 layers on LLaMA3.1-8B. We also show that pruned models can be effectively recovered with minimal fine-tuning.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 25 of its 33 references that are in the map. First posted on arXiv 21 Apr 2026.

Builds on

25 of 33 references.

References · 25

  1. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  2. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  3. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  4. 2016Pointer Sentinel Mixture Modelscited by 3,096
  5. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  6. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  7. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
  8. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
  9. 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 861
  10. 2018CoQA: A Conversational Question Answering Challengecited by 683
  11. 2019MathQA: Towards Interpretable Math Word Problem Solving with Operation-Based Formalismscited by 662
  12. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
13 more
  1. 2023CMMLU: Measuring massive multitask language understanding in Chinesecited by 449
  2. 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 385
  3. 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 383
  4. 2021XL-Sum: Large-Scale Multilingual Abstractive Summarization for 44 Languagescited by 347
  5. 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 165
  6. 2024LaCo: Large Language Model Pruning via Layer Collapsecited by 126
  7. 2024SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blockscited by 97
  8. 2024Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methodscited by 82
  9. 2019Investigating Prior Knowledge for Challenging Chinese Machine Reading Comprehensioncited by 81
  10. 2018A Systematic Classification of Knowledge, Reasoning, and Context within the ARC Datasetcited by 55
  11. 2023The Emergence of Essential Sparsity in Large Pre-trained Models: The Weights that Mattercited by 42
  12. 2025DLP: Dynamic Layerwise Pruning in Large Language Modelscited by 6
  13. 2025Entropy-Based Block Pruning for Efficient Large Language Modelscited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026Rethinking Layer Redundancy: Calibration Matters More Than Search in LLM Depth Pruning
  2. 2025The Structural Scalpel: Automated Contiguous Layer Pruning for Large Language Models
  3. 2026GradMAP: Faster Layer Pruning with Gradient Metric and Projection Compensation
  4. 2025Pruning Laws for Large Language Models
  5. 2025E3-Pruner: Towards Efficient, Economical, and Effective Layer Pruning for Large Language Models
  6. 2024FinerCut: Finer-grained Interpretable Layer Pruning for Large Language Models
  7. 2026Adaptive Depth Sparse Framework: Similarity-Driven Resource Allocation for Pre-Trained LLMs
  8. 2024Streamlining Redundant Layers to Compress Large Language Models