- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes learnable extensions of the log-Euclidean and log-Cholesky metrics for SPD matrices. It replaces the fixed logarithmic map with an increasing spline transformation in log coordinates. Two variants termed Spectral-SPM and Cholesky-SPM are presented, where the transformation acts on eigenvalues and on positive Cholesky diagonal entries, respectively. The splines’ coefficients are learned jointly with the classification model. The paper presents theoretical results on invertibility, approximation capacity, and the induced pullback geometry. Experiments compare several metrics across five datasets and report runtime and memory use. Spectral-SPM demonstrates improved classification compared to several baselines, while Cholesky-SPM achieves only mixed results and generally lower computational cost.
Critical strengths
-
The idea of extending log-Euclidean and log-Cholesky metrics with learnable nonlinear transformations is new and useful.
-
The presented monotone spline constraints preserve invertibility while allowing the flexibility to expand or compress different input ranges.
-
The paper addresses approximation of both the scalar function and its first derivative. This is relevant to learning the metric and computing gradients.
-
The construction supports both spectral and Cholesky representations within one framework.
-
Experiments compare both commonly used Riemannian metrics and learnable metrics, where the proposed Spectral-SPM shows consistently superior results.
-
The paper reports runtime, memory use, and sensitivity to spline settings.
Critical weaknesses
-
Several empirical gains over the leading baseline are small. In addition, the Cholesky-SPM sometimes performs worse than log-Cholesky.
-
A simple learned affine map in log coordinates is missing as a baseline. This would help establish whether flexible nonlinear splines are necessary.
-
Theorem 1 allows degree-1 splines , which need not be
Questions for authors
-
Do the empirical gains remain consistent across training seeds and compared with a learned affine map in log coordinates?
-
If I understand correctly, the second derivative can jump where the spline meets the linear tails. How do the claims about global curvature and parallel transport hold at these joins?
-
The derivative grows without bound near zero. How does the gradient stability guarantee hold in this case?
-
The links to the proofs in the theoretical results statements are unconventional. It would be clearer to refer to Appendix B for the proofs in the main text.
3 comments
Response to Reviewer i6Xe -2
Q3: The derivative grows without bound near zero. How does the gradient-stability guarantee hold?
We thank the reviewer for identifying this distinction. Although theoretically the derivative can grow near 0. Since our dataset uses SPD matrices, exact 0 eigenvalues do not appear.
Furthermore, we avert arbitrarily large gradients as x approaches 0 by our numerical safeguards.
Our implementation addresses the numerical issues associated with small and repeated eigenvalues through a two-tier positive diagonal perturbation strategy, described in Appendix H.2. These small perturbations not only prevent multiple eigenvalues from being exactly the same, but also bound how small an eigenvalue can become.
Thus, the eigenvalues used by the numerical spectral transformation are prevented from approaching zero arbitrarily closely. Weyl's eigenvalue perturbation inequality additionally guarantees that the displacement of each eigenvalue is bounded by the operator norm of the input perturbation, . The non-similar eigenvalues ensure a non-singular denominator in the Dalecki-Krein off-diagonal elements, preventing gradient instabilities.
Q4: The proof references should point clearly to Appendix B
We will standardize the theorem and proposition proof references in the main text to direct readers to the corresponding subsections of Appendix B.
We thank the reviewer for motivating these clarifications. Kindly let us know if you have any remaining concerns/ suggestions, and we respectfully ask that you consider these clarifications in your final assessment and rating.
I thank the authors for the detailed responses. They address some of my concerns. However, considering the comments raised by the other reviewers, I still consider this paper to be borderline. It has merit and nice ideas, but also many aspects need more work.
Response to Reviewer i6Xe -1
We thank the reviewer for the positive assessment of the diffeomorphic construction, the approximation result, and the empirical comparisons. We appreciate the additional questions concerning affine baselines, regularity, and numerical stability.
W1: Empirical Gains
We agree that the improvement magnitude varies across datasets and architectures, and that C-SPM is not uniformly better than LCM. The two variants use different representations and inductive biases: S-SPM acts on the eigenvalue spectrum, whereas C-SPM acts on the positive diagonal entries of the Cholesky factor while retaining the lower-triangular components. Their relative performance therefore depends on the structure of the dataset. We will clarify that S-SPM provides the stronger empirical results in several settings, while C-SPM offers a computationally efficient alternative rather than claiming uniform superiority of both variants. Moreover, our proposed metric outperforms the baselines with statistical significance in the large scale AI-NLP and AFEW dataset results presented in the Appendix.
W2: A learned affine transformation in log coordinates
We agree that a learned affine map in log coordinates is a useful low-capacity reference. However, the relevant comparison must preserve the geometric requirements of the proposed metric. Related learnable metric formulations such as ALEM already explore restricted parameterized deformations. The central contribution of SPM is the ability to learn a more flexible nonlinear diffeomorphism while retaining the global bijectivity and differentiability required by the pullback construction. This mitigates the need for manual task-dependent metric selection, allowing the model to learn the required pullback Euclidean mapping.
The current submission includes a low-resolution spline ablation and a PLM comparison in the appendix. The piecewise linear map faces loss spikes at its C0 kinks and diverges while SPM converges. However, adding your suggested affine baseline would strengthen the paper. We will add the learned affine comparison in the camera-ready version to quantify the benefit of nonlinear spline deformation over a low-capacity diffeomorphic transformation.
W3 Spline Degree We thank the reviewer for catching this typographic oversight. We shall correct the degree to k>=2 for C1. This doesn't affect our experiments, as we used k=3.
Q1: Do gains remain consistent across seeds and compared with a learned affine map?
The five-fold results on HDM05 and Radar provide evidence across different data partitions, and Appendix G shows consistent learned spline shapes across the five Radar folds. Moreover, Table 6 shows relatively stable SPM performance against spline order and grid size changes. However, we agree that FPHA uses a predefined train/test split and does not currently report a multi-seed standard deviation. We aim to add multi-seed evaluation and the learned affine baseline in the camera-ready version.
Q2 Second Derivative
We thank the reviewer for identifying the distinction between the regularity of the active spline region and that of the finite linear extrapolation tails. This distinction is explicitly addressed in Appendix B.1 of our submission.
In our proof of Theorem 1, we state, "Theoretically, by extending the grid boundaries t0 → −∞ and tm → ∞, the linear tails vanish, and C2 smoothness holds globally on R>0. Higher-order differentiability can easily be obtained by increasing k."
For the cubic B-spline used in our experiments, the mapping is C2 throughout the active knot interval. The linear extrapolation tails are introduced solely as a computational fallback for extreme spectral outliers, matching the spline in value and first derivative and thus preserving global C1 regularity. On any prescribed compact spectral domain, the knot boundaries can be chosen sufficiently wide that the entire domain lies within the C2 spline region.
Furthermore, none of the evaluated inputs in all of our reported experiments required linear-tail extrapolation: the spectral values remained within the prescribed spline domain. Consequently, the finite transition joins were not encountered during the reported experiments, and the evaluated transformations operated entirely within the C2 region, precluding concerns regarding curvature calculation and parallel transport.
We will make this distinction clearer in the manuscript.