Unverified50% confidenceEventExact time
Stadlmann compressed the upper bound to 240, and three days later GPT-6, following his method, compressed the upper bound to 186.
1
Sources
50%
Confidence
Long-term
Relevance
9/26/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe Polymath project 2, a collaboration between Terence Tao and Maynard, compressed the upper bound to 246.75% similarUnverifiedINT4量化将原本由65536个不同值（FP16）表示的权重压缩到仅16个离散级别67% similarUnverifiedW4A4量化将权重和激活值均压缩至4位整数，理论上相比FP16可将显存占用降低至约1/458% similarUnverified以 GPT-3 为例，r=4 时 LoRA 可将可训练参数从 175B 降至约 4.7M，减少约 37,000 倍58% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/951528API
curl https://kongchang.com/api/v1/knowledge/claims/951528MCP
get_claim(id=951528)