Khatri–Rao Product Adapters (KRAdapter)

• KRAdapter is a parameter-efficient fine-tuning method that uses the Khatri–Rao product to construct weight updates with enhanced effective rank.
• It builds structured update matrices via two factor matrices, addressing limitations of conventional low-rank adaptation for improved spectral fidelity.
• Empirical results demonstrate consistent performance gains over LoRA, with superior OOD generalization and maintained compute efficiency in vision and language tasks.

Khatri–Rao Product Adapters (KRAdapter) are a parameter-efficient fine-tuning (PEFT) method designed to improve the effective rank of learned weight updates when adapting large pretrained models. KRAdapter utilizes the Khatri–Rao product to construct update matrices that, by construction, tend to exhibit higher effective rank compared to the low-rank structure of methods such as LoRA. This approach addresses limitations of conventional low-rank adaptation in maintaining spectral properties critical for multimodal and LLMs, and demonstrates consistent improvements in out-of-distribution (OOD) generalization and performance on diverse benchmarks, while retaining the memory and compute efficiency characteristic of PEFT methods (Albert et al., 1 Aug 2025).

1. Mathematical Foundations: Khatri–Rao Product

The Khatri–Rao product is a column-wise Kronecker product of two matrices. If $U\in\mathbb{R}^{a\times c}$ and $V\in\mathbb{R}^{b\times c}$, their Khatri–Rao product $U\odot V$ is defined as: $$U\odot V = \begin{bmatrix} u_{11}v_1 & u_{12}v_2 & \cdots & u_{1c}v_c \ u_{21}v_1 & u_{22}v_2 & \cdots & u_{2c}v_c \ \vdots & \vdots & \ddots & \vdots \ u_{a1}v_1 & u_{a2}v_2 & \cdots & u_{ac}v_c \end{bmatrix} \in \mathbb{R}^{(ab)\times c}$$ where $u_{ij}$ denotes the $(i,j)$-entry of $U$ and $v_j$ denotes the $j$th column of $V$.

Unlike the standard matrix product, which for $V\in\mathbb{R}^{b\times c}$0 and $V\in\mathbb{R}^{b\times c}$1 yields a result in $V\in\mathbb{R}^{b\times c}$2, and unlike the Kronecker product, which produces a block matrix in $V\in\mathbb{R}^{b\times c}$3, the Khatri–Rao product stacks the column-wise Kronecker products, preserving a column-centric structure critical for high effective-rank updates.

2. Weight Update Construction in KRAdapter

KRAdapter modifies PEFT layers by expressing the fine-tuned weight as

$V\in\mathbb{R}^{b\times c}$4

with $V\in\mathbb{R}^{b\times c}$5 frozen and $V\in\mathbb{R}^{b\times c}$6 learned via a structured update. LoRA uses a low-rank factorization $V\in\mathbb{R}^{b\times c}$7 with factors $V\in\mathbb{R}^{b\times c}$8, $V\in\mathbb{R}^{b\times c}$9. In contrast, KRAdapter introduces two factor matrices: $U\odot V$0 and constructs the update as

$U\odot V$1

where $U\odot V$2 is a scaling factor and the resulting matrix is truncated to the first $U\odot V$3 rows. Theoretical results demonstrate that any matrix $U\odot V$4 of rank $U\odot V$5 can be recast as $U\odot V$6 for appropriate factorization, substantiating the expressive capacity of this parameterization.

3. Training and Implementation Protocol

Training with KRAdapter involves freezing pretrained weights and updating only the $U\odot V$7 and $U\odot V$8 factors. The procedure for each parameterized layer is:

$U$2 Initialization zeroes $U\odot V$9 and samples $$U\odot V = \begin{bmatrix} u_{11}v_1 & u_{12}v_2 & \cdots & u_{1c}v_c \ u_{21}v_1 & u_{22}v_2 & \cdots & u_{2c}v_c \ \vdots & \vdots & \ddots & \vdots \ u_{a1}v_1 & u_{a2}v_2 & \cdots & u_{ac}v_c \end{bmatrix} \in \mathbb{R}^{(ab)\times c}$$0 from a Kaiming uniform distribution. Only $$U\odot V = \begin{bmatrix} u_{11}v_1 & u_{12}v_2 & \cdots & u_{1c}v_c \ u_{21}v_1 & u_{22}v_2 & \cdots & u_{2c}v_c \ \vdots & \vdots & \ddots & \vdots \ u_{a1}v_1 & u_{a2}v_2 & \cdots & u_{ac}v_c \end{bmatrix} \in \mathbb{R}^{(ab)\times c}$$1 and $$U\odot V = \begin{bmatrix} u_{11}v_1 & u_{12}v_2 & \cdots & u_{1c}v_c \ u_{21}v_1 & u_{22}v_2 & \cdots & u_{2c}v_c \ \vdots & \vdots & \ddots & \vdots \ u_{a1}v_1 & u_{a2}v_2 & \cdots & u_{ac}v_c \end{bmatrix} \in \mathbb{R}^{(ab)\times c}$$2 are trainable, preserving the efficiency of the underlying PEFT paradigm.

4. Effective Rank and Comparative Analysis

The effective rank of a matrix $$U\odot V = \begin{bmatrix} u_{11}v_1 & u_{12}v_2 & \cdots & u_{1c}v_c \ u_{21}v_1 & u_{22}v_2 & \cdots & u_{2c}v_c \ \vdots & \vdots & \ddots & \vdots \ u_{a1}v_1 & u_{a2}v_2 & \cdots & u_{ac}v_c \end{bmatrix} \in \mathbb{R}^{(ab)\times c}$$3 with singular values $$U\odot V = \begin{bmatrix} u_{11}v_1 & u_{12}v_2 & \cdots & u_{1c}v_c \ u_{21}v_1 & u_{22}v_2 & \cdots & u_{2c}v_c \ \vdots & \vdots & \ddots & \vdots \ u_{a1}v_1 & u_{a2}v_2 & \cdots & u_{ac}v_c \end{bmatrix} \in \mathbb{R}^{(ab)\times c}$$4 is given by

$$U\odot V = \begin{bmatrix} u_{11}v_1 & u_{12}v_2 & \cdots & u_{1c}v_c \ u_{21}v_1 & u_{22}v_2 & \cdots & u_{2c}v_c \ \vdots & \vdots & \ddots & \vdots \ u_{a1}v_1 & u_{a2}v_2 & \cdots & u_{ac}v_c \end{bmatrix} \in \mathbb{R}^{(ab)\times c}$$5

A nearly flat singular value spectrum correlates with high effective rank.

KRAdapter achieves superior effective rank compared to LoRA and variants. Theoretical analysis indicates that for $$U\odot V = \begin{bmatrix} u_{11}v_1 & u_{12}v_2 & \cdots & u_{1c}v_c \ u_{21}v_1 & u_{22}v_2 & \cdots & u_{2c}v_c \ \vdots & \vdots & \ddots & \vdots \ u_{a1}v_1 & u_{a2}v_2 & \cdots & u_{ac}v_c \end{bmatrix} \in \mathbb{R}^{(ab)\times c}$$6 drawn i.i.d. (e.g., Gaussian or uniform) with $$U\odot V = \begin{bmatrix} u_{11}v_1 & u_{12}v_2 & \cdots & u_{1c}v_c \ u_{21}v_1 & u_{22}v_2 & \cdots & u_{2c}v_c \ \vdots & \vdots & \ddots & \vdots \ u_{a1}v_1 & u_{a2}v_2 & \cdots & u_{ac}v_c \end{bmatrix} \in \mathbb{R}^{(ab)\times c}$$7, the Khatri–Rao product achieves full column rank almost surely, a property not shared by LoRA’s rank-$$U\odot V = \begin{bmatrix} u_{11}v_1 & u_{12}v_2 & \cdots & u_{1c}v_c \ u_{21}v_1 & u_{22}v_2 & \cdots & u_{2c}v_c \ \vdots & \vdots & \ddots & \vdots \ u_{a1}v_1 & u_{a2}v_2 & \cdots & u_{ac}v_c \end{bmatrix} \in \mathbb{R}^{(ab)\times c}$$8 construction.

Empirically, across all tested vision (ViT-B/32, L/14, H/14) and language (LLama3-8B, Qwen2.5-7B) heads, KRAdapter produces consistently higher effective ranks in adapter updates, supporting improved retention of complex spectral characteristics (Albert et al., 1 Aug 2025).

5. Empirical Results and Benchmark Performance

KRAdapter was benchmarked across several domains:

• Synthetic Matrix Approximation: On six target matrix types (random, sparse, PCA-whitened, low-rank, CLIP-tuned, frequency-controlled), KRAdapter outperformed all PEFT baselines except when approximating explicitly low-rank targets, as measured by squared nuclear reconstruction error.
• Vision-language Fine-tuning: On CLIP-ViT models across 11 classification datasets (few-shot and 50–100% data), KRAdapter achieved mean accuracies ∼5 points higher than LoRA and ∼1 point higher than other full-rank PEFT methods.
• OOD Robustness: For ImageNet (in-distribution) and ImageNet‐A/S/R/V2 and CIFAR-100 (OOD), KRAdapter demonstrated the highest generalization ratio ($$U\odot V = \begin{bmatrix} u_{11}v_1 & u_{12}v_2 & \cdots & u_{1c}v_c \ u_{21}v_1 & u_{22}v_2 & \cdots & u_{2c}v_c \ \vdots & \vdots & \ddots & \vdots \ u_{a1}v_1 & u_{a2}v_2 & \cdots & u_{ac}v_c \end{bmatrix} \in \mathbb{R}^{(ab)\times c}$$9), and minimal nuclear/Frobenius update norm.
• LLM Commonsense: On 4-bit quantized LLama3.1-8B and Qwen2.5-7B, fine-tuned for multi-choice reasoning, KRAdapter yielded top OOD performance (e.g., BoolQ, PiQA, WinoGrande), while matching in-distribution performance.

For exhaustive dataset-level breakdowns, see Tables 1–3 and Appendix D–E in the original paper (Albert et al., 1 Aug 2025).

6. Memory Footprint and Computational Efficiency

KRAdapter introduces an update matrix $u_{ij}$0 parameterized by

$u_{ij}$1

This is minimized for $u_{ij}$2, yielding $u_{ij}$3. This is significantly less than a full-rank update ($u_{ij}$4), and closely matches LoRA’s parameter count $u_{ij}$5 for typical LoRA ranks ($u_{ij}$6–32).

Floating point operation counts mirror those of LoRA. Empirical measurements (Appendix F, Table F.1) report nearly identical VRAM usage and epoch durations compared to LoRA, differing by only 1–2 minutes per epoch on transformers up to 8B parameters.

7. Implementation Guidelines and Limitations

Default hyperparameters:

• Scaling factor $u_{ij}$7 (vision) or $u_{ij}$8 (LLM quant).
• Learning rate: $u_{ij}$9 for synthetic experiments, $(i,j)$0 (AdamW) for real tasks.
• Initialization: $(i,j)$1, $(i,j)$2 KaimingUniform($(i,j)$3).
• Recommended shape: $(i,j)$4, rounded for $(i,j)$5 as needed.

Integration:

• Implementable in PyTorch by subclassing nn.Linear or compatible attention modules, adding $(i,j)$6 parameter blocks, and modifying the forward pass to inject $(i,j)$7.
• Analogs in TensorFlow and JAX involve inserting a Khatri–Rao layer.
• Official code is available at https://github.com/PaulAlbert31/KRAdapter.

Stability tips:

• Zero-initialize $(i,j)$8 to ensure $(i,j)$9 begins at zero.
• Use modest $U$0 to prevent disturbance of pretrained activations.
• If numerical instability occurs, reduce learning rate or increase weight decay; optionally apply gradient norm clipping.

Limitations:

• Minimal trainable parameters $U$1 exceed the LoRA rank-1 case.
• KRAdapter is less optimal when the optimal update is genuinely low-rank (e.g., artificial low-rank matrices).
• In pure in-distribution regimes with ample data, RandLoRA can occasionally match or slightly exceed KRAdapter on certain targets, but KRAdapter remains superior in OOD robustness and convergence speed.

KRAdapter preserves the operational simplicity and resource efficiency of LoRA. By leveraging the Khatri–Rao product, it constructs weight updates with much higher effective rank, leading to enhanced spectral fidelity and robustness in challenging multimodal and LLM adaptation tasks (Albert et al., 1 Aug 2025).