ReLaB: Reliable Label Bootstrapping for Semi-Supervised Learning

被引:5
作者
Albert, Paul [1 ]
Ortego, Diego [1 ]
Arazo, Eric [1 ]
O'Connor, Noel [1 ]
McGuinness, Kevin [1 ]
机构
[1] Dublin City Univ, Insight Ctr Data Analyt, Sch Elect Engn, Dublin, Ireland
来源
2021 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN) | 2021年
基金
爱尔兰科学基金会;
关键词
D O I
10.1109/IJCNN52387.2021.9533616
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Reducing the amount of labels required to train convolutional neural networks without performance degradation is key to effectively reduce human annotation efforts. We propose Reliable Label Bootstrapping (ReLaB), an unsupervised preprossessing algorithm which improves the performance of semi-supervised algorithms in extremely low supervision settings. Given a dataset with few labeled samples, we first learn meaningful self-supervised, latent features for the data. Second, a label propagation algorithm propagates the known labels on the unsupervised features, effectively labeling the full dataset in an automatic fashion. Third, we select a subset of correctly labeled (reliable) samples using a label noise detection algorithm. Finally, we train a semi-supervised algorithm on the extended subset. We show that the selection of the network architecture and the self-supervised algorithm are important factors to achieve successful label propagation and demonstrate that ReLaB substantially improves semi-supervised learning in scenarios of very limited supervision on image classification benchmarks such as CIFAR10, CIFAR-100 and mini-ImageNet. We reach average error rates of 22:34 with 1 random labeled sample per class on CIFAR-10 and lower this error to 8:46 when the labeled sample in each class is highly representative. Our work is fully reproducible: https://github.com/PaulAlbert31/ReLaB.
引用
收藏
页数:8
相关论文
共 73 条
[1]  
[Anonymous], 2019, IEEE C COMP VIS PATT
[2]  
[Anonymous], 2013, INTERNATIONAL CONFER
[3]  
[Anonymous], 2020, ARXIV 2001 07685
[4]  
[Anonymous], 2019, ARXIV 1905 08845
[5]  
[Anonymous], 2016, ARXIV 1602 07332
[6]  
[Anonymous], 2020, 2020 INT JOINT C NEU
[7]  
[Anonymous], 2015, IEEE C COMP VIS PATT
[8]  
[Anonymous], 2006, TECH REP
[9]  
[Anonymous], 2019, IEEE IC COMP COM NET
[10]  
[Anonymous], 2019, ARXIV 1901 05657