- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes GraSS, which uses a graph to learn the importance and mutual compatibility of constituent subspaces. It constructs Grassmann representations by combining subspaces within each connected component and applying gating-based selection. The authors present a theory based on spectral measures and quadratic utility and evaluate the proposed method on action recognition using HDM05, FPHA, and NTU60 with 10 random seeds. In addition to comparisons with existing methods based on Riemannian geometry and component ablations, they analyze the relationship between the complexity of individual samples and the required dimensionality on Salinas.
Critical strengths
- Table 1 shows that, under the reported NTU60 setting, GraSS improves accuracy from GMSF-Net’s 58.52% to 61.04%, while reducing the standard deviation from 0.99 to 0.29. These results show empirical improvements in both performance and stability across runs.
- Table 2 shows step-by-step improvements on FPHA: 81.99% with fixed partitioning, 88.08% with the graph, and 90.44% with the full model. These results suggest that learning a relational structure and introducing a selection mechanism provide benefits beyond simply partitioning subspaces.
Critical weaknesses
- If Eq. (21) takes a weighted sum of the basis vectors of one-dimensional subspaces as written, wouldn’t the rank remain at most 1 even after QR decomposition? In that case, the dimension of the composite subspace would not increase. Also, flipping the sign of a basis vector may change the composite subspace. This may indicate an inconsistency with the central claims of adaptive dimensionality selection and basis invariance.
- The measure in Proposition 1 depends on the singular values of the original matrix and is not uniquely determined by the Grassmann point alone. The paper also does not show why graph partitioning or gating-based selection satisfies the assumptions of Theorem 3. The connection between the theory of an “intrinsic distribution” and the proposed algorithm is not sufficiently established.
Questions for authors
- Does Eq. (21) take a weighted sum of the basis vectors? Please provide the tensor shapes and explain how the dimension of the composite subspace can vary and how invariance to sign flips of singular vectors is ensured.
- Beyond the initialization in Eq. (19), what input information is used to learn compatibility? Please also clarify how the presence or absence of edges is determined and describe the training procedure, including connected-component extraction.
- Does Proposition 1 describe a distribution associated with the original matrix, or a distribution intrinsic to the Grassmann point? Please also explain whether there is a guarantee that the actual selection results satisfy the assumptions of Theorem 3.