Unverified50% confidenceFactExact time
Low-rank parameterization decomposes the full covariance matrix into the form Σ = WW^T + D, reducing the parameter count from O(d²) to O(dr).
1
Sources
50%
Confidence
Long-term
Relevance
9/11/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedMLA通过低秩分解将KV Cache显存开销从O(n·d_model)压缩到O(n·d_latent)，其中d_latent约为d_model的1/870% similarUnverifiedL2算法相对于基向量系数位长β达到O(n⁴·β·(n+β))的位复杂度，在β=O(n)时相当于O(n⁶)，而经典LLL约为O(n⁹)67% similarUnverifiedThe principle of LoRA is to decompose the weight change ΔW during fine-tuning into the product of two low-rank matrices (ΔW = A×B).65% similarUnverifiedIn robust regression, replacing the Gaussian likelihood function with a t-distribution is equivalent to reducing the weight of outliers in the loss function, which improves the model's robustness to anomalous values.65% similarUnverified哈达玛矩阵满足正交性条件 H_n · H_n^T = n · I_n，使哈达玛变换可逆且不丢失信息64% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/894739API
curl https://kongchang.com/api/v1/knowledge/claims/894739MCP
get_claim(id=894739)