LLM Compression with Neural Architecture Search
<|reference_start|>LLM Compression with Neural Architecture Search: Large language models (LLMs) exhibit remarkable reasoning abilities, allowing them to generalize across a wide range of downstream tasks, such as commonsense reasoning or instruction following. However, as LLMs scale, inference costs become increasingly prohibitive, accumulating significantly over their life cycle. This poses the question: Can we compress pre-trained LLMs to meet diverse size and latency requirements? We leverage Neural Architecture Search (NAS) to compress LLMs by pruning structural components, such as attention heads, neurons, and layers, aiming to achieve a Pareto-optimal balance between performance and efficiency. While NAS already achieved promising results on small language models in previous work, in this paper we propose various extensions that allow us to scale to LLMs. Compared to structural pruning baselines, we show that NAS improves performance up to 3.4% on MMLU with an on-device latency speedup.<|reference_end|>
@article{sukthanker2024large,
    title={Large Language Model Compression with Neural Architecture Search},
    author={Rhea Sanjay Sukthanker, Benedikt Staffler, Frank Hutter, Aaron Klein},
    journal={arXiv preprint arXiv:2410.06479},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.06479},
    primaryClass={cs.CL}
}