23 research outputs found
Decomposition-based Generation Process for Instance-Dependent Partial Label Learning
Partial label learning (PLL) is a typical weakly supervised learning problem,
where each training example is associated with a set of candidate labels among
which only one is true. Most existing PLL approaches assume that the incorrect
labels in each training example are randomly picked as the candidate labels and
model the generation process of the candidate labels in a simple way. However,
these approaches usually do not perform as well as expected due to the fact
that the generation process of the candidate labels is always
instance-dependent. Therefore, it deserves to be modeled in a refined way. In
this paper, we consider instance-dependent PLL and assume that the generation
process of the candidate labels could decompose into two sequential parts,
where the correct label emerges first in the mind of the annotator but then the
incorrect labels related to the feature are also selected with the correct
label as candidate labels due to uncertainty of labeling. Motivated by this
consideration, we propose a novel PLL method that performs Maximum A
Posterior(MAP) based on an explicitly modeled generation process of candidate
labels via decomposed probability distribution models. Experiments on benchmark
and real-world datasets validate the effectiveness of the proposed method
Disambiguated Attention Embedding for Multi-Instance Partial-Label Learning
In many real-world tasks, the concerned objects can be represented as a
multi-instance bag associated with a candidate label set, which consists of one
ground-truth label and several false positive labels. Multi-instance
partial-label learning (MIPL) is a learning paradigm to deal with such tasks
and has achieved favorable performances. Existing MIPL approach follows the
instance-space paradigm by assigning augmented candidate label sets of bags to
each instance and aggregating bag-level labels from instance-level labels.
However, this scheme may be suboptimal as global bag-level information is
ignored and the predicted labels of bags are sensitive to predictions of
negative instances. In this paper, we study an alternative scheme where a
multi-instance bag is embedded into a single vector representation.
Accordingly, an intuitive algorithm named DEMIPL, i.e., Disambiguated attention
Embedding for Multi-Instance Partial-Label learning, is proposed. DEMIPL
employs a disambiguation attention mechanism to aggregate a multi-instance bag
into a single vector representation, followed by a momentum-based
disambiguation strategy to identify the ground-truth label from the candidate
label set. Furthermore, we introduce a real-world MIPL dataset for colorectal
cancer classification. Experimental results on benchmark and real-world
datasets validate the superiority of DEMIPL against the compared MIPL and
partial-label learning approaches.Comment: Accepted at NeurIPS 202