Unverified50% confidenceFactExact time
PRSR's low-rank subspace estimation applies SVD or PCA to the matrix formed by the residual vectors of parallel sentence pairs, takes the top k singular vectors to span the subspace, and projects the final-layer token hidden states onto the orthogonal complement of that subspace.
1
Sources
50%
Confidence
Long-term
Relevance
10/19/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedMLA projects K and V into a latent vector space through low-rank joint compression, and at inference time only the compressed latent vectors are cached, compressing the KV cache several times over while maintaining expressive capability.68% similarVerifiedKV Cache将已计算的历史键值矩阵缓存在内存中，将自回归生成的复杂度从随序列长度平方增长降至线性65% similarUnverified线性代数中的矩阵分解与特征值分解对应神经网络的权重空间分析64% similarUnverifiedRepresentative methods for variance reduction include SVRG and SARAH.63% similarUnverifiedThis paper's work can be seen as a generalization of SVGD: in SVGD the relationship between the displacement field and the density ratio is implicitly fixed, whereas this paper explicitly parameterizes both into the same convex optimization objective, allowing the density ratio and the displacement field to be jointly estimated.62% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1064855API
curl https://kongchang.com/api/v1/knowledge/claims/1064855MCP
get_claim(id=1064855)