Unverified60% confidenceFactExact time
LoRA leverages the low-rank approximation principle of SVD to decompose the incremental updates of large weight matrices into the product of two low-rank matrices, thereby compressing the number of trainable parameters from billions to the millions range.
2
Sources
60%
Confidence
Long-term
Relevance
7/21/2026
First Seen
Sources
Related Claims
VerifiedLoRA将对权重矩阵的全量更新分解为两个低秩矩阵的乘积，训练时只更新这两个小矩阵，原始权重保持冻结77% similarVerifiedLoRA decomposes the weight update matrix ΔW into the product of two small matrices A and B whose ranks are much lower than the original matrix, reducing parameter count to as little as one ten-thousandth of the original or even less.75% similarUnverifiedFor a d×d weight matrix, LoRA decomposes it into two low-rank matrices A (d×r) and B (r×d), reducing trainable parameters from d² to 2dr, where the rank r is typically 8, 16 or 64.73% similarUnverifiedIn the original paper by Hu et al. at ICLR 2022, it was proposed that freezing base model weights and representing each update matrix with two low-rank matrices can drastically reduce trainable parameters while achieving quality close to full fine-tuning on benchmark tasks.71% similarUnverifiedSingular value decomposition (SVD) factorizes any matrix into the product of two orthogonal matrices and a diagonal singular value matrix, with the singular values arranged in descending order.70% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/575972API
curl https://kongchang.com/api/v1/knowledge/claims/575972MCP
get_claim(id=575972)