Curvature-Guided LoRA: Matching Full Fine-Tuning in Function Space

28d ago · Global · primary source: export.arxiv.org

Multi-source synthesis by The Embedding Report from 2 sources. Every numeric and quoted claim traces to a cited source body (see methodology).

Researchers have proposed two new methods, Curvature-Guided LoRA and Sparse Memory Finetuning, to improve the adaptation of large pretrained models to new tasks.

Curvature-Guided LoRA, proposed in a paper submitted to arXiv on March 31, 2026, and revised on June 7, 2026[1], uses local curvature information to select adaptation directions, matching full fine-tuning in function space. The algorithm improves performance and convergence speed of parameter-efficient fine-tuning methods like LoRA. LoRA enables efficient adaptation of large pretrained models, but often lags behind full fine-tuning in convergence speed and final performance[1]. Meanwhile, a separate paper on arXiv proposes Sparse Memory Finetuning (SMF), a low-forgetting alternative to LoRA and full finetuning. SMF adds key-value memory layers to the model and updates only the small set of memory rows that the current batch reads most heavily, improving MedMCQA by 2.5 percentage points while keeping forgetting probes within roughly 1 point of the base model[2]. In contrast, LoRA and full finetuning achieve larger gains but with clear drift on both forgetting probes[2].

research-papersafety-researchcommentary

Background sources we checked (1)
  • arxiv.org ↗ Parameter-efficient fine-tuning methods such as LoRA enable efficient adaptation of large pretrained models, but often lag behind full fine-tuning in both convergence speed and final performance. Recent approaches aim to reduce this gap by aligning LoRA parameter updates with tho…

Sources cited (2)

  1. arxiv.org ↗ E
  2. arxiv.org ↗ E
Spot something wrong? Report an issue