Pith. sign in

REVIEW 22 cited by

LoRA+: Efficient Low Rank Adaptation of Large Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.12354 v2 pith:XJYPXDHT submitted 2024-02-19 cs.LG cs.AIcs.CLstat.ML

LoRA+: Efficient Low Rank Adaptation of Large Models

classification cs.LG cs.AIcs.CLstat.ML
keywords loralearninglargesameadaptationadapterefficientfinetuning
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In this paper, we show that Low Rank Adaptation (LoRA) as originally introduced in Hu et al. (2021) leads to suboptimal finetuning of models with large width (embedding dimension). This is due to the fact that adapter matrices A and B in LoRA are updated with the same learning rate. Using scaling arguments for large width networks, we demonstrate that using the same learning rate for A and B does not allow efficient feature learning. We then show that this suboptimality of LoRA can be corrected simply by setting different learning rates for the LoRA adapter matrices A and B with a well-chosen ratio. We call this proposed algorithm LoRA$+$. In our extensive experiments, LoRA$+$ improves performance (1-2 $\%$ improvements) and finetuning speed (up to $\sim$ 2X SpeedUp), at the same computational cost as LoRA.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 22 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. SSM Adapters via Hankel Reduced-order Modeling: Injection Site Determines Task Suitability in Long-Context Fine-Tuning

    cs.LG 2026-06 unverdicted novelty 7.0

    HRM adapters via Hankel reduced-order modeling outperform LoRA on long-context tasks in Mistral-7B when used as SSM residual modules with FFT-based parallel scan.

  2. Adaptive Selection of LoRA Components in Privacy-Preserving Federated Learning

    cs.LG 2026-05 unverdicted novelty 7.0

    AS-LoRA adaptively chooses which LoRA factor to update per layer and round using a curvature-aware second-order score, eliminating reconstruction error floors and improving performance in DP federated learning.

  3. Dive Into the Implicit Biases of Low-rank Vision-language Alignment

    cs.CV 2026-07 conditional novelty 6.0

    Low-rank LLM adaptation during vision-language alignment outperforms full fine-tuning by preserving per-token visual structure and favoring flat, noise-robust subspaces.

  4. ReCoLoRA: Spectrum-Aware Recursive Consolidation for Continual LLM Fine-Tuning

    cs.LG 2026-07 conditional novelty 6.0

    Spectrum-initialized LoRA with elbow ranks and recursive SVD consolidation of the effective weight beats rank-swept PEFT baselines on three of four 7–8B models in continual GLUE fine-tuning.

  5. 5% > 100%: Flatness Preference is All You Need for Multimodal Parameter-Efficient Fine-Tuning

    cs.CV 2026-06 unverdicted novelty 6.0

    Flatness Preference Optimization (FlatPO) improves multimodal PEFT generalization by flattening a small set of sharp dimensions that dominate performance.

  6. Not How Many, But Which: Parameter Placement in Low-Rank Adaptation

    cs.LG 2026-05 unverdicted novelty 6.0

    Gradient-informed placement of LoRA parameters recovers full performance under GRPO while random placement does not, due to differences in gradient rank and stability across training regimes.

  7. TLoRA: Task-aware Low Rank Adaptation of Large Language Models

    cs.CL 2026-04 unverdicted novelty 6.0

    TLoRA jointly optimizes LoRA initialization via task-data SVD and sensitivity-driven rank allocation, delivering stronger results than standard LoRA across NLU, reasoning, math, code, and chat tasks while using fewer ...

  8. ANTIC: Adaptive Neural Temporal In-situ Compressor

    cs.LG 2026-04 unverdicted novelty 6.0

    ANTIC reduces storage for large-scale PDE simulations by orders of magnitude through adaptive temporal snapshot selection combined with continual neural-field residual compression while preserving physics accuracy.

  9. Sensitivity-Positional Co-Localization in GQA Transformers

    cs.CL 2026-04 unverdicted novelty 6.0

    In Llama 3.1 8B, task-sensitive layers cluster late while RoPE adaptation is strongest early, yet applying both adaptations only to sensitivity-identified layers outperforms other layer choices by 4-16 points on MMLU,...

  10. NP-LoRA: Null Space Projection for Subject-Style LoRA Fusion

    cs.CV 2025-11 unverdicted novelty 6.0

    NP-LoRA fuses subject and style LoRAs via null-space projection of the content update onto the orthogonal complement of the style subspace, with a soft variant controlled by one parameter.

  11. SynthPert: Enhancing LLM Biological Reasoning via Synthetic Reasoning Traces for Cellular Perturbation Prediction

    cs.AI 2025-09 unverdicted novelty 6.0

    SynthPert fine-tunes LLMs using synthetic reasoning traces to reach state-of-the-art on the PerturbQA benchmark for cellular perturbation prediction, surpassing the generating frontier model while generalizing to unse...

  12. LoRA-Mixer: Coordinate Modular LoRA Experts Through Serial Attention Routing

    cs.LG 2025-06 unverdicted novelty 6.0

    LoRA-Mixer routes modular LoRA experts into attention projection matrices with an adaptive Routing Specialization Loss to improve multi-task performance while using fewer trainable parameters than prior LoRA-MoE methods.

  13. PrefixMemory-Tuning: Modernizing Prefix-Tuning by Decoupling the Prefix from Attention

    cs.CL 2025-06 unverdicted novelty 6.0

    PrefixMemory-Tuning decouples the prefix from attention to overcome performance limits of traditional prefix-tuning and reaches competitive results with modern PEFT methods on LLM adaptation benchmarks.

  14. Learning to Fine-tune Foundation Models under Resource Limitations

    cs.LG 2026-07 conditional novelty 5.5

    An actor-critic policy for when to fine-tune a foundation model under a compute budget outperforms random budgeted fine-tuning by >4% accuracy and reaches 97% of full fine-tuning accuracy with 25% of the steps.

  15. SMoA: Spectrum Modulation Adapter for Parameter-Efficient Fine-Tuning

    cs.LG 2026-05 unverdicted novelty 5.0

    SMoA is a new PEFT adapter that uses block-wise Hadamard-modulated low-rank branches on spectral partitions to cover more pretrained spectral directions than standard LoRA under a smaller parameter budget.

  16. Strategic Over-Parameterization for Generalizable Low-Rank Adaptation

    cs.LG 2026-05 unverdicted novelty 5.0

    LoRA-Over injects auxiliary parameters into low-rank adapters during training and decomposes them back into standard LoRA at inference, with static or dynamic scheduling to allocate extra capacity where needed, yieldi...

  17. ANTIC: Adaptive Neural Temporal In-situ Compressor

    cs.LG 2026-04 unverdicted novelty 5.0

    ANTIC achieves orders-of-magnitude storage reduction for high-dimensional spatiotemporal PDE simulations by combining adaptive temporal snapshot selection with neural-field residual compression while preserving physic...

  18. ANTIC: Adaptive Neural Temporal In-situ Compressor

    cs.LG 2026-04 unverdicted novelty 5.0

    ANTIC combines an adaptive temporal selector with continual neural field compression to reduce storage for high-dimensional PDE simulations by orders of magnitude while preserving physics accuracy.

  19. Document Retrieval Augmented Fine-Tuning (DRAFT) for safety-critical software assessments

    cs.SE 2025-05 unverdicted novelty 5.0

    DRAFT fine-tunes LLMs with a dual-retrieval architecture and semi-automated datasets containing distractors to achieve 7% higher correctness in safety compliance assessments.

  20. Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Survey

    cs.LG 2024-03 accept novelty 4.0

    A comprehensive survey of PEFT algorithms for large models, covering their performance, overhead, applications, and real-world system implementations.

  21. TLoRA+: A Low-Rank Parameter-Efficient Fine-Tuning Method for Large Language Models

    cs.CL 2026-04 unverdicted novelty 3.0

    TLoRA+ augments LoRA with a dedicated optimizer to improve fine-tuning performance on GLUE tasks without meaningful added compute.

  22. The Hitchhiker's Guide to Agentic AI: From Foundations to Systems

    cs.AI 2026-06 unverdicted novelty 2.0

    A comprehensive reference book organizing existing techniques for agentic AI systems across LLM substrate, reasoning, agent design patterns, inter-agent coordination, and production deployment.