Unverified50% confidenceFactExact time
LoRA's parameter count, memory usage and optimization difficulty grow linearly with the rank r, rather than quadratically with the model width.
1
Sources
50%
Confidence
Long-term
Relevance
10/16/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedLoRA's low-rank assumption constitutes a capacity ceiling, which limits the model's expressive power when the feature transformations required for a new modality cannot be effectively captured by low-rank matrices.72% similarUnverifiedLoRA uses a scaling factor alpha/r to scale the update, so adjusting r does not require extensively re-tuning the learning rate, reducing the cost of hyperparameter search.70% similarUnverifiedExisting pixel-space models (such as JiT) adopt a dense scaling strategy, where each increase in model capacity increases inference computation by the same amount, making it difficult to improve generation quality by scaling up parameters under a fixed inference budget.69% similarUnverified模型性能的瓶颈不仅在于参数量，更在于表示的质量，嵌入空间坍缩的模型即使参数再多也无法充分发挥潜力66% similarUnverified扩散模型的迭代步数与输出长度不呈线性正相关，耗时增长比自回归模型平缓66% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1047745API
curl https://kongchang.com/api/v1/knowledge/claims/1047745MCP
get_claim(id=1047745)