- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes a differentiable low-rank matrix factorization framework for multi-view subspace clustering. The method aims to reduce the high computational cost caused by repeated SVD operations in conventional low-rank optimization. It factorizes each self-representation matrix into multiple low-rank factors and incorporates cross-view consistency and symmetry constraints to capture shared and complementary structures across views. The factor-wise iterative updates are further transformed into differentiable learning steps, enabling the model parameters to be optimized through backpropagation while avoiding repeated SVD-based updates. The paper also provides a convergence analysis for the resulting block-wise optimization scheme. Experiments on multiple benchmark datasets show that the proposed method achieves competitive clustering performance with substantially reduced computational cost.
Critical strengths
The paper presents a novel and practically meaningful attempt to address the heavy computational cost caused by repeated SVD operations in conventional low-rank multiview subspace clustering methods. In particular, replacing the SVD-based factor update with a differentiable and learnable low-rank mapping is an interesting idea that connects model-based low-rank optimization with trainable architectures.
Another strength is that the proposed framework preserves explicit low-rank and multiview structural priors while improving computational efficiency. The experimental results on multiple benchmark datasets show competitive clustering performance together with substantial reductions in runtime, demonstrating the practical potential of the proposed approach.
Critical weaknesses
The main weakness lies in the theoretical justification of the proposed differentiable low-rank update. The original Schatten- proximal subproblem is replaced by an equality-constrained formulation, but the relationship between the two is not rigorously established. Moreover, the Lagrange multiplier is further replaced by a freely trainable weight matrix, which weakens the connection to the original KKT conditions and makes it unclear whether the learned update still approximates the intended proximal operator.
Another concern is the computational claim. Although the method is motivated by avoiding repeated SVDs, the proposed update still involves fractional matrix powers and pseudoinverses, which may themselves require eigendecomposition or SVD in practice. Without a clearer implementation-level complexity analysis, it is difficult to assess whether the proposed operator truly provides the claimed computational advantage.
Questions for authors
- The original Schatten- proximal update in Eq.(7) is replaced by the equality-constrained formulation in Eq.(8). Could the authors clarify the theoretical relationship between these two problems? In particular, is Eq.(8) an equivalent reformulation, an approximation, or only a surrogate used to derive the differentiable operator?
- The Lagrange multiplier derived from the constrained problem is directly replaced by a trainable matrix . Since is originally constrained by the corresponding optimality conditions, could the authors clarify what theoretical connection remains between the learned and the original Lagrange multiplier, and whether the resulting update still approximates the original Schatten- proximal operator?
- The proposed method claims to avoid repeated SVD computations. However, Eq.(13) still involves the fractional matrix power and a pseudoinverse. Could the authors clarify how these operations are implemented in practice and whether they require eigendecomposition or SVD? A clearer complexity comparison with the original SVD-based proximal update would be helpful.