GPart: End-to-End Isometric Fine-Tuning via Global Parameter Partitioning
cs.LG, cs.AI
Submitted: 2026-05-14
Updated: 2026-10-02
Comments: Code available at https://github.com/SamsungLabs/GPart
Code: https://github.com/SamsungLabs/GPart
License: http://creativecommons.org/licenses/by/4.0/
The gist: Low-rank adaptation (LoRA) has become a dominant paradigm for parameter-efficient fine-tuning (PEFT) of large-scale deep learning models.
Terminology
Abstract
Low-rank adaptation (LoRA) has become a dominant paradigm for parameter-efficient fine-tuning (PEFT) of large-scale deep learning models. However, its bilinear parameterization induces a parameter-dependent geometry: the mapping from trainable parameters to weight updates is not generally distance-preserving. Related methods that project a low-dimensional vector into LoRA's parameter space, such as Uni-LoRA, improve parameter efficiency, but the subsequent bilinear map breaks end-to-end isometry. We propose GPart (Global Partition fine-tuning), a highly parameter-efficient fine-tuning method that maps a d-dimensional trainable vector directly into the full weight space through a sparse, isometric partition matrix. GPart retains a fixed global parameter-sharing prior while removing the additional low-rank reconstruction used by LoRA-based methods. This yields a simple parameterization with a single main hyperparameter (d), exact end-to-end isometry, and a minimal checkpoint representation consisting of the trainable vector and a random seed. GPart builds on the premise of effective fine-tuning within random low-dimensional subspaces of the full weight space without requiring a low-rank matrix factorization. Across natural language understanding, computer vision, and mathematical reasoning benchmarks, GPart matches or improves over existing PEFT methods at ultra-low parameter budgets. Beyond offering mathematical tractability and memory efficiency, the direct linear parameterization of GPart streamlines model selection and paves the way for compact adapter composition. Overall, GPart provides an elegant and competitive alternative for fine-tuning under small parameter budgets, with a fixed and predictable geometry between trainable coordinates and weight-space updates.
Sources
- Fine-Tuned 'Small' LLMs (Still) Significantly Outperform Zero-Shot Generative AI Models in Text Classification
- Compressing Neural Networks with the Hashing Trick
- Training Verifiers to Solve Math Word Problems
- DELLA-Merging: Reducing Interference in Model Merging through Magnitude-Based Sampling
- The Llama 3 Herd of Models
- HiLoRA: Adaptive Hierarchical LoRA Routing for Training-Free Domain Generalization
- A Rank Stabilization Scaling Factor for Fine-Tuning with LoRA
- Learning Rate Matters: Vanilla LoRA May Suffice for LLM Fine-tuning
- LoftQ: LoRA-Fine-Tuning-Aware Quantization for Large Language Models
- RoBERTa: A Robustly Optimized BERT Pretraining Approach
- PiSSA: Principal Singular Values and Singular Vectors Adaptation of Large Language Models
- Fine-tuning for Better Few Shot Prompting: An Empirical Comparison for Short Answer Grading
- Qwen2.5 Technical Report
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks