Robust learning with imperfect privileged information

被引:31
作者
Li, Xue [1 ,2 ,3 ]
Du, Bo [1 ,2 ]
Xu, Chang [4 ,5 ]
Zhang, Yipeng [1 ,2 ]
Zhang, Lefei [1 ,2 ]
Tao, Dacheng [4 ,5 ]
机构
[1] Wuhan Univ, Natl Engn Res Ctr Multimedia Software, Sch Comp Sci, Wuhan, Peoples R China
[2] Wuhan Univ, Inst Artificial Intelligence, Wuhan, Peoples R China
[3] Wuhan Univ, State Key Lab Informat Engn Surveying Mapping & R, Wuhan, Peoples R China
[4] Univ Sydney, Fac Engn, UBTECH Sydney Artificial Intelligence Ctr, Sydney, NSW, Australia
[5] Univ Sydney, Fac Engn, Sch Comp Sci, Sydney, NSW, Australia
基金
国家重点研发计划; 中国国家自然科学基金; 澳大利亚研究理事会;
关键词
Learning using privileged information; Classification; Support vector machine;
D O I
10.1016/j.artint.2020.103246
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the learning using privileged information (LUPI) paradigm, example data cannot always be clean, while the gathered privileged information can be imperfect in practice. Here, imperfect privileged information can refer to auxiliary information that is not always accurate or perturbed by noise, or alternatively to incomplete privileged information, where privileged information is only available for part of the training data. Because of the lack of clear strategies for handling noise in example data and imperfect privileged information, existing learning using privileged information (LUPI) methods may encounter serious issues. Accordingly, in this paper, we propose a Robust SVM+ method to tackle imperfect data in LUPI. In order to make the SVM+ model robust to noise in example data and privileged information, Robust SVM+ maximizes the lower bound of the perturbations that may influence the judgement based on a rigorous theoretical analysis. Moreover, in order to deal with the incomplete privileged information, we use the available privileged information to help us in approximating the missing privileged information of training data. The optimization problem of the proposed method can be efficiently solved by employing a two-step alternating optimization strategy, based on iteratively deploying off-the-shelf quadratic programming solvers and the alternating direction method of multipliers (ADMM) technique. Comprehensive experiments on real-world datasets demonstrate the effectiveness of the proposed Robust SVM+ method in handling imperfect privileged information. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页数:19
相关论文
共 44 条
[1]  
Anguita D., 2013, ESANN, V3, P24
[2]  
[Anonymous], 2004, PREPROCESSING QUADRA
[3]  
[Anonymous], ARXIV170809083
[4]  
[Anonymous], IEEE C COMP VIS PATT
[5]  
[Anonymous], ARXIV180804437
[6]  
[Anonymous], 2006, P 23 INT C MACH LEAR, DOI [DOI 10.1145/1143844.1143865, 10.1145/1143844.1143865]
[7]  
Boyd S., 2011, DISTRIBUTED OPTIMIZA, DOI DOI 10.1561/2200000016
[8]   PARADIGMS FOR MACHINE LEARNING - INTRODUCTION [J].
CARBONELL, JG .
ARTIFICIAL INTELLIGENCE, 1989, 40 (1-3) :1-9
[9]   LABIN: Balanced Min Cut for Large-Scale Data [J].
Chen, Xiaojun ;
Chen, Renjie ;
Wu, Qingyao ;
Fang, Yixiang ;
Nie, Feiping ;
Huang, Joshua Zhexue .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2020, 31 (03) :725-736
[10]  
Chen YP, 2017, PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P1532