Skip to content
Tagged articles

Wasserstein Distance

3 articles · Page 1 of 1
Data Party THU
Data Party THU
Oct 14, 2026 · Artificial Intelligence

Optimal Transport Meets RL: A Survey from Distribution Matching to Robust Decisions

This 72-page survey explores how optimal transport provides geometric tools for comparing distributions in reinforcement learning, covering imitation learning, policy optimization, model-based RL, offline RL, robustness, and transfer, while analyzing design choices in cost functions, temporal handling, and computational trade-offs.

Offline RLOptimal TransportPolicy Optimization
0 likes · 35 min read
Optimal Transport Meets RL: A Survey from Distribution Matching to Robust Decisions
Rare Earth Juejin Tech Community
Rare Earth Juejin Tech Community
Oct 8, 2022 · Artificial Intelligence

Wasserstein GAN (WGAN): Theory and Hands‑On Implementation

This article explains why traditional GANs suffer from training instability, introduces the Wasserstein (Earth‑Mover) distance as a smoother alternative, derives the WGAN objective, discusses Lipschitz constraints, and provides practical PyTorch code modifications to convert a vanilla GAN into a stable WGAN.

Deep LearningGANPyTorch
0 likes · 21 min read
Wasserstein GAN (WGAN): Theory and Hands‑On Implementation
Hulu Beijing
Hulu Beijing
Mar 6, 2018 · Artificial Intelligence

Understanding WGANs: From GAN Pitfalls to Wasserstein Solutions

This article explains the shortcomings of traditional GANs, introduces the Wasserstein GAN (WGAN) as a remedy using the Earth‑Mover distance, describes the theoretical motivations, outlines the algorithmic steps and constraints, and provides illustrative diagrams and references for deeper study.

Deep LearningGenerative Adversarial NetworksWGAN
0 likes · 11 min read
Understanding WGANs: From GAN Pitfalls to Wasserstein Solutions