ReplaceMe: Network Simplification via Depth Pruning and Transformer Block Linearization
Not on the map. Why?
Abstract (arXiv)
We introduce ReplaceMe, a generalized training-free depth pruning method that effectively replaces transformer blocks with a linear operation, while maintaining high performance for low compression ratios. In contrast to conventional pruning approaches that require additional training or fine-tuning, our approach requires only a small calibration dataset that is used to estimate a linear transformation, which approximates the pruned blocks. The estimated linear mapping can be seamlessly merged with the remaining transformer blocks, eliminating the need for any additional network parameters. Our experiments show that ReplaceMe consistently outperforms other training-free approaches and remains highly competitive with state-of-the-art pruning methods that involve extensive retraining/fine-tuning and architectural modifications. Applied to several large language models (LLMs), ReplaceMe achieves up to 25% pruning while retaining approximately 90% of the original model's performance on open benchmarks - without any training or healing steps, resulting in minimal computational overhead. We provide an open-source library implementing ReplaceMe alongside several state-of-the-art depth pruning techniques, available at https://github.com/mts-ai/ReplaceMe
Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). Builds on 35 of its 52 references that are in the map. First posted on arXiv 5 May 2025.
Builds on
35 of 52 references.
References · 35
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2014Microsoft COCO: Common Objects in Contextcited by 17,608
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,307
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
23 more
- 2019Similarity of Neural Network Representations Revisitedcited by 1,755
- 2017EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classificationcited by 1,496
- 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,160
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 861
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2017Crowdsourcing Multiple Choice Science Questionscited by 765
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
- 2023CMMLU: Measuring massive multitask language understanding in Chinesecited by 449
- 2019A Large-scale Study of Representation Learning with the Visual Task Adaptation Benchmarkcited by 425
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 383
- 2018Insights on representational similarity in neural networks with canonical correlationcited by 324
- 2020CLUE: A Chinese Language Understanding Evaluation Benchmarkcited by 278
- 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 243
- 2024The Unreasonable Ineffectiveness of the Deeper Layerscited by 226
- 2024Compact Language Models via Pruning and Knowledge Distillationcited by 148
- 2023Fluctuation-based Adaptive Structured Pruning for Large Language Modelscited by 111
- 2024Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methodscited by 82
- 2019Investigating Prior Knowledge for Challenging Chinese Machine Reading Comprehensioncited by 81
- 2019ChID: A Large-scale Chinese IDiom Dataset for Cloze Testcited by 65
- 2023The LLM Surgeoncited by 38
- 2024Your Transformer is Secretly Linearcited by 23
- 2022Exploring Extreme Parameter Compression for Pre-trained Language Modelscited by 15
Built on by
Citing papers per year: 2025: 1; 2026: 12.
13 papers.
Sort:
By area:
- 2025CoSpaDi: Compressing LLMs via Calibration-Guided Sparse Dictionary Learningcited by 6
- 2026TACTICL: Task-Aware Compression of Tabular ICL Modelscited by 4
- 2026Ghosted Layers: Unconstrained Activation Alignment for Recovering Layer-Pruned LLMscited by 2
- 2026It Takes a MAESTRO To Prune Bad Expertscited by 2
- 2026COMPOT: Calibration-Optimized Matrix Procrustes Orthogonalization for Transformers Compressioncited by 1
- 2026Dynamic Mode Decomposition along Depth in Vision Transformerscited by 0
- 2026Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimizationcited by 0
- 2026SHIFT-LLM: Distribution Shift Correction in Depth-Pruned LLMscited by 0
- 2026XMerge: Cross-Axis Selection and Reconstructive Layer Merging for LLM Depth Compressioncited by 0
- 2026Does the VGGT Family Need All Its Layers?cited by 0
- 2026Tabular Foundation Models Are Effectively Shallowcited by 0
- 2026Coarse-Graining Recursive Expert Computation: Continuation-Relative Interfaces and Failure Modescited by 0
- 2026Retraining-Free Depth Pruning of Vision Transformers: A Cross Domain Study of Layer Redundancy10 Oct 2026
- 2026Coarse-Graining Recursive Expert Computation: Continuation-Relative Interfaces and Failure Modes10 Oct 2026
- 2026Tabular Foundation Models Are Effectively Shallow9 Oct 2026
- 2026Does the VGGT Family Need All Its Layers?29 Sep 2026
- 2026XMerge: Cross-Axis Selection and Reconstructive Layer Merging for LLM Depth Compression2 Sep 2026
- 2026SHIFT-LLM: Distribution Shift Correction in Depth-Pruned LLMs25 Aug 2026
- 2026Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization13 Aug 2026
- 2026TACTICL: Task-Aware Compression of Tabular ICL Models11 Aug 2026
- 2026It Takes a MAESTRO To Prune Bad Experts9 Jul 2026
- 2026Ghosted Layers: Unconstrained Activation Alignment for Recovering Layer-Pruned LLMs15 May 2026
- 2026Dynamic Mode Decomposition along Depth in Vision Transformers8 May 2026
- 2026COMPOT: Calibration-Optimized Matrix Procrustes Orthogonalization for Transformers Compression16 Feb 2026
1 more
- 2026It Takes a MAESTRO To Prune Bad Expertscited by 2
- 2026It Takes a MAESTRO To Prune Bad Experts9 Jul 2026
- 2025CoSpaDi: Compressing LLMs via Calibration-Guided Sparse Dictionary Learningcited by 6
- 2026TACTICL: Task-Aware Compression of Tabular ICL Modelscited by 4
- 2026Ghosted Layers: Unconstrained Activation Alignment for Recovering Layer-Pruned LLMscited by 2
- 2026COMPOT: Calibration-Optimized Matrix Procrustes Orthogonalization for Transformers Compressioncited by 1
- 2026Dynamic Mode Decomposition along Depth in Vision Transformerscited by 0
- 2026Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimizationcited by 0
- 2026SHIFT-LLM: Distribution Shift Correction in Depth-Pruned LLMscited by 0
- 2026XMerge: Cross-Axis Selection and Reconstructive Layer Merging for LLM Depth Compressioncited by 0
- 2026Does the VGGT Family Need All Its Layers?cited by 0
- 2026Tabular Foundation Models Are Effectively Shallowcited by 0
- 2026Coarse-Graining Recursive Expert Computation: Continuation-Relative Interfaces and Failure Modescited by 0
- 2026Retraining-Free Depth Pruning of Vision Transformers: A Cross Domain Study of Layer Redundancycited by 0
- 2026Retraining-Free Depth Pruning of Vision Transformers: A Cross Domain Study of Layer Redundancy10 Oct 2026
- 2026Coarse-Graining Recursive Expert Computation: Continuation-Relative Interfaces and Failure Modes10 Oct 2026
- 2026Tabular Foundation Models Are Effectively Shallow9 Oct 2026
- 2026Does the VGGT Family Need All Its Layers?29 Sep 2026
- 2026XMerge: Cross-Axis Selection and Reconstructive Layer Merging for LLM Depth Compression2 Sep 2026
- 2026SHIFT-LLM: Distribution Shift Correction in Depth-Pruned LLMs25 Aug 2026
- 2026Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization13 Aug 2026
- 2026TACTICL: Task-Aware Compression of Tabular ICL Models11 Aug 2026
- 2026Ghosted Layers: Unconstrained Activation Alignment for Recovering Layer-Pruned LLMs15 May 2026
- 2026Dynamic Mode Decomposition along Depth in Vision Transformers8 May 2026
- 2026COMPOT: Calibration-Optimized Matrix Procrustes Orthogonalization for Transformers Compression16 Feb 2026
- 2025CoSpaDi: Compressing LLMs via Calibration-Guided Sparse Dictionary Learning26 Sep 2025