mlsanityData to 14 Oct 2026

EvoPress: Accurate Dynamic Model Compression via Evolutionary Search

arXiv 2410.14649 ↗First posted 18 Oct 2024cs.LGcited by 20

Not on the map. Why?

Abstract (arXiv)

The high computational costs of large language models (LLMs) have led to a flurry of research on LLM compression, via methods such as quantization, sparsification, or structured pruning. A new frontier in this area is given by dynamic, non-uniform compression methods, which adjust the compression levels (e.g., sparsity) per-block or even per-layer in order to minimize accuracy loss, while guaranteeing a global compression threshold. Yet, current methods rely on estimating the importance of a given layer, implicitly assuming that layers contribute independently to the overall compression error. We begin from the motivating observation that this independence assumption does not generally hold for LLM compression: pruning a model further may even significantly recover performance. To address this, we propose EvoPress, a novel evolutionary framework for dynamic LLM compression. By formulating dynamic compression as a general optimization problem, EvoPress identifies optimal compression profiles in a highly efficient manner, and generalizes across diverse models and compression techniques. Via EvoPress, we achieve state-of-the-art performance for dynamic compression of Llama, Mistral, and Phi models, setting new benchmarks for structural pruning (block/layer dropping), unstructured sparsity, and quantization with dynamic bitwidths. Our code is available at https://github.com/IST-DASLab/EvoPress}.

Key facts. Cited by 20 papers in the map (data through 14 Oct 2026). Builds on 31 of its 54 references that are in the map. First posted on arXiv 18 Oct 2024.

Builds on

31 of 54 references.

References · 31

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  2. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  3. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  4. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  5. 2023Mistral 7Bcited by 3,164
  6. 2016Pointer Sentinel Mixture Modelscited by 3,096
  7. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
  8. 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
  9. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
  10. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
  11. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
  12. 2021BRECQ: Pushing the Limit of Post-Training Quantization by Block Reconstructioncited by 479
19 more
  1. 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 378
  2. 2023SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compressioncited by 367
  3. 2022The case for 4-bit precision: k-bit Inference Scaling Lawscited by 251
  4. 2024Extreme Compression of Large Language Models via Additive Quantizationcited by 232
  5. 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 165
  6. 2021Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Maskscited by 103
  7. 2024SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blockscited by 97
  8. 2021NAS-BERT: Task-Agnostic and Adaptive-Size BERT Compression with Neural Architecture Searchcited by 56
  9. 2023ZipLM: Inference-Aware Structured Pruning of Language Modelscited by 49
  10. 2024BESA: Pruning Large Language Models with Blockwise Parameter-Efficient Sparsity Allocationcited by 45
  11. 2022SPDY: Accurate Pruning with Speedup Guaranteescited by 36
  12. 2017N2N Learning: Network to Network Compression via Policy Gradient Reinforcement Learningcited by 33
  13. 2021AutoTinyBERT: Automatic Hyper-parameter Optimization for Efficient Pre-trained Language Modelscited by 31
  14. 2023Weight subcloning: direct initialization of transformers using larger pretrained onescited by 30
  15. 2019Self-Adjusting Mutation Rates with Provably Optimal Success Rulescited by 13
  16. 2023Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optimacited by 5
  17. 2021Self-Adjusting Population Sizes for Non-Elitist Evolutionary Algorithms: Why Success Rates Mattercited by 4
  18. 2022Self-adjusting Population Sizes for the (1, λ)-EA on Monotone Functionscited by 3
  19. 2024Plus Strategies are Exponentially Slower for Planted Optima of Random Heightcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 7; 2026: 12.

20 papers.

Sort:

By area:

  1. 20252SSP: A Two-Stage Framework for Structured Pruning of LLMscited by 12
  2. 2025TAMP: Token-Adaptive Layerwise Pruning in Multimodal Large Language Modelscited by 9
  3. 2026Statistically-Lossless Quantization of Large Language Modelscited by 6
  4. 2025T'yr-the-Pruner: Structural Pruning LLMs via Global Sparsity Distribution Optimizationcited by 4
  5. 2025Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLMcited by 3
  6. 2026Model Compression with Exact Budget Constraints via Riemannian Manifoldscited by 3
  7. 2024From Pruning to Grafting: Dynamic Knowledge Redistribution via Learnable Layer Fusioncited by 2
  8. 2025One-for-All Pruning: A Universal Model for Customized Compression of Large Language Modelscited by 2
  9. 2025Think Before You Prune: Selective Self-Generated Calibration for Pruning Large Reasoning Modelscited by 2
  10. 2026Rethinking Layer Redundancy: Calibration Matters More Than Search in LLM Depth Pruningcited by 2
  11. 2025Optimal Formats for Weight Quantisationcited by 1
  12. 2026TraceNAS: Zero-shot LLM Pruning via Gradient Trace Correlationcited by 1
8 more
  1. 2026WiSparse: Boosting LLM Inference Efficiency with Weight-Aware Mixed Activation Sparsitycited by 1
  2. 2026No Free Swap: Protocol-Dependent Layer Redundancy in Transformerscited by 1
  3. 2026Beyond Layer Importance in Layer-wise Sparsity: An Inter-Layer Perturbation-Absorption Perspectivecited by 1
  4. 2026Prune, Update and Trim: Robust Structured Pruning for Large Language Modelscited by 0
  5. 2026Agentic evolution of physically constrained foundation modelscited by 0
  6. 2026Multi-Objective Structured Pruning of LLMs for Latency and Model Size Optimizationcited by 0
  7. 2026Correlation-Aware Structured Pruning for Large Language Modelscited by 0
  8. 2026Output-aware Residual Stream Pruning for Large Language Modelscited by 0

Similar, not cited

Close in wording, no citation either way

  1. 2023A Survey on Model Compression for Large Language Models
  2. 2023The Cost of Compression: Investigating the Impact of Compression on Parametric Knowledge in Language Models
  3. 2025When Compression Meets Model Compression: Memory-Efficient Double Compression for Large Language Models
  4. 2024A Comprehensive Survey of Compression Algorithms for Language Models
  5. 2023Compressing LLMs: The Truth is Rarely Pure and Never Simple
  6. 2025Semantic Retention and Extreme Compression in LLMs: Can We Have Both?
  7. 2025Optimizing LLMs for Resource-Constrained Environments: A Survey of Model Compression Techniques
  8. 2026Does Compression Preserve Uncertainty? A Unified Benchmark for Quantized and Sparse LLMs via Conformal Prediction