Distance Guided Generative Adversarial Network for Explainable Binary Classifications
Xiangyu Xiong, Yue Sun, Xiaohong Liu, Wei Ke, Chan-Tong Lam, Jiangang Chen, Mingfeng Jiang, Mingwei Wang, Hui Xie, Tong Tong, Qinquan Gao, Hao Chen, Tao Tan
TL;DR
Data scarcity in binary classification often leads to overfitting and opaque decision boundaries. The authors propose DisGAN, a distance-guided GAN that conditions inter-domain and intra-domain generation on vertical and horizontal distances to a fixed optimal hyperplane $C(z)=w^T z + b$, thereby reshaping the margin and improving explainability via class-difference maps. VerDisGAN and HorDisGAN, along with cycle-consistency and distance losses, demonstrate improved ACC and AUC on natural and medical datasets, and provide interpretable localization of decision-relevant regions. The framework is architecture-agnostic, scalable to multiple backbones, and extensible to multi-class settings, offering a practical path for robust, explainable data augmentation in limited-data scenarios.
Abstract
Despite the potential benefits of data augmentation for mitigating the data insufficiency, traditional augmentation methods primarily rely on the prior intra-domain knowledge. On the other hand, advanced generative adversarial networks (GANs) generate inter-domain samples with limited variety. These previous methods make limited contributions to describing the decision boundaries for binary classification. In this paper, we propose a distance guided GAN (DisGAN) which controls the variation degrees of generated samples in the hyperplane space. Specifically, we instantiate the idea of DisGAN by combining two ways. The first way is vertical distance GAN (VerDisGAN) where the inter-domain generation is conditioned on the vertical distances. The second way is horizontal distance GAN (HorDisGAN) where the intra-domain generation is conditioned on the horizontal distances. Furthermore, VerDisGAN can produce the class-specific regions by mapping the source images to the hyperplane. Experimental results show that DisGAN consistently outperforms the GAN-based augmentation methods with explainable binary classification. The proposed method can apply to different classification architectures and has potential to extend to multi-class classification.
