Semi-Supervised Learning Based on GAN With Mean and Variance Feature Matching

被引:14
作者
Hu, Cong [1 ,2 ]
Wu, Xiao-Jun [1 ,2 ]
Kittler, Josef [3 ]
机构
[1] Jiangnan Univ, Sch Internet Things Engn, Wuxi 214122, Jiangsu, Peoples R China
[2] Jiangnan Univ, Jiangsu Prov Engn Lab Pattern Recognit & Computat, Wuxi 214122, Jiangsu, Peoples R China
[3] Univ Surrey, Ctr Vis Speech & Signal Proc, Guildford GU2 7XH, Surrey, England
基金
中国国家自然科学基金; 英国工程与自然科学研究理事会;
关键词
Gallium nitride; Generative adversarial networks; Generators; Training; Semisupervised learning; Data models; Predictive models; Feature matching (FM); generative adversarial networks (GANs); image recognition; neural network; semi-supervised learning (SSL); REGRESSION;
D O I
10.1109/TCDS.2018.2875462
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The improved generative adversarial network (improved GAN) is a successful method using a generative adversarial model to solve the problem of semi-supervised learning (SSL). The improved GAN learns a generator with the technique of mean feature matching which penalizes the discrepancy of the first-order moment of the latent features. To better describe common attributes of a distribution, this paper proposes a novel SSL method which incorporates the first-order and the second-order moments of the features in an intermediate layer of the discriminator, called mean and variance feature matching GAN (MVFM-GAN). To capture more precisely the data manifold, not only the mean but also the variance is used in the latent feature learning. Compared with improved GAN and other traditional methods, MVFM-GAN achieves superior performance in semi-supervised classification tasks and a better stability of GAN training, particularly in the cases when the number of labeled samples is low. It shows a comparable performance with the state-of-the-art methods on several benchmark data sets. As a byproduct of the novel approach, MVFM-GAN generates realistic images of good visual quality.
引用
收藏
页码:539 / 547
页数:9
相关论文
共 50 条
[1]  
[Anonymous], NEURAL PROCESSING LE
[2]  
[Anonymous], 2018, ACM T GRAPHICS P SIG
[3]  
[Anonymous], 2002, CMUCALD02107
[4]  
[Anonymous], ADV NEURAL INFORM PR
[5]  
[Anonymous], 2017, ARXIV170302291
[6]  
[Anonymous], ARXIV180608482
[7]  
[Anonymous], 2017, ARXIV PREPRINT ARXIV
[8]  
[Anonymous], 2016, ARXIV161106430
[9]  
[Anonymous], 2016, ARXIV160600704
[10]  
Blum A., 1998, Proceedings of the Eleventh Annual Conference on Computational Learning Theory, P92, DOI 10.1145/279943.279962