FRoD: Full-Rank Efficient Fine-Tuning with Rotational Degrees for Fast Convergence
Guoan Wan, Tianyu Chen, Fangzheng Feng, Haoyi Zhou, Runhua Xu

TL;DR
FRoD is a novel parameter-efficient fine-tuning method that combines hierarchical decomposition and rotational degrees to achieve full-rank updates, resulting in faster convergence and comparable accuracy to full fine-tuning across diverse tasks.
Contribution
FRoD introduces a full-rank, efficient fine-tuning approach using hierarchical joint decomposition and rotational degrees, surpassing low-rank methods in expressiveness and convergence speed.
Findings
Matches full fine-tuning accuracy on 20 benchmarks.
Uses only 1.72% of trainable parameters.
Achieves faster convergence and robustness.
Abstract
Parameter-efficient fine-tuning (PEFT) methods have emerged as a practical solution for adapting large foundation models to downstream tasks, reducing computational and memory costs by updating only a small subset of parameters. Among them, approaches like LoRA aim to strike a balance between efficiency and expressiveness, but often suffer from slow convergence and limited adaptation capacity due to their inherent low-rank constraints. This trade-off hampers the ability of PEFT methods to capture complex patterns needed for diverse tasks. To address these challenges, we propose FRoD, a novel fine-tuning method that combines hierarchical joint decomposition with rotational degrees of freedom. By extracting a globally shared basis across layers and injecting sparse, learnable perturbations into scaling factors for flexible full-rank updates, FRoD enhances expressiveness and efficiency,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Advanced Neural Network Applications · Generative Adversarial Networks and Image Synthesis
