Bernoulli-LoRA: A Theoretical Framework for Randomized Low-Rank Adaptation

TL;DR

This paper introduces Bernoulli-LoRA, a probabilistic framework for low-rank model adaptation that unifies and extends existing methods, providing theoretical convergence guarantees and practical validation for efficient fine-tuning of large models.

Contribution

We propose Bernoulli-LoRA, a novel probabilistic framework that generalizes existing LoRA methods and offers rigorous convergence analysis under standard optimization assumptions.

Findings

Established convergence guarantees for multiple Bernoulli-LoRA variants.

Extended analysis to convex non-smooth functions with convergence rates.

Validated theoretical results through extensive experiments on various tasks.

Abstract

Parameter-efficient fine-tuning (PEFT) has emerged as a crucial approach for adapting large foundational models to specific tasks, particularly as model sizes continue to grow exponentially. Among PEFT methods, Low-Rank Adaptation (LoRA) (arXiv:2106.09685) stands out for its effectiveness and simplicity, expressing adaptations as a product of two low-rank matrices. While extensive empirical studies demonstrate LoRA's practical utility, theoretical understanding of such methods remains limited. Recent work on RAC-LoRA (arXiv:2410.08305) took initial steps toward rigorous analysis. In this work, we introduce Bernoulli-LoRA, a novel theoretical framework that unifies and extends existing LoRA approaches. Our method introduces a probabilistic Bernoulli mechanism for selecting which matrix to update. This approach encompasses and generalizes various existing update strategies while maintaining theoretical tractability. Under standard assumptions from non-convex optimization literature, we analyze several variants of our framework: Bernoulli-LoRA-GD, Bernoulli-LoRA-SGD, Bernoulli-LoRA-PAGE, Bernoulli-LoRA-MVR, Bernoulli-LoRA-QGD, Bernoulli-LoRA-MARINA, and Bernoulli-LoRA-EF21, establishing convergence guarantees for each variant. Additionally, we extend our analysis to convex non-smooth functions, providing convergence rates for both constant and adaptive (Polyak-type) stepsizes. Through extensive experiments on various tasks, we validate our theoretical findings and demonstrate the practical efficacy of our approach. This work is a step toward developing theoretically grounded yet practically effective PEFT methods.