mlsanityData to 7 Oct 2026

AdaGradSelect: An adaptive gradient-guided layer selection method for efficient fine-tuning of SLMs

arXiv 2512.15764 ↗First posted 12 Dec 2025cs.LG cs.AI cs.PFcited by 1

Not on the map. Why?

Abstract (arXiv)

Large Language Models (LLMs) can perform many NLP tasks well, but fully fine-tuning them is expensive and requires a lot of memory. Parameter-Efficient Fine-Tuning (PEFT) methods such as LoRA reduce this cost by adding small low-rank updates to frozen model weights. However, these methods restrict the training to a limited subspace, which can sometimes reduce performance. For Small Language Models (SLMs), where efficiency gains matter even more, we introduce AdaGradSelect, an adaptive method that selects which transformer blocks to update based on gradients. Early observations showed that updating only the transformer blocks with the highest gradient norms can achieve performance close to full fine-tuning. Building on this insight, AdaGradSelect adaptively chooses which blocks to train. It uses a combination of Dirichlet-based sampling, which depends on how frequently blocks were updated in the past, and an epsilon-greedy exploration strategy. This lets the method explore different blocks in early training and gradually focus on the most important ones in later epochs. Experiments show that AdaGradSelect trains about 12 percent faster and uses 35 percent less GPU memory while delivering performance very close to full fine-tuning. On the GSM8K dataset, it outperforms LoRA (rank 256) by about 3 percent on average across models such as Qwen2.5-0.5B, LLaMA3.2-1B, and Phi4-mini-3.8B. It also achieves similar accuracy on the MATH dataset. Overall, AdaGradSelect provides a more effective and resource-efficient alternative to traditional fine-tuning methods.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 14 of its 25 references that are in the map. First posted on arXiv 12 Dec 2025.

Builds on

14 of 25 references.

References · 14

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  2. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  3. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  4. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,304
  5. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
  6. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
  7. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
  8. 2023Code Llama: Open Foundation Models for Codecited by 2,105
  9. 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 434
  10. 2020Parameter-Efficient Transfer Learning with Diff Pruningcited by 351
  11. 2024Chain of LoRA: Efficient Fine-tuning of Language Models via Residual Learningcited by 80
  12. 2024SVFT: Parameter-Efficient Fine-Tuning with Singular Vectorscited by 57
2 more
  1. 2017FreezeOut: Accelerate Training by Progressively Freezing Layerscited by 54
  2. 2023FLAME: A small language model for spreadsheet formulascited by 15

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.