atlas

Research map / Architectures and efficiency / Pruning and efficient tuning

LoRA-GA: Low-Rank Adaptation with Gradient Approximation

NeurIPS 2024 · Architectures and efficiency › Pruning and efficient tuning · approach: LoRA variants and theory · 20 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes LoRA-GA, which initializes LoRA adapters using a low-rank approximation of the full fine-tuning gradient so that early LoRA updates mimic full fine-tuning and converge faster.

Problem

LoRA reduces per-iteration compute and memory for fine-tuning large pretrained models, but it converges more slowly and underperforms full fine-tuning.

Approach

Initialize the LoRA low-rank matrices via a gradient approximation: decompose the gradient of the first full fine-tuning step with SVD so that the initial LoRA update approximates full-parameter gradient descent, improving convergence speed and final accuracy without changing the LoRA architecture or inference cost.

Key results

Limitations

Experimental setup

Datasets: GLUE GSM8K MATH HumanEval MBPP MT-Bench

Benchmarks: GLUE GSM8K MATH HumanEval MBPP MT-Bench

Metrics: accuracy pass@1 MT-Bench score

Baselines: LoRA full fine-tuning PiSSA LoRA-FA DoRA rsLoRA LoRA+ MiLoRA

Builds on: LoRA PiSSA LoRA-FA

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy