Vector-based Random Matrix Adaptation (VeRA)
Algorithms AIMech:VeraVectorBasedRandomMatrixAdaptation DRAFT
Aliases: VeRA, Vector-based Random Matrix Adaptation, VeRA PEFT, Shared Random Matrix Vector-Scaled Adaptation
Vector-based Random Matrix Adaptation (VeRA) is a parameter-efficient fine-tuning (PEFT) method that reparameterizes the low-rank weight update as h = W_0 x + Delta W x = W_0 x + Lambda_b B Lambda_d A x, where B in R^{m x r} and A in R^{r x n} are frozen, Kaiming-initialized random matrices shared across all adapted layers and regenerated on-the-fly from a single random number generator (RNG) seed, while only the layer-specific diagonal scaling vectors b in R^{m} (with Lambda_b = diag(b), initialized to zero) and d in R^{r} (with Lambda_d = diag(d), initialized to a non-zero constant d_{init}) are trainable. Across L_{tuned} adapted layers of dimension d_{model}, VeRA reduces the trainable parameter count from LoRA's 2 L_{tuned} d_{model} r to L_{tuned} (d_{model} + r) while still allowing Delta W = Lambda_b B Lambda_d A to be merged directly into W_0 with zero inference latency.
Identity Notes & Concept Scope
Distinct from standard Low-Rank Adaptation (LoRA, Hu et al., 2022), which trains and stores separate full matrices B and A per layer (costing 2 L_{tuned} d_{model} r parameters) rather than freezing a single shared random pair (B, A) and training only scaling vectors (b, d). Also distinct from (IA)^3 (Liu et al., 2022) and RED (Wu et al., 2024), which apply learned element-wise scaling directly to activation vectors at every forward pass without frozen random basis projections B and A.
Claims & Grounded Evidence
4 Claims
Mechanism
#r653-claim-linear-rank-parameter-scaling-and-seed-storage
Because the frozen Kaiming-initialized matrices B in R^{m x r} and A in R^{r x n} are shared across all adapted layers and reconstructed deterministically from a single RNG seed, VeRA's stored checkpoint footprint consists solely of the RNG seed and the trainable vectors b and d, totaling |Theta| = L_{tuned} (d_{model} + r) parameters—which grows by only L_{tuned} per unit increase in rank r compared to 2 L_{tuned} d_{model} for LoRA.
Mechanism
#r653-claim-kaiming-and-scaling-vector-initialization
VeRA initializes the shared frozen matrices A and B with Kaiming initialization so that the variance of B A remains invariant across ranks r without retuning the learning rate per rank, initializes b = 0 so the initial forward pass h = W_0 x is exact, and initializes d = d_{init} * 1 (e.g., d_{init} = 0.1) so that b receives non-zero gradients on the first backward pass and both scaling vectors jointly modulate rows and columns of B and A.
Application
#r653-claim-glue-e2e-llama-vit-applications
VeRA matches or exceeds LoRA's performance on GLUE (RoBERTa-base/large), E2E natural language generation (GPT-2 Medium/Large), Vision Transformer image classification (ViT-B/L on CIFAR-100, Food101, Flowers102, RESISC45), and LLaMA-1/2 7B and 13B instruction tuning on MT-Bench while using 10x to 100x fewer trainable parameters and 7.4% less GPU training memory.
Limitation
#r653-claim-higher-rank-and-d-init-sensitivity-limitation
Because A and B are random and frozen, VeRA typically requires a much larger internal rank r (e.g., r = 256 or 1024 vs. r = 8 or 16 in LoRA) and a ~10x higher learning rate on the scaling vectors, and its downstream accuracy degrades sharply if the initial scaling constant d_{init} is set too large (e.g., d_{init} = 1.0 vs. 10^{-1} or 10^{-7}) or if either scaling vector b or d is omitted.
⚠️ Curated Limitations & Negative Results
- Requires a substantially higher bottleneck rank r (typically 256 to 1024) than LoRA during training to span a sufficiently expressive random subspace, slightly increasing forward-pass vector-matrix multiplication operations (~1.8% training time overhead).
- Sensitive to the initialization magnitude d_{init} of the internal scaling vector d and requires separate learning-rate tuning for the scaling vectors.
Artificial Intelligence Ontology (AIO) Grounding
Mapped AIO Classes
| AIO Target Class | Mapping Relation | Mapping Rationale |
|---|---|---|
AIO:ArtificialNeuralNetwork
Artificial Neural Network
|
related_match | VeRA adapts linear projection layers in pretrained deep neural networks and Transformer language and vision models. |
Evidence Sources & Primary Literature
3 Sources| Source ID | Publication / Document | Type / Access | Reference & Checksum |
|---|---|---|---|
r653-primary-pdf
|
Dawid Jan Kopiczko, Tijmen Blankevoort, Yuki M. Asano
|
primary paper
full_text
|
ID: https://dblp.org/rec/conf/iclr/KopiczkoBA24.html
sha256:b91f11fc716e…
|
r653-arxiv-abs
|
Dawid Jan Kopiczko, Tijmen Blankevoort, Yuki M. Asano
|
primary paper
abstract_only
|
ID: https://arxiv.org/abs/2310.11454
sha256:7f51cc7b35e8…
|
r653-metadata-cr
|
Dawid Jan Kopiczko, Tijmen Blankevoort, Yuki M. Asano
|
primary paper
abstract_only
|
ID: https://dblp.org/rec/conf/iclr/KopiczkoBA24.html
sha256:5389188fb7c9…
|
Ontology & Grounding Topology
Open in interactive network graph →Curation Provenance
Curator: Antigravity
Method: ai_assisted
Model: Gemini
Created: 2026-10-19T12:16:00Z
Updated: 2026-10-19T12:16:00Z
Source File:
data/curated/VeraVectorBasedRandomMatrixAdaptation.yaml
· Schema:
curated_concept.yaml
Explore across X-Mech
Related computational & biological Mechs:
Embedding Map
Network Graph
ProteinTraitsMech (ESM-2 pLM)
DUFMech (Domain pLM)
TraitMech
CultureMech
All 14 X-Mech Repositories