mlsanityData to 14 Oct 2026

ScarceGAN: Discriminative Classification Framework for Rare Class Identification for Longitudinal Data with Weak Prior

arXiv 2505.03811 ↗First posted 2 May 2025cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

This paper introduces ScarceGAN which focuses on identification of extremely rare or scarce samples from multi-dimensional longitudinal telemetry data with small and weak label prior. We specifically address: (i) severe scarcity in positive class, stemming from both underlying organic skew in the data, as well as extremely limited labels; (ii) multi-class nature of the negative samples, with uneven density distributions and partially overlapping feature distributions; and (iii) massively unlabelled data leading to tiny and weak prior on both positive and negative classes, and possibility of unseen or unknown behavior in the unlabelled set, especially in the negative class. Although related to PU learning problems, we contend that knowledge (or lack of it) on the negative class can be leveraged to learn the compliment of it (i.e., the positive class) better in a semi-supervised manner. To this effect, ScarceGAN re-formulates semi-supervised GAN by accommodating weakly labelled multi-class negative samples and the available positive samples. It relaxes the supervised discriminator's constraint on exact differentiation between negative samples by introducing a 'leeway' term for samples with noisy prior. We propose modifications to the cost objectives of discriminator, in supervised and unsupervised path as well as that of the generator. For identifying risky players in skill gaming, this formulation in whole gives us a recall of over 85% (~60% jump over vanilla semi-supervised GAN) on our scarce class with very minimal verbosity in the unknown space. Further ScarceGAN outperforms the recall benchmarks established by recent GAN based specialized models for the positive imbalanced class identification and establishes a new benchmark in identifying one of rare attack classes (0.09%) in the intrusion dataset from the KDDCUP99 challenge.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 58 references that are in the map. First posted on arXiv 2 May 2025.

Builds on

22 of 58 references.

References · 22

  1. 2016Improved Techniques for Training GANscited by 2,970
  2. 2014Conditional Generative Adversarial Netscited by 2,162
  3. 2015Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networkscited by 2,054
  4. 2016Least Squares Generative Adversarial Networkscited by 1,001
  5. 2017Wasserstein GANcited by 639
  6. 2017Unsupervised Anomaly Detection with Generative Adversarial Networks to Guide Marker Discoverycited by 566
  7. 2014Semi-Supervised Learning with Deep Generative Modelscited by 496
  8. 2016NIPS 2016 Tutorial: Generative Adversarial Networkscited by 285
  9. 2017Positive-Unlabeled Learning with Non-Negative Risk Estimatorcited by 219
  10. 2017LSTM Fully Convolutional Networks for Time Series Classificationcited by 136
  11. 2018Adversarially Learned Anomaly Detectioncited by 115
  12. 2016Deep Structured Energy Based Models for Anomaly Detectioncited by 114
10 more
  1. 2016Semi-Supervised Learning with Generative Adversarial Networkscited by 103
  2. 2015Unsupervised and Semi-supervised Learning with Categorical Generative Adversarial Networkscited by 95
  3. 2017Good Semi-supervised Learning that Requires a Bad GANcited by 86
  4. 2016Auxiliary Deep Generative Modelscited by 72
  5. 2019Robust Anomaly Detection in Images using Adversarial Autoencoderscited by 38
  6. 2013Deep Generative Stochastic Networks Trainable by Backpropcited by 36
  7. 2018Label-Noise Robust Generative Adversarial Networkscited by 22
  8. 2018Benchmarking datasets for Anomaly-based Network Intrusion Detection: KDD CUP 99 alternativescited by 18
  9. 2020Teaching a GAN What Not to Learncited by 13
  10. 2019Generative-Discriminative Complementary Learningcited by 12

Built on by

Not cited yet.