ZeroLM: Data-Free Transformer Architecture Search for Language Models

Zhen-Song Chen, Hong-Wei Ding, Xian-Jia Wang, Witold Pedrycz
3/24/2025
cs.CL

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{chen2025zerolm,
  title  = {ZeroLM: Data-Free Transformer Architecture Search for Language Models},
  author = {Zhen-Song Chen and Hong-Wei Ding and Xian-Jia Wang and Witold Pedrycz},
  year   = {2025},
  eprint = {2503.18646},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2503.18646v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2503.18646.svg)](https://codeofpaper.com/paper/2503.18646)

Discussion