- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The paper introduces a Nested Inductive Bias framework that equips SPD manifolds with hyperbolic or spherical geometry by pulling back a target metric via a composition of logarithmic and exponential maps. It argues that manifold learning should account not only for SPD constraints but also for the latent relational structure of the data, and introduces a bounded Rational Conformal Metric (RCM) for outlier-robust representations.
Critical strengths
The nested metrics are constructed using a composition of diffeomorphisms and pullback metrics, relying on concepts from differential geometry rather than heuristics.
The paper explicitly distinguishes between enforcing manifold constraints and encoding relational structure, providing an interesting way to look at geometric inductive biases in SPD learning.
Critical weaknesses
The main construction is pullback metric obtained through a composition of established maps, and much of the theory follows from standard results on diffeomorphisms and pullbacks.
Limited comparison to existing metric-learning approaches on SPD manifolds. The paper does not convincingly establish that adaptive or learned SPD metrics cannot achieve similar effects without the nested construction.
The choice for the conformal factor in the Rational Conformal Metric could be better justified and compared to alternatives.
Questions for authors
The Rational Conformal Metric is an original part of the submission. Why is the specific conformal factor (1+\alpha|x|)^{-2} preferred over other possible factors? Is there a theoretical property that motivates this choice?
6 comments
Authors' Response to Reviewer yqRc - 2
W2. Adaptive and Learned SPD Metrics
We agree that learned SPD metrics are important empirical alternatives. The reviewer correctly identifies that adaptive metric-learning approaches exist for SPD manifolds (even as recently as 2026). However, we situate our novelty within the current literature by noting that these adaptive base metrics generally pull back the flat Euclidean metric.
The primary motivation for these pullback Euclidean metrics becoming so popular in recent SPD literature is to overcome the computational burden of the classical non-positively curved AIRM metric, but this comes at the cost of sacrificing curvature. Learnable metrics (such as ALEM[1], SSPM, and CSPM[2]) optimize the weights of the mapping from the SPD manifold to flat Euclidean space to improve class separation. They do not imbue the manifold with non-zero curvature.
Instead of forsaking these Euclidean advances, we designed our framework in a modular fashion that can easily integrate these pullback Euclidean metrics. Since the first diffeomorphism in our nested framework is the Log-Euclidean transformation, we can replace it with a learnable metric's Log transformation while still extending them to non-Euclidean geometries. Notably, these metrics should themselves be valid Riemannian metrics to substitute LEM.
To test this, we evaluated LEM, SSPM, ALEM, and CSPM as standalone Euclidean RMLR classifiers on FPHA (Linear Probe), and then integrated their representations into the three nested target configurations.
| Base Metric | Standalone (Flat Euclidean RMLR) | Nested in NSM (Unconstrained) | Nested in NSM-RCM (Proposed) | Nested in NHM (Hyperbolic) |
|---|---|---|---|---|
| LEM | 83.13% | 10.78% | 83.30% | 85.57% |
| SSPM | 85.22% | 20.87% | 85.22% | 87.30% |
| ALEM | 84.00% | 7.83% | 87.13% | 89.22% |
| CSPM | 58.96% | 6.78% | 47.65% | 62.43% |
These observations follow.
-
While adaptive metrics remain competitive (such as standalone SSPM at 85.22%) and improve upon the standard LEM, they fall short of the performance achieved by simply placing the LEM into our Hyperbolic framework. This provides evidence that even a learnable flat metric may not fully substitute for aligning the metric's curvature with the dataset's intrinsic curvature.
-
When we apply our nested framework on top of the adaptive metrics, especially the FPHA's curvature-aligned NHM, performance increases (ALEM-NHM achieves the highest 89.22%). Pairwise McNemar's tests with the Holm-Bonferroni correction confirm this complementary performance gain is statistically significant(). Both Nested ALEM_NSM_RCM and Nested ALEM_NHM significantly outperform standalone ALEM. Moreover, both Nested ALEM_NSM_RCM and Nested ALEM_NHM significantly outperform their standard LEM-based counterparts. This demonstrates the complementary nature of these frameworks.
-
The importance of RCM is also apparent. For the unconstrained NSM, even when equipped with learnable base metrics such as ALEM or SSPM, it fails due to a norm-and-curvature mismatch. The RCM intervention successfully "saves" its performance significantly, demonstrating its necessity regardless of the base metric used.
While the results show empirical complementarity, they do not guarantee improvement for every base metric replacement over LEM, contingent on the metric's inherent stability and valid diffeomorphism properties.
We hope these additions properly address your concerns, and we respectfully ask you to consider updating your assessment of our submission in light of this new evidence.
References: [1] Chen, Z., Song, Y., Xu, T., Huang, Z., Wu, X. J., & Sebe, N. (2024). Adaptive Log-Euclidean metrics for SPD matrix learning. IEEE Transactions on Image Processing, 33, 5194-5205.
[2] Das, T., Dutta, S., Neogy, S., & Singh, K. K. (2026). Beyond Rigid Geometries: The Spline-Pullback Metric for Universal Diffeomorphic SPD Representation Learning. arXiv preprint arXiv:2605.04406.
[3] Skopek, O., Ganea, O.-E., & Bécigneul, G. (2020). Mixed-curvature variational autoencoders. In International Conference on Learning Representations. https://openreview.net/forum?id=S1g6xeSKDS
Dear Reviewer yqRc,
As the discussion period comes to an end, we wish to thank you for your thoughtful review. We hope that our provided clarifications and new experimental results have addressed all your raised concerns. Please let us know if any final clarifications would be helpful before the window closes.
Authors' Response to Reviewer yqRc - 1
We thank the reviewer for recognizing the geometric coherence of the nested construction and the originality of RCM. We appreciate the questions concerning novelty, adaptive SPD metrics, and the motivation for the conformal factor.
W1. Novelty Within Geometric Deep Learning
We agree that diffeomorphic composition and metric pullback are established differential-geometric principles. We do not claim novelty for these abstract operations. We situate our novelty within the subfield of Geometric Deep Learning and SPD manifold learning.
Our contribution for ICLR is to present a mathematically rigorous, computationally tractable SPD learning framework, without relying on heuristics.
The novel methodological contributions are:
(i) Curved SPD pullback metrics. To the best of our knowledge, we are the first to equip the SPD manifold with hyperbolic and spherical metrics via the nested inductive bias framework, imparting non-flat curvature and averting the high computational penalty of the classical AIRM metric.
(ii) Solves a> 5-year-old problem: It identifies the main cause (injectivity violation) and provides a principled solution (via RCM) to the problem of the instability of optimization on the projected hypersphere (mentioned by Skopek et al. [3] in 2020) using nested differential geometry, instead of relying on heuristics. We also provide beneficial properties of RCM in the rebuttal.
(iii) Intrinsic classification. Besides the Nested Bias framework, we also provide the derivation and implementation of the associated Riemannian classification procedure (Nested RMLR) specifically for the induced geometries.
(iv) Metric Alignment: We provide evidence for the alignment between the dataset's empirical ORC and the selected metric beyond merely satisfying the domain constraints. This concept is generalizable to non-SPD datasets as well.
W3 & Q1: Justification for the RCM Conformal Factor
The specific conformal factor used in the Rational Conformal Metric was deliberately derived to solve a fundamental tension in bounded representation learning: a valid bounding metric must simultaneously guarantee C∞ smoothness everywhere (including the origin) and preserve suitable training while bounding the codomain. We present both theoretical arguments and empirical results on the FPHA dataset, contrasting RCM against competitor bounded transformations.
For a radial bounding mapping f(r) applied to a vector x with norm r=∥x∥2, the vector mapping is F(x)=xrf(r). We compared our RCM formulation against alternative mathematical bounds:
Note: RCM parameter conditions α>0, ε>0, and αε<1.
Theoretical Motivation for the Specific Factor:
To empirically validate this specific conformal factor, we ablated RCM against these popular alternatives on the FPHA dataset (Linear Probe, multiple seeds):
While the remaining mappings suffer from rapid gradient vanishing (even the Rational Sqrt mapping's cubic (O(r−3)) decay proves too aggressive here), the specific rational formulation in RCM provides both differentiability and proper training.