Pith. sign in

REVIEW 1 cited by

Anomaly detection with Wasserstein GAN

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1812.02463 v2 pith:LAOYMCPE submitted 2018-12-06 stat.ML cs.LG

classification stat.MLcs.LG
keywords anomalydetectionbeendatasetencodergenerativeinvestigateproduce
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. DPOT: A DeepParticle method for Computation of Optimal Transport with convergence guarantee

    stat.ML 2025-06 conditional novelty 5.0 of 10

    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.

Pith tools