Verified65% confidenceFactExact time
LoRA将对权重矩阵的全量更新分解为两个低秩矩阵的乘积，训练时只更新这两个小矩阵，原始权重保持冻结
3
Sources
65%
Confidence
Long-term
Relevance
7/17/2026
First Seen
Sources
Related Claims
VerifiedLoRA 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.84% similarVerifiedDuring LoRA fine-tuning, the original model parameters are frozen and only the inserted low-rank matrices are updated, significantly reducing VRAM requirements and training costs.78% similarUnverifiedLoRA 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.77% similarUnverifiedUnsloth 微调框架能够将 LoRA/QLoRA 微调的速度提升 2 倍以上，同时将显存占用降低约 60%65% similarUnverifiedThe core idea of PEFT is to not update all parameters, but instead introduce a small number of trainable adapter parameters (such as LoRA's low-rank matrix decomposition), reducing VRAM and computation requirements while retaining performance close to full fine-tuning.64% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/547411API
curl https://kongchang.com/api/v1/knowledge/claims/547411MCP
get_claim(id=547411)