Paper Overview
Field: Machine Learning Authors: Jianghui Wang, Silong Yong, Francesco Orabona, Marco Canini, Katia P. Sycara, Yaqi Xie arXiv: 2607.22489
Abstract
Low-Rank Adaptation (LoRA) has become a widely adopted technique for efficient neural network fine-tuning, decomposing model updates into low-rank matrices. However, LoRA remains computationally costly because it updates all matrices uniformly, regardless of their actual contribution to adaptation. This cost is especially prohibitive for large-scale models with billions of parameters and for resource-constrained settings such as edge deployment and on-device fine-tuning.
The authors show for the first time that not all LoRA matrices are equally worth tuning: matrices with smaller condition numbers (the ratio of largest to smallest singular value) are already well-balanced across directions and contribute only marginally to adaptation, whereas matrices with larger condition numbers contain underdeveloped directions spanning richer subspaces and drive most of the performance gains. This observation itself is the paper's key contribution and motivates a more selective fine-tuning approach.
Method: Kappa-LoRA
Kappa-LoRA focuses updates on the matrices with the largest condition numbers, which capture the most informative directions of change. By restricting LoRA updates to the top 50% of weight matrices ranked by condition number, Kappa-LoRA:
- Halves the number of trainable parameters
- Proportionally reduces computation and memory costs
- Fine-tuning time is reduced by 16.2% on average
- Accuracy matches standard LoRA
- Memory costs are reduced by 4.5%
Results
Extensive experiments across multiple benchmarks show that:
---
*Auto-collected on 2026-07-28.*