FuRA: Full-Rank Parameter-Efficient Fine-Tuning with Spectral Preconditioning
Not on the map. Why?
Abstract (arXiv)
Both full fine-tuning (Full FT) and parameter-efficient fine-tuning methods such as LoRA introduce weight updates without accounting for the spectral structure established during pretraining. As a result, noisy gradients from limited fine-tuning data can perturb robust pretrained features. We identify spectral preconditioning as the missing ingredient: reparameterizing each weight matrix through its full-rank singular value decomposition (SVD) and freezing one singular basis constrains updates to the pretrained column space, yielding a preconditioned optimization scheme that outperforms unconstrained Full FT at the same trainable parameter count. Building on this insight, we propose FuRA (Full-Rank Adaptation), an efficient full-rank adaptation framework based on a block tensor-train factorization W = LSR, where the large core L is fixed to the pretrained block-wise SVD basis, while only the compact core R and the block-wise singular values S are optimized. This design simultaneously provides full-rank spectral preconditioning, preserves full-rank update expressivity, and achieves parameter, memory, and step-time efficiency comparable to LoRA. FuRA consistently outperforms Full FT across multiple settings, including LLM fine-tuning (+1.37 on LLaMA-3-8B commonsense reasoning), LLM reinforcement learning for mathematical reasoning, and visual instruction tuning for VLMs. Furthermore, the 4-bit quantized variant, QFuRA, also surpasses QLoRA. Code is available at https://github.com/olokevin/FuRA-NIPS
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 41 of its 50 references that are in the map. First posted on arXiv 19 May 2026.
Builds on
41 of 50 references.
References · 41
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
- 2025Qwen3 Technical Reportcited by 8,195
- 2023Visual Instruction Tuningcited by 7,792
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2024Qwen2.5 Technical Reportcited by 4,713
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
29 more
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,678
- 2016Making the V in VQA Matter: Elevating the Role of Image Understanding in Visual Question Answeringcited by 2,498
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
- 2023MMBench: Is Your Multi-modal Model an All-around Player?cited by 2,105
- 2022Learn to Explain: Multimodal Reasoning via Thought Chains for Science Question Answeringcited by 1,881
- 2019Towards VQA Models That Can Readcited by 1,696
- 2023Evaluating Object Hallucination in Large Vision-Language Modelscited by 1,696
- 2018VizWiz Grand Challenge: Answering Visual Questions from Blind Peoplecited by 852
- 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 740
- 2023MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Modelscited by 724
- 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 337
- 2023LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language Modelscited by 317
- 2024PiSSA: Principal Singular Values and Singular Vectors Adaptation of Large Language Modelscited by 261
- 2015Tensorizing Neural Networkscited by 246
- 2023Parameter-Efficient Orthogonal Finetuning via Butterfly Factorizationcited by 112
- 2024MiLoRA: Harnessing Minor Singular Components for Parameter-Efficient LLM Finetuningcited by 89
- 2024Parameter-Efficient Fine-Tuning with Discrete Fourier Transformcited by 67
- 2024SVFT: Parameter-Efficient Fine-Tuning with Singular Vectorscited by 57
- 2025RandLoRA: Full-rank parameter-efficient fine-tuning of large modelscited by 34
- 2024Compute Better Spent: Replacing Dense Layers with Structured Matricescited by 24
- 2024QuanTA: Efficient High-Rank Fine-Tuning of LLMs with Quantum-Informed Tensor Adaptationcited by 23
- 2024Spectral Adapter: Fine-Tuning in Spectral Spacecited by 21
- 2025Evaluating Parameter Efficient Methods for RLVRcited by 12
- 2025LIFT the Veil for the Truth: Principal Weights Emerge after Rank Reduction for Reasoning-Focused Supervised Fine-Tuningcited by 11
- 2024LoRTA: Low Rank Tensor Adaptation of Large Language Modelscited by 5
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2024Riemannian Preconditioned LoRA for Fine-Tuning Foundation Models
- 2026Beyond Low-Rank Parameterization: Narrowing the Gap Between LoRA and Full Fine-Tuning via Gradient Decomposition
- 2026Zeta: Dual Whitening for Matrix Optimization via Coordinate-Adaptive Preconditioning
- 2025TuckA: Hierarchical Compact Tensor Experts for Efficient Fine-Tuning
- 2025Revisiting LoRA through the Lens of Parameter Redundancy: Spectral Encoding Helps
- 2026AdaPreLoRA: Adafactor Preconditioned Low-Rank Adaptation
- 2025A Stronger Mixture of Low-Rank Experts for Fine-Tuning Foundation Models
- 2026Spectral Weight Decay: Inducing Low-Rank Structure in Neural Network Weights