Unverified50% confidenceOpinionExact time
The classical Dobrushin contraction version requires globally uniform contraction, which is too stringent for algorithms like HMC that mix quickly only locally and may be very slow globally.
1
Sources
50%
Confidence
Long-term
Relevance
11/17/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe key improvement of this paper lies in localizing Dobrushin contraction: verifying contraction only within the naturally arising "fast local mixing region," and then stitching the local conclusions into a global high-probability bound with the help of the weak-(1,1) maximal inequality.70% similarUnverified只有在LLM推理比embedding加向量检索慢数十倍以上时,语义缓存才能同时实现降本与提速69% similarUnverifiedOn-device deployment is constrained by compute power, storage and model size, and typically requires compressing the model, which may further reduce accuracy.66% similarUnverifiedThe convergence rate of reversible Markov processes is often limited by the spectral gap.66% similarUnverifiedThe latency lower bound of micro-batch is limited by the scheduler's minimum scheduling granularity and the processing time of a single batch, and cannot be compressed indefinitely by merely reducing the interval.66% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1179483API
curl https://kongchang.com/api/v1/knowledge/claims/1179483MCP
get_claim(id=1179483)