Kolmogorov-Smirnov GAN

Maciej Falkiewicz, Naoya Takeishi, Alexandros Kalousis
6/28/2024
stat.MLcs.LG

No official code found. Best implementation: DMML-Geneva/ksgan (3 stars, BSD-3-Clause, last commit 2024-07-05).

Abstract

We propose a novel deep generative model, the Kolmogorov-Smirnov Generative Adversarial Network (KSGAN). Unlike existing approaches, KSGAN formulates the learning process as a minimization of the Kolmogorov-Smirnov (KS) distance, generalized to handle multivariate distributions. This distance is calculated using the quantile function, which acts as the critic in the adversarial training process. We formally demonstrate that minimizing the KS distance leads to the trained approximate distribution aligning with the target distribution. We propose an efficient implementation and evaluate its effectiveness through experiments. The results show that KSGAN performs on par with existing adversarial methods, exhibiting stability during training, resistance to mode dropping and collapse, and tolerance to variations in hyperparameter settings. Additionally, we review the literature on the Generalized KS test and discuss the connections between KSGAN and existing adversarial generative models.

View on arXivView PDF

Code Implementations(1)

DMML-Geneva/ksganCommunity100%
BSD-3-Clause

Kolmogorov–Smirnov GAN

31Shell, PythonJun 28, 20242 years agoBSD-3-Clause

Similar Papers

Cite this paper

@article{falkiewicz2024kolmogorovsmirnov,
  title  = {Kolmogorov-Smirnov GAN},
  author = {Maciej Falkiewicz and Naoya Takeishi and Alexandros Kalousis},
  year   = {2024},
  eprint = {2406.19948},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2406.19948v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2406.19948.svg)](https://codeofpaper.com/paper/2406.19948)

Discussion