Unverified50% confidenceFactExact time
Common means of mitigating non-convexity in GW distance optimization include multiple random restarts, using better initializations (such as couplings based on spectral methods or the Wasserstein distance), and designing convex relaxation approximations.
1
Sources
50%
Confidence
Long-term
Relevance
11/8/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedDue to the non-convexity of GW distance optimization, different initializations may converge to different local optima, causing the same pair of inputs to yield different GW distance values.79% similarUnverified早停在优化角度上等价于限制参数从初始化点出发的移动距离,与L2正则化具有等价性67% similarUnverified正则化方法(如L1/L2正则化、Dropout、早停法)本质上是通过引入少量偏差来大幅降低方差,从而提升泛化能力67% similarVerifiedApproximate nearest neighbor (ANN) algorithms such as HNSW and IVF achieve order-of-magnitude speed improvements by sacrificing a small amount of precision.66% similarUnverifiedGaussian kernels maintain a Gaussian form in both the spatial and frequency domains and are continuously differentiable at all derivatives, so they can be efficiently solved using optimization methods such as gradient descent.66% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1148781API
curl https://kongchang.com/api/v1/knowledge/claims/1148781MCP
get_claim(id=1148781)