TraceNAS: Zero-shot LLM Pruning via Gradient Trace Correlation
Not on the map. Why?
Abstract (arXiv)
Structured pruning is essential for efficient deployment of Large Language Models (LLMs). The varying sensitivity of LLM sub-blocks to pruning necessitates the identification of optimal non-uniformly pruned models. Existing methods evaluate the importance of layers, attention heads, or weight channels in isolation. Such localized focus ignores the complex global structural dependencies that exist across the model. Training-aware structured pruning addresses global dependencies, but its computational cost can be just as expensive as post-pruning training. To alleviate the computational burden of training-aware pruning and capture global structural dependencies, we propose TraceNAS, a training-free Neural Architecture Search (NAS) framework that jointly explores structured pruning of LLM depth and width. TraceNAS identifies pruned models that maintain a high degree of loss landscape alignment with the pretrained model using a scale-invariant zero-shot proxy, effectively selecting models that exhibit maximal performance potential during post-pruning training. TraceNAS is highly efficient, enabling high-fidelity discovery of pruned models on a single GPU in 8.5 hours, yielding a 10× reduction in GPU-hours compared to training-aware methods. Evaluations on the Llama and Qwen families demonstrate that TraceNAS is competitive with training-aware baselines across commonsense and reasoning benchmarks.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 56 of its 74 references that are in the map. First posted on arXiv 2 Feb 2026.
Builds on
56 of 74 references.
References · 56
- 2017Attention Is All You Needcited by 59,932
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
38 more
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,838
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
- 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,104
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 778
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2017Crowdsourcing Multiple Choice Science Questionscited by 742
- 2024MiniCPM: Unveiling the Potential of Small Language Models with Scalable Training Strategiescited by 694
- 2020Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuningcited by 658
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
- 2020Estimating Training Data Influence by Tracing Gradient Descentcited by 565
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
- 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 447
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 408
- 2023Orca: Progressive Learning from Complex Explanation Traces of GPT-4cited by 369
- 2023LLM-QAT: Data-Free Quantization Aware Training for Large Language Modelscited by 320
- 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
- 2020Neural Architecture Search without Trainingcited by 241
- 2019Structured Pruning of Large Language Modelscited by 201
- 2021Zero-Cost Proxies for Lightweight NAScited by 194
- 2020BigNAS: Scaling Up Neural Architecture Search with Big Single-Stage Modelscited by 187
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 163
- 2023DataInf: Efficiently Estimating Data Influence in LoRA-tuned LLMs and Diffusion Modelscited by 121
- 2021BERT Busters: Outlier Dimensions that Disrupt Transformerscited by 110
- 2023Fluctuation-based Adaptive Structured Pruning for Large Language Modelscited by 110
- 2024LLM Pruning and Distillation in Practice: The Minitron Approachcited by 82
- 2024Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methodscited by 80
- 2023ZiCo: Zero-shot NAS via Inverse Coefficient of Variation on Gradientscited by 57
- 2022Pruning has a disparate impact on model accuracycited by 43
- 2024Flextron: Many-in-One Flexible Large Language Modelcited by 42
- 2024Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Modelscited by 40
- 2020Positional Artefacts Propagate Through Masked Language Model Embeddingscited by 34
- 2023Beyond Size: How Gradients Shape Pruning Decisions in Large Language Modelscited by 30
- 2025Wanda++: Pruning Large Language Models via Regional Gradientscited by 26
- 2024EvoPress: Accurate Dynamic Model Compression via Evolutionary Searchcited by 20
- 2024Puzzle: Distillation-Based NAS for Inference-Optimized LLMscited by 17
50 most cited of 56 All 56 (JSON)
Built on by
Not cited yet.