Relative Wasserstein Angle and the Problem of the $W_2$-Nearest Gaussian Distribution
Binshuai Wang, Peng Wei
TL;DR
This paper introduces a geometric framework for measuring non-Gaussianity in probability distributions under the 2-Wasserstein OT metric by defining the relative Wasserstein angle ($RW_2$ angle) and the orthogonal projection distance. By exploiting the cone structure of translations and dilations in the $RW_2$ space, the authors show that the filling cone between two rays is flat, enabling Euclidean-like notions of angles and projections and reframing Gaussian approximation as projection onto the Gaussian cone. They prove that the moment-matching Gaussian is typically not the $W_2$-nearest Gaussian, provide a closed-form solution in one dimension, and develop a dual-based, stochastic Riemannian optimization method for high dimensions. Experiments on synthetic data and real-world feature distributions demonstrate that the $W_2$-nearest Gaussian yields smaller $RW_2$ angles and projection distances than moment matching, offering more faithful Gaussian surrogates and improved robustness, especially for high-dimensional data. The framework has potential applications beyond Gaussian models, enabling robust, geometry-grounded distribution comparisons and enhancements to evaluation metrics like FID.
Abstract
We study the problem of quantifying how far an empirical distribution deviates from Gaussianity under the framework of optimal transport. By exploiting the cone geometry of the relative translation invariant quadratic Wasserstein space, we introduce two novel geometric quantities, the relative Wasserstein angle and the orthogonal projection distance, which provide meaningful measures of non-Gaussianity. We prove that the filling cone generated by any two rays in this space is flat, ensuring that angles, projections, and inner products are rigorously well-defined. This geometric viewpoint recasts Gaussian approximation as a projection problem onto the Gaussian cone and reveals that the commonly used moment-matching Gaussian can \emph{not} be the \(W_2\)-nearest Gaussian for a given empirical distribution. In one dimension, we derive closed-form expressions for the proposed quantities and extend them to several classical distribution families, including uniform, Laplace, and logistic distributions; while in high dimensions, we develop an efficient stochastic manifold optimization algorithm based on a semi-discrete dual formulation. Experiments on synthetic data and real-world feature distributions demonstrate that the relative Wasserstein angle is more robust than the Wasserstein distance and that the proposed nearest Gaussian provides a better approximation than moment matching in the evaluation of Fréchet Inception Distance (FID) scores.
