- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies noisy-label medical image classification with hybrid quantum neural networks. It proposes SLT, which uses the running minimum of the mean predictive entropy to decide when to update a label-transition matrix. At an update step, the method estimates the co-occurrence of predicted classes and observed noisy labels, then combines this estimate with the previous matrix through a moving average. The resulting matrix is used for forward loss correction. The authors characterize the running entropy minimum as a supermartingale and use this to argue that the transition matrix converges. Experiments cover five MedMNIST datasets with synthetic label corruption, with additional evaluations under instance-dependent noise and on CheXpert. The paper also compares quantum and classical backbones and studies temperature scaling, circuit size, and update schedules.
Critical strengths
-
The paper addresses a useful question: whether label-noise correction can improve small hybrid quantum classifiers. The proposed update is simple, using prediction-label counts and a moving average rather than introducing another trainable noise-estimation network.
-
The experimental evaluation includes several medical imaging modalities, multiple corruption settings, and five independent runs with reported standard deviations. The main loss-correction baselines use the same QNN backbone, which helps assess the effect of the correction method within this model family. The reported gains are generally consistent across the included datasets.
Critical weaknesses
-
Theorem 2 is not established by the proof in Appendix A. The proof argues that because the decreases in the running entropy minimum tend to zero, transition updates become infrequent and the transition matrices form a Cauchy sequence. Neither implication follows. For example, s(t) = 1/(t+1) reaches a new minimum at every step, although its successive decreases tend to zero. Moreover, Eq. (5) uses a fixed step size, and small changes in entropy do not bound changes in the transition targets obtained from hard predictions. A moving average of alternating target matrices can continue to oscillate. Lemma 1 is valid, but it establishes a property of the running minimum of any bounded sequence; it does not establish convergence of the classifier or the transition matrix. The central convergence claim therefore needs additional assumptions and a valid argument.
-
The binary noise experiments need clarification. Figure 1 defines uniform noise as flipping a label uniformly to another class. For Breast and Pneumonia, which have two classes, this gives the same corruption distribution as cyclic flipping and the custom mapping in Table 3. Yet Table 1 reports a large difference between these settings. On Pneumonia at 50% noise, SLT obtains 83.90 F1 under UN but 47.44 under CF/CM; the other methods also show substantial differences. Please provide the actual corruption matrices and the realized fraction of changed labels. In particular, does the UN implementation sample from all classes, including the original class? If so, the effective corruption rate differs from the definition in Figure 1 and from the nominally matched CF/CM settings.
-
It is unclear why the entropy trigger should improve the accuracy of the noise-transition estimate. Equation (4) estimates P(noisy label = k | predicted label = j), whereas forward correction ordinarily uses P(noisy label = k | clean label = j). These quantities differ when the classifier makes mistakes. Lower entropy alone does not resolve this: a model that confidently fits the corrupted training labels would produce an identity matrix through Eq. (4), even when the true corruption is nonzero. Likewise, a more diagonal estimated matrix in Figure 7 does not by itself demonstrate more accurate noise estimation. Since the synthetic corruption matrices are known, reporting transition-estimation error over training would directly test this part of the motivation.
Questions for authors
See above.