Unverified50% confidenceFactExact time
The 1969 Strassen algorithm reduced the matrix multiplication exponent to approximately 2.81, and the currently recognized best upper bound hovers around 2.37.
1
Sources
50%
Confidence
Long-term
Relevance
10/8/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedAn unreviewed preprint claims that an internal model has reduced the upper bound of the matrix multiplication exponent from approximately 2.37 to 2.25.70% similarUnverifiedThe algorithm employs variance-reduced estimation of the Bellman optimality operator locally at each agent.62% similarUnverifiedFine-tuned DistilBERT achieves F1=0.9993 on in-distribution testing, but loses 12.9 mean average precision points under topic shift, a greater degradation than the linear model's 5.2 points.60% similarUnverifiedThe coefficient of determination R² for this power-law fit is 0.732, which improves to 0.821 after adding interaction terms.59% similarUnverifiedGPTQ由Frantar等人基于最优脑外科医生OBS框架提出，通过逐层Hessian矩阵补偿量化误差，在4bit精度下将70B模型困惑度损失控制在1%以内58% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/988723API
curl https://kongchang.com/api/v1/knowledge/claims/988723MCP
get_claim(id=988723)