mlsanityData to 14 Oct 2026

GPart: End-to-End Isometric Fine-Tuning via Global Parameter Partitioning

arXiv 2605.14841 ↗First posted 14 May 2026cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 33 of its 36 references that are in the map. First posted on arXiv 14 May 2026.

Builds on

33 of 36 references.

References · 33

  1. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  2. 2024The Llama 3 Herd of Modelscited by 14,715
  3. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  4. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  5. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  6. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
  7. 2024Qwen2.5 Technical Reportcited by 4,942
  8. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  9. 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,245
  10. 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
  11. 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
  12. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
21 more
  1. 2023MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Modelscited by 735
  2. 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 694
  3. 2020Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuningcited by 671
  4. 2024LoRA+: Efficient Low Rank Adaptation of Large Modelscited by 377
  5. 2023VeRA: Vector-based Random Matrix Adaptationcited by 300
  6. 2024PiSSA: Principal Singular Values and Singular Vectors Adaptation of Large Language Modelscited by 269
  7. 2023A Rank Stabilization Scaling Factor for Fine-Tuning with LoRAcited by 243
  8. 2023LoftQ: LoRA-Fine-Tuning-Aware Quantization for Large Language Modelscited by 196
  9. 2015Compressing Neural Networks with the Hashing Trickcited by 150
  10. 2023Model Breadcrumbs: Scaling Multi-Task Model Merging with Sparse Maskscited by 133
  11. 2024DELLA-Merging: Reducing Interference in Model Merging through Magnitude-Based Samplingcited by 81
  12. 2014Fastfood: Approximate Kernel Expansions in Loglinear Timecited by 74
  13. 2024Towards Modular LLMs by Building and Reusing a Library of LoRAscited by 72
  14. 2024Parameter-Efficient Fine-Tuning with Discrete Fourier Transformcited by 71
  15. 2024Fine-Tuned 'Small' LLMs (Still) Significantly Outperform Zero-Shot Generative AI Models in Text Classificationcited by 70
  16. 2024MagMax: Leveraging Model Merging for Seamless Continual Learningcited by 67
  17. 2024Merging LoRAs like Playing LEGO: Pushing the Modularity of LoRA to Extremes Through Rank-Wise Clusteringcited by 59
  18. 2026Learning Rate Matters: Vanilla LoRA May Suffice for LLM Fine-tuningcited by 10
  19. 2025SpectR: Dynamically Composing LM Experts with Spectral Routingcited by 6
  20. 2025HiLoRA: Adaptive Hierarchical LoRA Routing for Training-Free Domain Generalizationcited by 4
  21. 2025Fine-tuning for Better Few Shot Prompting: An Empirical Comparison for Short Answer Gradingcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026Strategic Over-Parameterization for Generalizable Low-Rank Adaptation
  2. 2024LoRA Land: 310 Fine-tuned LLMs that Rival GPT-4, A Technical Report
  3. 2024LoRA-XS: Low-Rank Adaptation with Extremely Small Number of Parameters
  4. 2025Uni-LoRA: One Vector is All You Need
  5. 2025ScaLoRA: Optimally Scaled Low-Rank Adaptation for Efficient High-Rank Fine-Tuning
  6. 2025LoRA Is Slower Than You Think
  7. 2025Less is More: Resource-Efficient Low-Rank Adaptation
  8. 2026ChainDoRA: Tensor-Train Factorized Weight-Decomposed Low-Rank Adaptation for Parameter-Efficient LLM Fine-Tuning