Adaptive Budget Allocation for �Parameter-Efficient Fine Tuning��Qingru Zhang, Minshuo Chen, Alexander Bukharin, Pengcheg He, Yu Cheng, Weizhu Chen, Tuo Zhao ��ICLR 2023 � �
Presented by: Meghna Kalra
Electrical and Computer Engineering
Introduction to Language model and fine tuning
- Model trained on a vast corpus of text to understand language patterns/contexts
- Example – ChatGPT , Bert.
- Adjusting a pre-trained model to specialize/adapt in a particular task.
- Memory cost (separate copy for each fine – tuned task )
- Computational cost (resource intensive , billions of parameters)
Fine Tuning all the parameter uniformly is not efficient !
Parameter-Efficient Fine-Tuning Methods�
Low-Rank Adaptation (LoRA)
Instead of changing the entire weight matrix, only two smaller matrices are
adjusted !
Why Low rank works ?
The core function/behavior learned by the model resides in
a much lower-dimensional space than number of its parameters.
Applications: signal processing, optimization, computer algebra, machine learning ……..
we can identify Joseph Fourier.
Madathil, Baburaj, et al. "Tensor low rank modeling and its applications in signal processing.
Limitation of LoRA
Fine tuning FFN modules achieve better performance than self-attention.
Weight matrices in top layers are more important than those in bottom layers.
How can we allocate the parameter budget adaptively according to importance of modules to improve the performance of parameter-efficient fine-tuning ? �
ADALoRA – Adaptive Low-rank Update
| | |
Matrix dimensions | | |
Rank | | |
Computation cost | | |
| | |
ADALoRA – Adaptive Low-rank Update
Structured Pruning in LoRA: | Adalora's Approach: |
|
|
Notations
Importance – Aware Rank Allocation
Equation for global budget scheduler
Designing sensitivity-based “importance scores”
Refining Sensitivity for Robustness
AdaLoRA Algorithm
Experimental results
AdaLoRA outperforms or equals existing methods across most datasets and budget levels
Comparison to low-rank parameterization. �
Pruning LoRA doublet-wise to conduct the rank allocation. In this case, the doublets are zeroed out entirely, permanently removing the pruned parameters
AdaLoRA outperforms or equals existing methods across all low rank parameterizations
Importance scores:
Budget Distribution
AdaLoRA - Resulting rank of each incremental matrix
LoRA
This validates that the proposed importance metric in AdaLoRA focuses on crucial modules and layers.
Conclusion
IncreLoRA: Incremental Parameter Allocation Method for Parameter-Efficient Fine-tuning��Feiyu Zhang, Liangzhi Li, Junhao Chen, Zhouqiang Jiang, Bowen Wang, and Yiming Qian��� �
Presented by: Seonho Kim
Electrical and Computer Engineering
Recap
- Importance of each matrix is ignored.
- needs to give more rank to more important matrix.
- upper bound on the rank for each matrix is determined by the initial rank (the sum of ranks of total matrices decreases over iteration).
- cannot give more rank on a matrix than the initial rank even if the matrix is very important.
Basic idea of IncreLoRA
Basic idea of IncreLoRA
Methodology
Pretrained
Weights
Methodology
Methodology
Methodology
SS with an exponential moving average helps to mitigate the effect of variability in the gradients across training iterations.
Methodology
Methodology
Methodology
Experiments
Transformer : DeBERTaV3-base
Dataset : GLUE
Experiments
Experiments
Experiments
Conclusion
Remaining Questions
-> 1. It depends on hyperparameters.
2. increase the computational cost.
3. Ignore the importance of singular values.