A Self-paced Regularization Framework for Partial-Label Learning
Partial label learning (PLL) aims to solve the problem where each training instance is associated with a set of candidate labels, one of which is the correct label. Most PLL algorithms try to disambiguate the candidate label set, by either simply treating each candidate label equally or iteratively identifying the true label. Nonetheless, existing algorithms usually treat all labels and instances equally, and the complexities of both labels and instances are not taken into consideration during the learning stage. Inspired by the successful application of self-paced learning strategy in machine learning field, we integrate the self-paced regime into the partial label learning framework and propose a novel Self-Paced Partial-Label Learning (SP-PLL) algorithm, which could control the learning process to alleviate the problem by ranking the priorities of the training examples together with their candidate labels during each learning iteration. Extensive experiments and comparisons with other baseline methods demonstrate the effectiveness and robustness of the proposed method.
Code (0)
등록된 구현이 없습니다.
Tasks
Partial Label LearningSimilar Papers 제목 키워드 기반
A Self-Paced Regularization Framework for Multi-Label Learning
In this paper, we propose a novel multi-label learning framework, called Multi-Label Self-Paced Learning (MLSPL), in an attempt to incorporate the self-paced learning strategy into multi-label learning regime. In light o…
Multi-Label LearningUnsupervised feature selection via self-paced learning and low-redundant regularization
Much more attention has been paid to unsupervised feature selection nowadays due to the emergence of massive unlabeled data. The distribution of samples and the latent effect of training a learning method using samples i…
feature selectionLearning to Discover Knowledge: A Weakly-Supervised Partial Domain Adaptation Approach
Domain adaptation has shown appealing performance by leveraging knowledge from a source domain with rich annotations. However, for a specific target task, it is cumbersome to collect related and high-quality source domai…
Domain AdaptationPartial Domain AdaptationSelf-Paced Sample Selection for Barely-Supervised Medical Image Segmentation
The existing barely-supervised medical image segmentation (BSS) methods, adopting a registration-segmentation paradigm, aim to learn from data with very few annotations to mitigate the extreme label scarcity problem. How…
Contrastive LearningImage RegistrationImage SegmentationMedical Image Segmentation+2Adaptive Mix for Semi-Supervised Medical Image Segmentation
Mix-up is a key technique for consistency regularization-based semi-supervised learning methods, blending two or more images to generate strong-perturbed samples for strong-weak pseudo supervision. Existing mix-up operat…
Image SegmentationMedical Image SegmentationSemantic SegmentationSemi-supervised Medical Image Segmentation