Unverified50% confidenceFactExact time
In DRO, the Wasserstein distance is used to construct an ambiguity set centered on the empirical distribution with radius ε, that is, all distributions whose distance to the empirical distribution does not exceed ε.
1
Sources
50%
Confidence
Long-term
Relevance
11/2/2026
First Seen
Sources
Related Entities
Related Claims
Unverified切片Wasserstein距离（SWD）通过将高维分布随机投影到大量一维方向上，在每个方向计算Wasserstein距离后取平均，从而降低计算复杂度69% similarUnverifiedThe 2-Wasserstein distance is more sensitive to the geometric shape of the support sets of distributions than KL divergence, and can yield meaningful finite distance values even when the support sets of two distributions do not overlap.68% similarUnverifiedWasserstein distance bypasses the label permutation problem by representing clustering partitions as probability measures and solving an optimal transport problem, measuring the minimum total cost required to transport one partition into another.67% similarUnverifiedThe Wasserstein distance is sensitive to the geometric positions of the supports of distributions, making it especially natural when comparing distributions over a continuous answer space.67% similarUnverifiedThe core idea of distributionally robust optimization (DRO) is to optimize worst-case performance within an ambiguity set, without assuming the data distribution is fully known.66% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1125683API
curl https://kongchang.com/api/v1/knowledge/claims/1125683MCP
get_claim(id=1125683)