ZeroLM: Data-Free Transformer Architecture Search for Language Models
Not on the map. Why?
Abstract (arXiv)
Neural architecture search (NAS) provides a systematic framework for automating the design of neural network architectures, yet its widespread adoption is hindered by prohibitive computational requirements. Existing zero-cost proxy methods, while reducing search overhead, demonstrate inadequate performance in architecture ranking tasks, particularly for Transformer-based models where they often underperform simple parameter counting metrics. Current automated proxy discovery approaches suffer from extended search times, susceptibility to data overfitting, and structural complexity. This paper introduces a novel zero-cost proxy methodology that quantifies model capacity through efficient weight statistics computation while decomposing Transformer architectures into functionally distinct sub-modules, thereby optimizing the balance of their contributions to overall performance. Our comprehensive evaluation demonstrates the superiority of this approach, achieving a Spearman's rho of 0.76 and Kendall's tau of 0.53 on the FlexiBERT benchmark. The proposed method exhibits exceptional computational efficiency while maintaining robust performance across diverse NAS benchmark tasks, offering a practical solution for large-scale architecture search.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 45 of its 56 references that are in the map. First posted on arXiv 24 Mar 2025.
Builds on
45 of 56 references.
References · 45
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
33 more
- 2018DARTS: Differentiable Architecture Searchcited by 1,798
- 2016Understanding deep learning requires rethinking generalizationcited by 1,674
- 2016Neural Architecture Search with Reinforcement Learningcited by 1,499
- 2017Learning Transferable Architectures for Scalable Image Recognitioncited by 1,101
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
- 2019Are Sixteen Heads Really Better than One?cited by 816
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 763
- 2019Is BERT Really Robust? A Strong Baseline for Natural Language Attack on Text Classification and Entailmentcited by 671
- 2017The Implicit Bias of Gradient Descent on Separable Datacited by 655
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
- 2017Exploring Generalization in Deep Learningcited by 600
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 479
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 471
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 385
- 2015Norm-Based Capacity Control in Neural Networkscited by 299
- 2020Neural Architecture Search without Trainingcited by 244
- 2021Zero-Cost Proxies for Lightweight NAScited by 199
- 2021Neural Architecture Search on ImageNet in Four GPU Hours: A Theoretically Inspired Perspectivecited by 169
- 2020Predicting trends in the quality of state-of-the-art neural networks without access to training or testing datacited by 115
- 2023Fluctuation-based Adaptive Structured Pruning for Large Language Modelscited by 111
- 2024SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blockscited by 97
- 2024Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methodscited by 82
- 2021Zen-NAS: A Zero-Shot NAS for High-Performance Deep Image Recognitioncited by 73
- 2022Training-free Transformer Architecture Searchcited by 33
- 2019BlockSwap: Fisher-guided Block Substitution for Network Compression on a Budgetcited by 26
- 2022EZNAS: Evolving Zero Cost Proxies For Neural Architecture Scoringcited by 15
- 2022LiteTransformerSearch: Training-free Neural Architecture Search for Efficient Language Modelscited by 14
- 2024Search for Efficient Large Language Modelscited by 14
- 2022FreeREA: Training-Free Evolution-based Architecture Searchcited by 10
- 2023Training-free Neural Architecture Search for RNNs and Transformerscited by 9
- 2024LPZero: Language Model Zero-cost Proxy Search from Zerocited by 7
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.