mlsanityData to 7 Oct 2026

Low-Rank Adapters Meet Neural Architecture Search for LLM Compression

arXiv 2501.16372 ↗First posted 23 Jan 2025cs.LG cs.AI cs.CLcited by 4

Not on the map. Why?

Abstract (arXiv)

The rapid expansion of Large Language Models (LLMs) has posed significant challenges regarding the computational resources required for fine-tuning and deployment. Recent advancements in low-rank adapters have demonstrated their efficacy in parameter-efficient fine-tuning (PEFT) of these models. This retrospective paper comprehensively discusses innovative approaches that synergize low-rank representations with Neural Architecture Search (NAS) techniques, particularly weight-sharing super-networks. Robust solutions for compressing and fine-tuning large pre-trained models are developed by integrating these methodologies. Our analysis highlights the potential of these combined strategies to democratize the use of LLMs, making them more accessible for deployment in resource-constrained environments. The resulting models exhibit reduced memory footprints and faster inference times, paving the way for more practical and scalable applications of LLMs. Models and code are available at https://github.com/IntelLabs/Hardware-Aware-Automated-Machine-Learning.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 5 of its 9 references that are in the map. First posted on arXiv 23 Jan 2025.

Builds on

5 of 9 references.

References · 5

  1. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  2. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
  3. 2021Are NLP Models really able to Solve Simple Math Word Problems?cited by 861
  4. 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 778
  5. 2024SQFT: Low-cost Model Adaptation in Low-precision Sparse Foundation Modelscited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 3.

4 papers.