- Rating
- 4(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
To address the limitations of conventional tensor self-representation and factorization in capturing latent subspaces when observations are insufficient or noisy, this paper proposes Latent Tensor Low-Rank Representation (LT-LRR) and theoretically derives a low-rank correction formulation for latent information. Building on this framework, the authors develop ETRL-SMVC, which combines compact anchor-label tensor factorization with latent correction and Schatten-p regularization to enhance cross-view representation learning and reduce computational costs. Comparative experiments and ablation studies on four benchmark datasets validate the effectiveness of the proposed method
Critical strengths
- The work is well motivated, introducing latent representations to address insufficient sampling and extending the matrix formulation to the tensor setting.
- The method achieves competitive clustering results on benchmark datasets, with ablation studies demonstrating the effectiveness of its components.
Critical weaknesses
- The transition from anchor graph self-representation to tensor factorization is not sufficiently clear and requires further explanation.
- Scalability is primarily supported by theoretical complexity analysis, without runtime comparisons across varying sample sizes.
Questions for authors
- How are the hyperparameters selected for each dataset? Could the authors specify the search ranges and selection criteria?
- What advantages does the Schatten-p norm offer over the standard tensor nuclear norm (TNN)?
- How are anchors selected for different views? Is cross-view anchor correspondence required when stacking the anchor graphs into a tensor?
Response to W1:
Thank you for your valuable comment. The main motivation for replacing self-representation learning with dictionary learning is to improve scalability while preserving the low-rank representation principle of LT-LRR. Specifically, directly applying LT-LRR to the anchor-graph tensor S∈Rm×n×V still requires learning a self-representation coefficient tensor Z of size n×n×V, which incurs substantial computational costs for large-scale datasets.
To avoid explicitly learning Z, we approximate the self-representation term using a compact tensor factorization, S∗Z≈G∗H⊤, where G and H denote the anchor-label and sample-label tensors, respectively. This leads to the proposed formulation: S≈G∗H⊤+L∗S. Here, the tensor factorization term captures the underlying clustering structure, while the latent correction term preserves the model's ability to compensate for insufficient or noisy observations.
We will further clarify this transition in Section 3.2 of the revised manuscript and explicitly explain the mathematical relationship between the original LT-LRR formulation and the proposed compact tensor factorization model.
Response to W2:
Thank you for your valuable comment. To further evaluate the scalability of our method, we conducted additional experiments comparing runtime and peak memory consumption with several representative anchor graph-based clustering methods, including LMVSC, FPMVS-CAG, and AGFS-OMVC, FMCNOF. The experiments were conducted on two relatively large datasets, Reuters and NUS, containing 18,758 and 30,000 samples, respectively. The results are summarized below.
These results demonstrate the practical feasibility of our method on large-scale datasets and provide additional empirical evidence to complement the theoretical complexity analysis. We will incorporate these experimental results and clarify the scalability analysis in the revised manuscript.
Response to Q1: Thank you for your valuable comment. We conduct a grid search to select the hyperparameters for each dataset. Specifically, for small-scale datasets, the anchor rate is searched from 0.1 to 1.0, while for large-scale datasets, we consider smaller anchor rates, such as 0.001, 0.002, and so on. The parameter (p) is searched from 0.1 to 1.0 with a step size of 0.1. The regularization parameters (\lambda_1), (\lambda_2), and (\lambda_3) are selected from ({0.001, 0.01, 0.1, 1, 10, 100, 1000}). We will clarify these hyperparameter search ranges and the selection procedure in the revised manuscript to improve reproducibility.
Compared with the standard tensor nuclear norm (TNN), the tensor Schatten-p norm (0<p<1) provides a more flexible approximation to tensor rank.
TNN applies a uniform linear penalty to singular values, potentially suppressing important structures. In contrast, Schatten-p regularization penalizes larger singular values relatively less while promoting the suppression of smaller ones, thereby better preserving dominant low-rank structures.
In our framework, it regularizes both the representation tensors and the latent correction tensor to capture cross-view structural relationships and exploit shared and complementary information. TNN is a special case when p=1, highlighting the flexibility of the proposed regularization.
Response to Q3:
Thank you for your valuable comment. We adopt a variance-based decorrelation strategy for anchor selection. Specifically, we first concatenate the feature matrices from all views and calculate the feature variance of each sample. We then iteratively select the sample with the highest variance as an anchor and apply a decorrelation mechanism to reduce redundancy among the selected anchors.
Yes, cross-view anchor correspondence is required when stacking the anchor graphs into a tensor. Since the anchors are selected using the concatenated multi-view features, the same sample indices are used as anchors across all views, naturally ensuring their correspondence. Handling non-corresponding anchors across different views is an interesting and challenging problem, which we plan to investigate in our future work.