Multiplicative LoRA Weights

• Multiplicative LoRA weights are dynamic scaling factors for low-rank adaptation that modulate base model weights or adapter updates for enhanced transfer learning.
• They employ instance-, module-, and rank-level policies, including per-token fusion gates, to achieve stable gradients and improved performance.
• Dynamic scaling enables precise, context-aware integration of multiple LoRA modules, leading to higher accuracy in both classification and generative tasks.

Multiplicative LoRA weights extend the low-rank adaptation (LoRA) framework for parameter-efficient fine-tuning of large-scale deep learning models by introducing dynamic, explicit multiplicative scaling factors. These factors modulate either the base model weights, the adapter updates, or the fusion of multiple LoRA modules. Unlike the standard additive approach, multiplicative LoRA weights enable finer control over the contribution of pre-trained model components and their adapters during transfer learning, and they address theoretical and empirical weaknesses of fixed or improperly-scaled adaptation. Multiplicative schemes encompass instance-level, module-level, and rank-based scaling policies, as well as dynamic per-token fusion gates for multi-LoRA combination.

1. Multiplicative LoRA Weight Formulations

Multiplicative LoRA weights are applied in distinct settings, with three principal variants established in recent work:

1. Base Weight Scaling (α-LoRA): Each row (or scalar, or per-layer block) of the pre-trained base matrix $W$ is scaled by a trainable parameter $\alpha$; the LoRA update becomes $W' = \alpha \circ W + AB$, where $AB$ is the standard low-rank LoRA adapter ($A \in \mathbb{R}^{d_{\text{out}} \times r}$, $B \in \mathbb{R}^{r \times d_{\text{in}}}$). For LLMs, the row-wise form $W'_{i,:} = \alpha_i W_{i,:} + (AB)_{i,:}$ is common. This reparameterization introduces negligible parameter and compute overhead since $$\#(\alpha) = d_\text{out} \ll d_\text{out}d_\text{in}$$ (Firdoussi et al., 24 Oct 2025).
2. Adapter Rank Scaling (rsLoRA): The LoRA additive update is modified by a deterministic rank-dependent factor $\gamma_r$. The original LoRA sets $\gamma_r = \alpha / r$, but theoretical analysis shows optimal stability and learning at $\gamma_r = \alpha / \sqrt{r}$. Thus, the effective weight is $W' = W_0 + (\alpha/\sqrt{r}) BA$, termed rank-stabilized LoRA (rsLoRA) (Kalajdzievski, 2023).
3. Dynamic Fusion Scaling (LoRA-Flow): For combining multiple pre-trained LoRA adapters, a dynamic gate outputs per-token, per-layer multiplicative weights $\gamma_t^{(i), \ell}$ for each LoRA module $i$ at decoding step $t$ and transformer layer $\ell$. The final output at step $t$ is $$h_t^{\prime (\ell)} = W^{(\ell)}_0 x_t^{\ell} + \sum_{i=1}^k \gamma_t^{(i),\ell} (\Delta W^\ell_i x_t^\ell)$$, where the fusion weights are obtained via a softmax gate conditioned on the current hidden state (Wang et al., 2024).

2. Theoretical Rationale for Multiplicative Scaling

Base Weight Rescaling: α-LoRA and RMT Analysis

The α-LoRA formulation addresses the mismatch between pre-trained and target tasks in low-resource or partially aligned transfer. Random Matrix Theory (RMT) provides a formal analysis in the high-dimensional binary classification setting: For a source classifier $\tilde{w}$ and target data $(X,Y)$, the fine-tuned classifier is $w_\alpha = \alpha \tilde{w} + \Delta w$, with $\Delta w$ the regularized target adapter. The asymptotic decision statistic $w_\alpha^\top x$ is Gaussian, with explicit expressions for mean $m_\alpha$ and variance $\nu_\alpha$, and the test accuracy depends strongly on $\alpha$. The optimal scaling $\alpha^* \neq 1$ unless tasks are perfectly aligned ($\beta=0$), and the improvement is pronounced for $p \gg n$ (parameter-inefficient regimes) (Firdoussi et al., 24 Oct 2025). This analysis demonstrates that additive adapters under- or over-utilize the pre-trained weights and a learned $\alpha$ corrects the weighting.

Adapter Rank-Dependence: Stability in LoRA

Standard LoRA's choice of scaling factor $1/r$ for rank-$r$ adapters causes both forward activations and backward gradients to collapse as $r$ increases, rendering large-rank adaptation ineffective. The proper criterion is that the magnitude of output activations and the norm of gradients should remain $O(1)$ as $r \to \infty$. Theoretical analysis (see Theorem 3.1) proves that only $\gamma_r \sim 1/\sqrt{r}$ ensures stability, hence the rank-stabilized LoRA (rsLoRA) update $W' = W_0 + (\alpha/\sqrt{r}) BA$ (Kalajdzievski, 2023).

Dynamic Per-Token Fusion: Contextualized Contribution

In settings with multiple LoRA adapters, static task- or module-level fusion weights fail to capture token-level task heterogeneity. LoRA-Flow employs a gating mechanism whereby fusion weights $\gamma_t^{(i),\ell}$ are generated by a small softmax gate conditioned on the current hidden state at each token and layer, allowing precise contextual control (Wang et al., 2024). Experiments show significant improvements in generative tasks demanding adaptive skill composition.

3. Training, Initialization, and Implementation

α-LoRA Parameterization

The scaling vector $\alpha$ is initialized to $1$, matching standard LoRA at the start of fine-tuning. For LLMs, $\alpha$ can be per-output-row. It is trained with a dedicated optimizer (Adam or AdamW) and higher learning rate ($10^{-2}$ or $5 \cdot 10^{-3}$, versus LoRA adapter's $10^{-4}$), and is updated every $T$ steps using fresh batches to minimize overfitting (Firdoussi et al., 24 Oct 2025). Typical values of $\alpha$ remain in $[0.8,1.2]$ during standard LLM tuning, with no special norm constraint beyond standard AdamW weight decay.

rsLoRA Scaling

For rsLoRA, implementation involves replacing the scaling factor from $\alpha/r$ to $\alpha/\sqrt{r}$ within the LoRA module. No other modifications are required. The value of $\alpha$ can be kept as for small-rank LoRA, but may be tuned for stability (Kalajdzievski, 2023).

LoRA-Flow Fusion Gates

The fusion gates in LoRA-Flow are parameterized by per-layer matrices $W_{\text{gate}}^\ell \in \mathbb{R}^{k \times d}$ and biases $b^\ell \in \mathbb{R}^k$. Gates are trained with only the fusion parameters updated; all base and LoRA adapters are frozen. Training proceeds using cross-entropy loss on few-shot data, needing few parameters ($\sim$0.2% of LoRA adapter size) and robust to overfitting in low-resource settings (Wang et al., 2024).

4. Empirical Results and Comparative Performance

α-LoRA Empirics

In high-dimensional linear transfer (Amazon Reviews, 400D features, $n=40$), learned $\alpha^*$ (e.g., $2.47$ in Books→DVD) yields $+1$–$2$ percentage points over vanilla LoRA ($\alpha=1$)—Books→DVD: 64.12% (from scratch) → 75.67% (vanilla LoRA) → 77.35% (α-LoRA). On LLMs (roberta-base, LoRA rank 8, GLUE), α-LoRA consistently outperforms vanilla LoRA, with accuracy increases ranging from $+0.06$ to $+3.61$ points depending on the task (Firdoussi et al., 24 Oct 2025).

rsLoRA Scaling

When training Llama 2-7B on OpenOrca with increasing adapter ranks, the perplexity curves under standard LoRA ($1/r$) are nearly identical and insensitive to rank; for rsLoRA ($1/\sqrt{r}$), performance improves monotonically with $r$. The average parameter gradient norm under standard LoRA vanishes for high $r$, in contrast to rsLoRA where it remains stable across ranks. This confirms rsLoRA's stable learning and utility of high-rank adaptation (Kalajdzievski, 2023).

LoRA-Flow Fusion

Combining multiple LoRA adapters on Llama-2 models, LoRA-Flow achieves Math (MGSM) accuracy of 37.6% versus 28.7% with task-level fusion and 13.9% with static fusion; similar improvements are seen in code generation (HumanEval) and ablated gate granularity (layer-level outperforms module/step-level). In multilingual tasks (Llama-2-13B), LoRA-Flow reaches 41.2%/35.4% (math/code) versus 40.0%/34.2% for the best static fusion. In few-shot settings, LoRA-Flow consistently exceeds training new or task-specific LoRA modules (Wang et al., 2024).

5. Practical Recommendations and Application Scenarios

When to use α-LoRA:

Ideal for low-resource tuning ($n$ small), or when target tasks are only partially aligned with pre-training. Also suited for scenarios where small relative shifts in pretrained weights matter (e.g., cross-domain transfer). The compute and memory overhead is negligible—on roberta-base, the additional $\alpha$ parameters constitute $\sim 0.02\%$ extra.

When to use rsLoRA:

Advantageous when high-rank adapters are needed for more expressive adaptation, enabling a smooth compute–performance trade-off. The best practice is to use the largest rank $r$ permissible by hardware constraints and tune $\alpha$ as needed.

Dynamic Fusion with LoRA-Flow:

Appropriate for generative and multitask settings demanding token-wise skill composition, e.g., multilingual LLMs tackling mixed-domain tasks. Fusion gates are compact and train efficiently with minimal examples.

Implementation caveats:

For α-LoRA, ensure $\alpha$ is optimized with distinct batches and learning rates to prevent overfitting, and for rsLoRA, simply update the scaling law to $1/\sqrt{r}$.

6. Impact, Limitations, and Future Directions

Multiplicative LoRA weights offer an additional degree of freedom over additive-only frameworks, theoretically guaranteeing improved or equivalent asymptotic generalization in alignment-mismatched and low-data regimes, and empirically enhancing transfer accuracy in both linear and LLM tasks (Firdoussi et al., 24 Oct 2025). rsLoRA reactivates the use of large-rank adapters previously ineffective under standard scaling, allowing performance scaling commensurate with training resources (Kalajdzievski, 2023). In multi-LoRA fusion tasks, dynamic multiplicative gating significantly outperforms static weights and enables granular, contextual adaptation (Wang et al., 2024).

The incremental overheads in parameters and computation are minimal, making multiplicative LoRA extensions broadly applicable within the current PEFT and transfer learning ecosystem. In regimes where downstream data is abundant or tasks are strongly aligned, the improvement from multiplicative scaling may diminish, and standard additive adapters suffice. A plausible implication is that future work may explore more fine-grained or adaptive multiplicative schemes, such as hybrid gating or hierarchical scaling, especially as multi-LoRA and meta-learning approaches proliferate.