<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>GAN on English AI Terms Dictionary</title><link>https://terms-en.ai-term-hub.com/en/tags/gan/</link><description>Recent content in GAN on English AI Terms Dictionary</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Sat, 18 Jul 2026 11:44:44 +0000</lastBuildDate><atom:link href="https://terms-en.ai-term-hub.com/en/tags/gan/index.xml" rel="self" type="application/rss+xml"/><item><title>Wasserstein</title><link>https://terms-en.ai-term-hub.com/en/terms/wasserstein/</link><pubDate>Sat, 18 Jul 2026 09:38:06 +0000</pubDate><guid>https://terms-en.ai-term-hub.com/en/terms/wasserstein/</guid><description>&lt;h2 id="definition">Definition&lt;/h2>
&lt;p>The Wasserstein distance, also known as Earth Mover&amp;rsquo;s Distance, quantifies the dissimilarity between two probability distributions by calculating the minimum &amp;lsquo;work&amp;rsquo; required to move mass from one distribution to match the other. Unlike KL divergence, it provides a smooth gradient even when distributions have disjoint support, making it highly effective for training Generative Adversarial Networks (GANs) and stabilizing convergence in generative modeling tasks.&lt;/p>
&lt;h3 id="summary">Summary&lt;/h3>
&lt;p>A metric measuring the distance between probability distributions based on the minimum cost of transforming one into another.&lt;/p></description></item></channel></rss>