- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Bidirectional Single-Class Learning for Partial Multi-Label Learning (BSCPML), a new method for partial multi-label learning (PML). BSCPML first leverages the reliability of negative labels in PML to encourage the classifier to focus more on negative-label information. It further incorporates label correlations, the low-rank structure of the label space, and the sparsity of noisy labels into a unified optimization objective. Experiment results demonstrate that BSCPML achieves the best performance on multiple benchmarks.
Critical strengths
-
The paper provides extensive theoretical analysis to support the proposed method BSCPML.
-
The proposed method is evaluated on 12 benchmark datasets and compared against 10 baseline methods.
Critical weaknesses
-
The overall presentation of the proposed method needs improvement. Please refer to the Questions For Authors section.
-
Additional experimental results (ablation studies) are needed to validate the effectiveness of each component.
Questions for authors
-
The paper provides a relatively detailed explanation of Eq. (9). However, the motivation for replacing in Eq. (8) with in Eq. (9) remains unclear. What is the motivation for changing from the prediction space to the parameter space, and what is the intended benefit of this modification?
-
The explanations of Eqs. (10) and (11) require further clarification. In Eq. (10), the authors introduce to represent the recovered ground-truth label matrix. Why is not used instead of in the first term of Eq. (10)? In Eq. (11), the authors replace with . Furthermore, what motivates the replacement of the norm with the norm in Eq. (11)?
-
In Section 5.1, the authors said that standard deviations are reported. However, the corresponding standard deviations are not presented in the tables.
-
Figure 2 presents the ablation study results, but the results of Eq. (10) are missing, making it difficult to assess the performance difference between Eqs. (10) and (11). Moreover, in my opinion, the current box plots do not clearly illustrate the performance differences. The authors are encouraged to report the results as means and standard deviations to facilitate a clearer comparison of the contributions of individual components.
Fully Addressed
Response 1: Laplacian Regularization in Prediction and Parameter Spaces
The basic principle of Laplacian regularization is to exploit label correlations by encouraging highly related labels to have similar representations. This constraint can be imposed either in the prediction space (XW) or in the parameter space (W). Although not mathematically equivalent, both approaches incorporate label correlations into model learning.
We choose parameter-space regularization mainly for computational efficiency. Regularizing W directly avoids the additional feature-matrix operations required by XW. Specifically, their gradients involve WL and XᵀXWL, respectively. Thus, given similar modeling objectives and comparable performance, parameter-space regularization reduces matrix operations and computational overhead during iterative optimization. This is a common trade-off between modeling and computational efficiency in graph regularization, which is why we did not elaborate on it in the original manuscript.
Response 2: Clarification of Eqs. (10) and (11)
(1) Why does the first term of Eq. (10) use Y rather than Z?
The first term preserves supervision from the original observed labels Y, while the third term introduces additional supervision from the purified labels Z. These terms serve different purposes and are not interchangeable.
In machine learning, an objective function often combines multiple loss and regularization terms to balance different learning goals. Our formulation follows this principle: some terms fit the observed labels Y, while others fit the purified labels Z. These complementary supervision sources constrain each other, reducing dependence on any single source and mitigating overfitting.
(2) Why replace Y = Z + N with Y = YZ + N?
PML label matrices typically contain many instances but relatively few labels, and may not satisfy a meaningful low-rank assumption. Direct low-rank decomposition of the entire label matrix therefore has limited value. In contrast, the dependency structure among labels may be low-rank. We consequently adopt Y = YZ + N, shifting the low-rank constraint from the label matrix to the label self-representation matrix Z to capture label correlations more directly. This motivation is already explained in Section 3.2.
(3) Why replace the L1 norm with the Frobenius norm?
Eq. (11) incorporates three complementary objectives: full-label fitting, reliable negative-label fitting, and purified positive-label fitting. Their mutual constraints reduce the risk of overfitting to any single supervision source, making a strong L1 sparsity constraint less necessary. Moreover, the L1 norm introduces nonsmooth optimization and additional computational complexity. We therefore replace it with the squared Frobenius norm, preserving the label reconstruction constraint while simplifying optimization and improving computational efficiency.
We will further clarify these design motivations in the manuscript.
Response 3: Missing Standard Deviations
Due to space limitations, we retained only the mean values in the main text but inadvertently omitted the corresponding standard deviations from the appendix. These results have now been added in Appendix D.3 (Tables 16–23) of the revised manuscript.
Response 4: Evaluation of Eq. (10) and Ablation Results
We have added a complete experimental comparison for Eq. (10) in Appendix D.3 (Tables 12–15). The results show that Eqs. (10) and (11) achieve comparable performance, consistent with our expectations. Eq. (11) retains the core idea of using purified labels as additional supervision while adopting a simpler reconstruction formulation and a smoother regularization term to reduce optimization complexity. We plan to move these results from the appendix to the main text in the final version to facilitate direct comparison.
Furthermore, following another reviewer's suggestion, we have added a more strictly controlled ablation study involving Laplacian regularization in Appendix D.1 (Fig. 10) to better isolate the contributions of individual components.
We retain the box plots because they clearly illustrate the performance distribution, medians, and variability across the 12 datasets.
Overall, these suggestions help clarify our methodological design and strengthen the presentation and rigor of the paper.