[KongchangAI]
Unverified50% confidenceFactExact time

The paper establishes a high-probability uniform mixing bound for the critically damped Metropolis-adjusted Langevin algorithm (with persistent uniform refresh), requiring O((κ^{1/2} + L_H^{1/2} m^{-3/4}) d^{1/4}) gradient evaluations (ignoring logarithmic factors), where κ = L/m is the condition number and d is the dimension.

1
Sources
50%
Confidence
Long-term
Relevance
11/17/2026
First Seen

Sources

Related Entities

Related Claims

Cite This Claim

Stable URI
https://kongchang.com/claim/1179473
API
curl https://kongchang.com/api/v1/knowledge/claims/1179473
MCP
get_claim(id=1179473)