mlsanityData to 14 Oct 2026

LIFT the Veil for the Truth: Principal Weights Emerge after Rank Reduction for Reasoning-Focused Supervised Fine-Tuning

arXiv 2506.00772 ↗First posted 1 Jun 2025cs.LG cs.AI cs.CLcited by 12

On the map: LLM reasoning → Test-time compute and efficient thinking

Abstract (arXiv)

Recent studies have shown that supervised fine-tuning of LLMs on a small number of high-quality datasets can yield strong reasoning capabilities. However, full fine-tuning (Full FT), while powerful, is computationally expensive and susceptible to overfitting and catastrophic forgetting, particularly when data is limited. Sparse fine-tuning, which previously achieved notable success by updating only a small subset of model parameters, offers a promising trade-off between efficiency and effectiveness. Yet, it has lagged behind in the LLM era due to the difficulty of identifying parameters truly critical for reasoning. In this work, we state that weights with the largest magnitude after low-rank approximation are critical weights for fine-tuning, which we call Principal Weights. Surprisingly, while magnitude-based sparse fine-tuning performs poorly as a baseline on LLM fine-tuning, it becomes highly effective after rank reduction. These insights motivate our method: Low-rank Informed Sparse Fine-Tuning (LIFT). LIFT only updates the top 5% Principal Weights throughout training and consistently achieves better performance on reasoning tasks than Full FT, while maintaining memory efficiency on par with popular parameter-efficient fine-tuning methods. In addition to strong performance on target domains such as arithmetic reasoning, LIFT also retains up to 20% more source-domain knowledge, compared to Full FT and LoRA. Our code is available at: https://github.com/zihanghliu/LIFT.

Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 26 of its 59 references that are in the map. First posted on arXiv 1 Jun 2025.

Builds on

26 of 59 references.

Closest ancestors · 1

Same direction, newest first

  1. 2025s1: Simple test-time scaling31 Jan

Other references · 25

  1. 2024The Llama 3 Herd of Modelscited by 14,715
  2. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  3. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  4. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  5. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
  6. 2024Qwen2.5 Technical Reportcited by 4,942
  7. 2023Mistral 7Bcited by 3,164
  8. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
  9. 2025Does Reinforcement Learning Really Incentivize Reasoning Capacity in LLMs Beyond the Base Model?cited by 982
  10. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
  11. 2017Spectrally-normalized margin bounds for neural networkscited by 686
  12. 2025SFT Memorizes, RL Generalizes: A Comparative Study of Foundation Model Post-trainingcited by 672
13 more
  1. 2023Dissecting Recall of Factual Associations in Auto-Regressive Language Modelscited by 528
  2. 2025LIMO: Less is More for Reasoningcited by 498
  3. 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 403
  4. 2020Parameter-Efficient Transfer Learning with Diff Pruningcited by 352
  5. 2017A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networkscited by 314
  6. 2024Assessing the Brittleness of Safety Alignment via Pruning and Low-Rank Modificationscited by 231
  7. 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 165
  8. 2021Raise a Child in Large Language Model: Towards Effective and Generalizable Fine-tuningcited by 146
  9. 2024MiLoRA: Harnessing Minor Singular Components for Parameter-Efficient LLM Finetuningcited by 94
  10. 2019Stable Rank Normalization for Improved Generalization in Neural Networks and GANscited by 41
  11. 2024From Low Rank Gradient Subspace Stabilization to Low-Rank Weights: Observations, Theories, and Applicationscited by 25
  12. 2024A Random Matrix Theory Perspective on the Spectrum of Learned Features and Asymptotic Generalization Capabilitiescited by 16
  13. 2024Outlier-weighed Layerwise Sampling for LLM Fine-tuningcited by 8

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 5; 2026: 7.

12 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025The First Few Tokens Are All You Need: An Efficient and Effective Unsupervised Prefix Fine-Tuning Method for Reasoning Models
  2. 2026Data Repetition Beats Data Scaling in Long-CoT Supervised Fine-Tuning
  3. 2023Scaling Relationship on Learning Mathematical Reasoning with Large Language Models
  4. 2025Enhancing Large Language Model Reasoning via Selective Critical Token Fine-Tuning
  5. 2026Layer-Informed Fine-Tuning via Three-Stage Functional Segmentation of LLMs
  6. 2026Reasoning Quality Emerges Early: Data Curation for Reasoning Models
  7. 2025Unleashing the Reasoning Potential of Pre-trained LLMs by Critique Fine-Tuning on One Problem
  8. 2026Zipping the Thought: When and How Compressed Reasoning Data Works in LLM Post-Training