- Rating
- 4(+1)
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes a balanced multi-view collaborative label learning method based on anchor representations. Unlike conventional anchor-based clustering approaches, the proposed framework uses sample information to represent anchors and establishes a collaborative relationship between sample labels and anchor assignments. A Schatten-p norm maximization regularizer is introduced to encourage balanced cluster assignments, supported by theoretical analysis. Furthermore, a tensor low-rank regularizer is employed to exploit complementary information across multiple views. Extensive experiments on seven benchmark datasets demonstrate the effectiveness of the proposed method.
Critical strengths
- The paper introduces a different perspective on anchor-based clustering by using samples to represent anchors. The collaborative relationship between anchor assignments and sample labels provides a meaningful approach to multi-view label learning.
- The Schatten-p norm-based balancing strategy is supported by theoretical analysis, providing an interesting interpretation of spectral regularization for clustering. The proposed method achieves impressive performance on seven benchmark datasets, demonstrating its potential effectiveness.
Critical weaknesses
- Although the overall experimental results are strong, additional ablation experiments would help clarify the individual contributions of the anchor balancing regularization and tensor low-rank constraint.
- The relationship between the theoretical balancing formulation and the final multi-view objective could be explained more explicitly, particularly regarding the normalization of the anchor assignment matrix.
Questions for authors
- Could the authors further clarify how the balancing property established in Theorems 1 and 2 is maintained when the anchor assignment matrix is defined as Q^{(v)}=(G^{(v)})^\top H^{(v)} in the final objective?
- Could the authors provide an ablation study to distinguish the contributions of the Schatten-p norm balancing regularizer and the tensor low-rank constraint?
- Could the authors further explain why the proposed sample-to-anchor representation is more effective than conventional anchor-to-sample representations, beyond the empirical performance improvements?
2 comments
Thanks for your reply
I intend to increase my score
Clarifications on Anchor Matrix Normalization, Theoretical Inheritance, and Additional Ablations
We sincerely thank the reviewer for the careful review and valuable comments. We respond point-by-point as follows.
Critical Weakness 1 / Question 2: Supplementing ablation studies to distinguish the contributions of anchor balance regularization and tensor low-rank constraint
We thank the reviewer for the suggestion. We agree that supplementing ablation studies will help more clearly elucidate the respective contributions of these two parts. We will add the relevant ablation studies in the revised manuscript. We expect that these supplementary ablation experiments will clearly demonstrate that both the balance regularization term and the tensor low-rank constraint make substantial contributions to the final clustering performance, thereby verifying the effectiveness of these two designs.
Critical Weakness 2 / Question 1: The relationship between the balancing formulation and the final multi-view objective, and the normalization of the anchor assignment matrix
First, regarding the normalization of the anchor assignment matrix and the preservation of the theorem's conditions. In the final objective, the anchor assignment matrix is defined as Q^(v) = (G^(v))^T H^(v). In the model constraints, we have explicitly required the sample label matrix H^(v) >= 0 and H^(v)1 = 1. To ensure that Q^(v) also satisfies the row sum of 1, we applied a column normalization operation when constructing the anchor graph G^(v) (i.e., ensuring the weight sum of each anchor is 1, (G^(v))^T 1 = 1). Based on this, we can strictly derive: Q^(v)1 = (G^(v))^T H^(v)1 = (G^(v))^T 1 = 1. This proves that Q^(v) strictly satisfies the condition of row sum being 1, and the balancing properties established in Theorem 1 and Theorem 2 can be directly applied to the final multi-view objective function. We will add this crucial detail in the revised manuscript.
Second, regarding the relationship between the balancing formulation and the final multi-view objective. The first term of the final multi-view objective function utilizes the conclusion of Theorem 2 view-by-view at the single-view level. By maximizing the Schatten p-norm of the anchor assignment matrix, it avoids the degenerate distribution of anchor labels and encourages the anchor space to evenly cover the structure of each cluster. Subsequently, the second term in the multi-view objective function, namely the tensor low-rank constraint, acts on the sample label tensor. It coordinates the H^(v) of different views, ensuring that each view learns cross-view consistent sample labels while pursuing its own anchor-side balance. Ultimately, consensus labels are obtained through average fusion. Therefore, the balancing formulation functions in the single-view anchor space, while the tensor low-rank constraint functions in the cross-view sample space. These two complement each other in the final objective function, jointly guaranteeing the balance and consistency of the multi-view clustering results.
Question 3: Why is the sample-to-anchor representation more effective than the traditional anchor-to-sample representation?
Traditional anchor-to-sample methods treat the anchor graph as a compact representation of samples and learn sample labels via GQ ≈ H. Essentially, they compress n samples into m anchors, where m << n. This creates an information bottleneck, making it easy to lose fine-grained structural information of the sample space, and the relationship between anchor assignments and sample labels is not explicitly modeled. In contrast, this paper adopts sample-to-anchor, which means using samples to represent anchors. Anchor labels are aggregated from sample labels via Q = G^T H. In this way, each anchor is represented by a weighted combination of multiple samples, which can leverage abundant sample information to enhance the representational capability of the anchors and alleviate the under-representation problem. Meanwhile, anchor labels and sample labels calibrate each other during optimization. The anchor graph is no longer just a compressed representation of samples, but a bridge connecting the sample space and the anchor space. Combined with the anchor-side balance regularization, the anchor space can evenly cover the structure of each cluster and avoid being dominated by the majority class. Therefore, it is more effective when the classes are imbalanced or the differences between views are significant.
We once again thank the reviewer for their constructive comments.