paper-with-me

홈 › Papers

Kolmogorov-Smirnov GAN

2024-06-28 · Maciej Falkiewicz, Naoya Takeishi, Alexandros Kalousis

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.

📄 PDF Abstract BibTeX arXiv:2406.19948

Code (1)

dmml-geneva/ksgan 공식 구현 pytorch

Tasks

Generative Adversarial Network

Similar Papers 제목 키워드 기반

Learning High-Density Regions for a Generalized Kolmogorov-Smirnov Test in High-Dimensional Data

2012-12-01 · NeurIPS 2012 12 · Assaf Glazer, Michael Lindenbaum, Shaul Markovitch

We propose an efficient, generalized, nonparametric, statistical Kolmogorov-Smirnov test for detecting distributional change in high-dimensional data. To implement the test, we introduce a novel, hierarchical, minimum-vo…

Vocal Bursts Intensity Prediction

A robust algorithm for explaining unreliable machine learning survival models using the Kolmogorov-Smirnov bounds

2020-05-05 · Maxim S. Kovalev, Lev V. Utkin

A new robust algorithm based of the explanation method SurvLIME called SurvLIME-KS is proposed for explaining machine learning survival models. The algorithm is developed to ensure robustness to cases of a small amount o…

BIG-bench Machine Learning

A Higher-Order Kolmogorov-Smirnov Test

2019-03-24 · Veeranjaneyulu Sadhanala, Yu-Xiang Wang, Aaditya Ramdas, Ryan J. Tibshirani

We present an extension of the Kolmogorov-Smirnov (KS) two-sample test, which can be more sensitive to differences in the tails. Our test statistic is an integral probability metric (IPM) defined over a higher-order tota…

Integral Probability Metrics Meet Neural Networks: The Radon-Kolmogorov-Smirnov Test

2023-09-05 · Seunghoon Paik, Michael Celentano, Alden Green, Ryan J. Tibshirani

Integral probability metrics (IPMs) constitute a general class of nonparametric two-sample tests that are based on maximizing the mean difference between samples from one distribution $P$ versus another $Q$, over all cho…

Efficient and Stable Multi-Dimensional Kolmogorov-Smirnov Distance

2025-04-15 · Peter Matthew Jacobs, Foad Namjoo, Jeff M. Phillips

We revisit extending the Kolmogorov-Smirnov distance between probability distributions to the multidimensional setting and make new arguments about the proper way to approach this generalization. Our proposed formulation…