Multiple instance learning with noisy labels based on symmetry loss

被引:0
作者
Zhang, Xuan [1 ]
Xu, Yitian [1 ]
Liu, Xuhua [1 ]
机构
[1] China Agr Univ, Coll Sci, Beijing 100083, Peoples R China
基金
中国国家自然科学基金;
关键词
Multiple instance learning; Noisy labels; Symmetry loss; Barrier hinge loss; CLASSIFICATION;
D O I
10.1016/j.asoc.2025.112795
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multiple instance learning (MIL) serves as a crucial form of weakly supervised learning, characterized by each training bag containing multiple instances with unknown labels, and each bag being assigned either a positive or negative label. The majority of prior studies have operated under the assumption that the labels in training datasets are entirely accurate. However, in many real-world scenarios, various factors such as limited knowledge may lead to labeling errors, resulting in label noise. Motivated by these challenges, this paper investigates MIL problems with label noise. To address this issue, we propose two frameworks: area under the receiver operating characteristic curve (AUC) maximization and balanced error rate (BER) minimization that highlight the advantages of incorporating symmetric loss. Moreover, we provide theoretical analysis to establish error bounds and ensure consistency. Finally, experimental results on seven datasets using six different losses not only demonstrate the effectiveness but also emphasize how introducing symmetric loss leads to superior performance. Furthermore, experiments on a convex barrier hinge loss further validate the significance of maintaining asymmetric condition despite its lack of symmetry everywhere.
引用
收藏
页数:10
相关论文
共 38 条
[1]  
[Anonymous], 2003, Adv Neural Inf Process Syst, DOI DOI 10.5555/2968618.2968690
[2]  
[Anonymous], 2000, P 17 INT C MACHINE L
[3]   Convex formulation of multiple instance learning from positive and unlabeled bags [J].
Bao, Han ;
Sakai, Tomoya ;
Sato, Issei ;
Sugiyama, Masashi .
NEURAL NETWORKS, 2018, 105 :132-141
[4]  
Bartlett P. L., 2003, Journal of Machine Learning Research, V3, P463, DOI 10.1162/153244303321897690
[5]   Convexity, classification, and risk bounds [J].
Bartlett, PL ;
Jordan, MI ;
McAuliffe, JD .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2006, 101 (473) :138-156
[6]  
Cao Yuzhou, 2021, P MACHINE LEARNING R, V139
[7]   Multiple instance learning: A survey of problem characteristics and applications [J].
Carbonneau, Marc-Andre ;
Cheplygina, Veronika ;
Granger, Eric ;
Gagnon, Ghyslain .
PATTERN RECOGNITION, 2018, 77 :329-353
[8]  
Charoenphakdee N, 2019, 2019 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING AND THE 9TH INTERNATIONAL JOINT CONFERENCE ON NATURAL LANGUAGE PROCESSING (EMNLP-IJCNLP 2019), P3993
[9]  
Charoenphakdee N, 2019, PR MACH LEARN RES, V97
[10]   Solving the multiple instance problem with axis-parallel rectangles [J].
Dietterich, TG ;
Lathrop, RH ;
LozanoPerez, T .
ARTIFICIAL INTELLIGENCE, 1997, 89 (1-2) :31-71