Summary
This paper proposes a new algorithm for a weakly supervised learning paradigm called multi-instance partial label learning, where each sample is represented by a multi-instance bag and its label is provided as a set of candidate labels. This is a particularly challenging learning paradigm since learners do not have access to which label is the ground truth label from the candidate label set, and do not know which instance corresponds to the ground truth label. The authors proposed a deep learning algorithm to solve the problem integrating the attention mechanism with a disambiguation strategy. The attention mechanism map the multi-instance representation into a single-vector and the disambiguation strategy identifies the true label from the candidate label set. The synergy of these two components is validated with a wide range of benchmark datasets. Furthermore, this manuscript also proposed a new crowd-labelled medical dataset that can be used as future benchmarks for this learning task.
Strengths
* The problem setting that motivates this study is novel and potentially impactful. The multi-instance partial label learning paradigm simultaneously addresses the challenges two of the most widely studied weakly supervised learning setting, multi-instance learning and partial label learning.
* The paper introduces a new real-world dataset for histopathology image classification from weak supervision in the form of multi-instance bags supervised with candidate label sets. This indicates that the proposed learning paradigm and algorithm can potentially alleviate the labelling cost of medical image dataset.
* The proposed disambiguation attention mechanism applies to both binary and multi-class classification scenarios, whereas existing attention mechanisms designed for multi-instance bags can only handle binary classification.
* The proposed algorithm demonstrates good performance improvement compared to a wide range of existing arts.
Weaknesses
* The synergy of disambiguation attention mechanism and momentum-based disambiguation strategy can be further explored/evaluated. See questions for more on this.
Questions
* DEMIPL performs classification by aggregates the instances into a single-vector bag representation. Would it be better if instance representation and bag representation are used simultaneously for classification and disambiguation?
* Since the momentum-based disambiguation strategy degenerates to progressive disambiguation strategy proposed in [39], how would the performance be if momentum-based disambiguation is used directly in the algorithm proposed in [39]? This may provide empirical evidence on the synergy of momentum-based disambiguation and disambiguation attention.
* Is there feasibility to learn which instance corresponds to the true label in the candidate label set, i.e., instance-level classification from MIPL datasets?
* Is there any plan for releasing the CRC-MIPL dataset?
Rating
8: Strong Accept: Technically strong paper, with novel ideas, excellent impact on at least one area, or high-to-excellent impact on multiple areas, with excellent evaluation, resources, and reproducibility, and no unaddressed ethical considerations.
Confidence
4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.
Limitations
This paper does not explicitly discuss its limitations.