Unverified50% confidenceFactExact time
The idea behind latent factor decomposition is to assume that weight matrices have redundancy and low-rank structure, and to reconstruct the original weights using a set of smaller latent factors along with indices or combination methods.
1
Sources
50%
Confidence
Long-term
Relevance
10/8/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedLow-rank decomposition and quantization compression are orthogonally complementary dimensions; quantizing the smaller matrices A and B separately results in smaller errors, and the combined compression ratio can reach several times that of either method alone74% similarUnverified分组量化将权重矩阵按固定大小（通常32或64个元素）分组，每组独立计算量化缩放因子以减少精度损失74% similarUnverifiedLow-rank parameterization decomposes the covariance matrix into a low-rank factor plus a diagonal matrix form, reducing the parameter count from O(d²) to O(dr).74% similarUnverifiedGrouping several variables into a cluster node in a causal graph can reduce the size of the graph and lower the complexity of identification algorithms.70% 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.68% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/988392API
curl https://kongchang.com/api/v1/knowledge/claims/988392MCP
get_claim(id=988392)