Unverified50% confidenceFactExact time
完整雅可比矩阵的计算代价是O(m×n)次前向传播，实际应用中研究者通常采用随机化SVD或Lanczos迭代等算法近似计算其低秩分解
1
Sources
50%
Confidence
Long-term
Relevance
7/13/2026
First Seen
Sources
Jacobian-Lens in Practice: Manually Reshaping LLM Behavior with J-Space
redditr/LocalLLaMA7/11/2026
Related Claims
UnverifiedThe standard approach for handling non-square cost matrices is to pad them into square matrices using large dummy cost values.73% 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.64% similarUnverified质心追踪算法在做目标关联时需要构建N×M的距离矩阵，纯Python实现下计算开销随目标数量呈线性甚至平方级增长62% similarUnverifiedThe computational complexity of EKF-SLAM is O(n²) because the dimensions of the covariance matrix grow linearly with the number of landmarks62% similarUnverified强行取极值样本会引入离群点，迫使SVM构建更复杂的决策边界，高阶poly核在这种数据上收敛更慢62% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/501497API
curl https://kongchang.com/api/v1/knowledge/claims/501497MCP
get_claim(id=501497)