Skip to content
Conference Open access

Layer-wise Rank Allocation for Parameter-Efficient Fine-Tuning in Vision Transformers

2026 · ITM Web of Conferences · Vol 89, pp. 01005 · 0 citations · 12 references

TL;DR

It is suggested that placing different hierarchies increases parameter efficiency; hence, it is a viable method that can be used to efficiently fine-tune Vision Transformers.

Abstract

Vision Transformer (ViT) obtains state-of-the-art performance but is expensive to fine-tune because of the large number of parameters. Parameter-efficient tuning methods, such as LoRA, have been proposed. However, existing methods tend to ignore the hierarchical structure of representation learning and assume the same distributed-rank assignment for all layers. This paper offers a rank assignment technique for LoRA finetuning of Vision Transformer with layer-wise differential ranking rather than uniform, which gives better channel utilization efficiency. The test used the CIFAR-100 dataset with the ViT Tiny model. The testing results show that the method can achieve 0.8086 average accuracy while decreasing the tunable parameter ratio to 2.43% from the original 4.09%, which is an advantage over LoRA with its uniform rank. Additionally, the method is seed-agnostic, and thus, the approach is reasonably stable. These findings suggest that placing different hierarchies increases parameter efficiency; hence, it is a viable method that can be used to efficiently fine-tune Vision Transformers.

Read PDF

Similar papers

Preprint Aug 2026

Fine-Tuning of Transformer models with Frames

The experiments show that FrameFT achieves performance on par with/exceeding state-of-the-art PEFT techniques, but needs far fewer trainable parameters.

Harshavardhan Adepu, Li Zhang, Sanjiv Kumar et al. · 0 citations
Open access Oct 2026

CASQ: Configuration-Aware Sensitivity for Mixed-Precision Quantization of Vision Transformers

Deploying vision-transformer backbones on edge devices requires low-bit quantization, and mixed-precision methods must assign each layer a bit-width under a memory budget. Allocation is usually driven by per-layer sensitivity estimated from loss curvature (Hessian traces), following HAWQ. We propose CASQ (Configuration...

Luka Kričković, Vijay Kakani · 0 citations
#artificial intelligence Preprint Sep 2026

TaRA: Training-Aware Low-Rank Adaptation Initialization

Training-aware Low-Rank Adaptation Initialization (TaRA) is proposed, a method that initializes LoRA such that the gradients induced by the low-rank factors closely approximate the gradient of the corresponding full-rank weight matrix.

Taehyeon Kim, Eunhyeok Park · 0 citations
Open access 2026

Hierarchy-Aligned Learning Rates for Vision Networks

Asynchronous Learning Rate is proposed, which assigns depth-dependent initial learning rates to network modules according to their topological depth, and Smoothed Synchronous Decay is proposed, which coordinates the subsequent decay of heterogeneous parameter groups.

Qiang He, Qiu Zong, Yi-Qi Wang et al. · 0 citations
Open access Sep 2026

Parameter-Efficient Fine-Tuning of BERT: A Study of Fixed-Rank and Layer-Wise LoRA on SST-2

Parameter-efficient fine-tuning (PEFT) has emerged as a crucial method for adapting pretrained Transformer models to downstream tasks without the need to fine-tune the full set of model parameters. Low-Rank Adaptation (LoRA) is a technique that reduces the number of trainable parameters by representing weight updates w...

Zi-Jian-Ai-Yan-Di-Chen-Hong-Yu Liu · 0 citations
Aug 2026

SPIRA: Sparse Information-Geometric Rank Adaptation for Parameter-Efficient Fine-Tuning of Large Pretrained Models.

SPIRA is a PEFT framework that separates support discovery from parameter-efficient adaptation and remains competitive with representative PEFT baselines while using lower trainable-parameter budgets than several compared weight-side/LoRA-family baselines.

Zhong-Yi Wen, Zhikai Zhai, Guo-Min Sun et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.