Unverified50% confidenceFactExact time
Due 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.
1
Sources
50%
Confidence
Long-term
Relevance
11/8/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedCommon 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.79% similarUnverifiedThe computation of the GW distance is usually transformed into a quadratic assignment problem, whose objective function is non-convex with respect to the coupling matrix.75% similarUnverified早停在优化角度上等价于限制参数从初始化点出发的移动距离,与L2正则化具有等价性67% similarUnverifiedBy injecting noise or perturbations into the data and observing the magnitude of change in the GW distance value, its stability can be evaluated; if the GW distance remains relatively stable under reasonable perturbations, its reliability as a similarity measure is higher.67% similarUnverifiedThe drawback of downstream task performance validation is that task performance is affected by many factors, making it difficult to attribute it solely to the quality of the GW distance.66% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1148780API
curl https://kongchang.com/api/v1/knowledge/claims/1148780MCP
get_claim(id=1148780)