A simple two-term loss whose minimizer is the Monge map, with a stability bound showing the learned map converges to the optimal transport map as the loss gap shrinks.
Anomaly detection with Wasserstein GAN
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Generative adversarial networks are a class of generative algorithms that have been widely used to produce state-of-the-art samples. In this paper, we investigate GAN to perform anomaly detection on time series dataset. In order to achieve this goal, a bibliography is made focusing on theoretical properties of GAN and GAN used for anomaly detection. A Wasserstein GAN has been chosen to learn the representation of normal data distribution and a stacked encoder with the generator performs the anomaly detection. W-GAN with encoder seems to produce state of the art anomaly detection scores on MNIST dataset and we investigate its usage on multi-variate time series.
fields
stat.ML 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
DPOT: A DeepParticle method for Computation of Optimal Transport with convergence guarantee
A simple two-term loss whose minimizer is the Monge map, with a stability bound showing the learned map converges to the optimal transport map as the loss gap shrinks.