LLP-GAN: A GAN-Based Algorithm for Learning From Label Proportions

被引:5
作者
Liu, Jiabin [1 ]
Wang, Bo [2 ]
Hang, Hanyuan [3 ]
Wang, Huadong [4 ]
Qi, Zhiquan [5 ]
Tian, Yingjie [5 ]
Shi, Yong [5 ]
机构
[1] Beijing Inst Technol, Sch Informat & Elect, Beijing 100081, Peoples R China
[2] Univ Int Business & Econ, Sch Informat Technol & Management, Beijing 100029, Peoples R China
[3] Univ Twente, Dept Appl Math, NL-7522 NB Enschede, Netherlands
[4] Tsinghua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China
[5] Univ Chinese Acad Sci, Sch Econ & Management, Beijing 100180, Peoples R China
基金
中国国家自然科学基金;
关键词
Supervised learning; Entropy; Training; Task analysis; Privacy; Generators; Generative adversarial networks; Generative adversarial networks (GANs); learning from label proportions (LLP); privacy protection; weakly supervised learning;
D O I
10.1109/TNNLS.2022.3149926
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Learning from label proportions (LLP) is a widespread and important learning paradigm: only the bag-level proportional information of the grouped training instances is available for the classification task, instead of the instance-level labels in the fully supervised scenario. As a result, LLP is a typical weakly supervised learning protocol and commonly exists in privacy protection circumstances due to the sensitivity in label information for real-world applications. In general, it is less laborious and more efficient to collect label proportions as the bag-level supervised information than the instance-level one. However, the hint for learning the discriminative feature representation is also limited as a less informative signal directly associated with the labels is provided, thus deteriorating the performance of the final instance-level classifier. In this article, delving into the label proportions, we bypass this weak supervision by leveraging generative adversarial networks (GANs) to derive an effective algorithm LLP-GAN. Endowed with an end-to-end structure, LLP-GAN performs approximation in the light of an adversarial learning mechanism without imposing restricted assumptions on distribution. Accordingly, the final instance-level classifier can be directly induced upon the discriminator with minor modification. Under mild assumptions, we give the explicit generative representation and prove the global optimality for LLP-GAN. In addition, compared with existing methods, our work empowers LLP solvers with desirable scalability inheriting from deep models. Extensive experiments on benchmark datasets and a real-world application demonstrate the vivid advantages of the proposed approach.
引用
收藏
页码:8377 / 8388
页数:12
相关论文
共 48 条
[1]  
[Anonymous], 2009, Convex optimization
[2]  
[Anonymous], 2009, AISTATS
[3]  
[Anonymous], 2017, ARXIV170807747
[4]  
Ardehaly E. M., 2016, IJCAI, P3670
[5]   Co-training for Demographic Classification Using Deep Learning from Label Proportions [J].
Ardehaly, Ehsan Mohammady ;
Culotta, Aron .
2017 17TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING WORKSHOPS (ICDMW 2017), 2017, :1017-1024
[6]  
Arjovsky M., 2016, P INT C LEARN REPR, P1
[7]  
Arjovsky M, 2017, PR MACH LEARN RES, V70
[8]  
Bishop C., 2006, Pattern Recognition and Machine Learning
[9]   High-Quality Proposals for Weakly Supervised Object Detection [J].
Cheng, Gong ;
Yang, Junyu ;
Gao, Decheng ;
Guo, Lei ;
Han, Junwei .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2020, 29 :5794-5804
[10]  
Clanuwat Tarin, 2018, Deep Learning for Classical Japanese Literature