Unverified50% confidenceFactExact time
The k-partition probing mechanism randomly divides committed token positions into k non-overlapping subsets, re-masking one subset at a time and performing one forward inference pass.
1
Sources
50%
Confidence
Long-term
Relevance
10/8/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedReverse KL divergence is mode-seeking, while forward KL divergence is mean-seeking.70% similarUnverifiedK-means对初始簇中心敏感，K-means++通过概率化初始化缓解这一问题66% similarUnverifiedThe K-Means clustering algorithm inherently relies on Euclidean distance in its standard implementation, computing the Euclidean distance from each sample point to the cluster center at every step to assign categories.66% similarUnverifiedReranking uses a Cross-Encoder model to re-score and re-rank the candidate chunks recalled by Top-K, with precision far higher than that of a Bi-Encoder.65% similarUnverifiedDiffusionGemma使用双向注意力，去掉因果掩码，让每个位置能同时关注序列中所有其他位置，机制与BERT编码器相同65% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/986621API
curl https://kongchang.com/api/v1/knowledge/claims/986621MCP
get_claim(id=986621)