AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Article Link
Collect
Submit Manuscript
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Regular Paper

NPC: Negative Prototypical Contrasting for Label Disambiguation of Partial Label Learning

Yu-Jie Jin1,2,3, Ya-Sha Wang1,2,4, Xu Chu1,2,3,5( )
National Research and Engineering Center of Software Engineering, Peking University, Beijing 100871, China
School of Computer Science, Peking University, Beijing 100871, China
Key Laboratory of High Confidence Software Technologies, Ministry of Education, Beijing 100871, China
Peking University Information Technology Institute (Tianjin Binhai), Tianjin 300384, China
Center on Frontiers of Computing Studies, Peking University, Beijing 100871, China
Show Author Information

Abstract

Partial label learning (PLL) learns under label ambiguity where each training instance is annotated with a set of candidate labels, among which only one is the ground-truth label. Recent advances showed that PLL can be promoted by combining label disambiguation with representation learning coherently, which achieved state-of-the-art performance. However, most of the existing deep PLL methods over-emphasize pulling the inaccurate pseudo-label-induced positive samples and fail to achieve a balance between the intra-class compactness and the inter-class separability, thus leading to a sub-optimal representation space. In this paper, we solve this issue by taking into account the pure negative supervision information which can be extracted perfectly from the non-candidate label set. Methodologically, we propose a novel framework Negative Prototypical Contrasting (NPC). The optimization objective of NPC contrasts each instance with its candidate prototypes against its negative prototypes, aiming at a sufficiently distinguishable representation space. Based on the learned representations, the label disambiguation process is performed in a moving-average style. Theoretically, we show that the objective of NPC is equivalent to solving a constrained maximum likelihood optimization. We also justify applying the moving average from the stochastic expectation-maximization perspective. Empirically, extensive experiments demonstrate that the proposed NPC method achieves state-of-the-art classification performance on various datasets, and even competes with its supervised counterparts.

Electronic Supplementary Material

Download File(s)
JCST-2404-14348-Highlights.pdf (186.4 KB)

References

【1】
【1】
 
 
Journal of Computer Science and Technology
Pages 1386-1400

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Jin Y-J, Wang Y-S, Chu X. NPC: Negative Prototypical Contrasting for Label Disambiguation of Partial Label Learning. Journal of Computer Science and Technology, 2025, 40(5): 1386-1400. https://doi.org/10.1007/s11390-025-4348-9

899

Views

0

Crossref

0

Web of Science

0

Scopus

0

CSCD

Received: 09 April 2024
Accepted: 31 July 2025
Published: 10 September 2025
© Institute of Computing Technology, Chinese Academy of Sciences 2025