- Rating
- 2(+1)
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper studies regularized regression with Hadamard manifold-valued responses. Regression curves are represented by exponentiating bounded tangent vector fields at a fixed reference point, and estimation combines an intrinsic loss with coefficient or group penalties. Under realizability, geometric regularity, small-ball, and complexity assumptions, the paper establishes finite-sample oracle inequalities and translates tangent-space error into geodesic prediction error. Experiments investigate sparsity–prediction trade-offs on hyperbolic and SPD manifolds, together with an exploratory EEG covariance-interpolation application.
Critical strengths
- The analysis carefully distinguishes convexity of the tangent-space model from geodesic closure of its exponential image. The use of an ambient population oracle and a geodesic contraction hull addresses a substantive geometric issue.
- The paper provides a detailed treatment of geometric distortion, localized complexity, and decomposable penalties.
- The experiments include relevant tangent-space and intrinsic baselines, and the manuscript transparently reports limitations and unfavorable comparisons.
Critical weaknesses
My main reservation concerns the originality and significance of the contribution. Representing manifold-valued regression functions through tangent vector fields appears closely related to kernel-regression approaches based on tangent-field estimation and exponential-map reconstruction. The paper should explain more precisely what is gained beyond this existing modeling strategy and the application of established regularized-learning tools. The present contribution is concentrated on finite-sample error guarantees; it remains unclear whether it yields a qualitatively new statistical insight or a practically consequential advantage over kernel-based alternatives.
Three additional concerns limit the force of these guarantees.
First, the sparsity-dependent term does not improve the full localization term. Corollary 4 gives a bound of the form {}, while r* is controlled by the full model. As acknowledged in Remark F.1, the resulting bound is not an overall sparsity-adaptive rate. This weakens the theoretical explanation for the principal motivation of sparse regularization.
Second, the explicit dictionary rate requires geodesic closure, whereas the main Fourier implementation need not satisfy that condition. The general theorem may still apply through its contraction hull, but the explicit rate does not automatically transfer. The dependence on small-ball and curvature constants also makes the quantitative usefulness of the bound difficult to assess.
Third, the guarantees concern global minimizers, while the numerical procedure uses a stopping residual without a quantified global optimization gap. The empirical evidence does not clearly compensate for this disconnect: tangent LASSO has lower mean error in all 22 simulation settings, and the EEG fits are frequently essentially constant.
Questions for authors
-
Could the authors provide a precise comparison with kernel-regression methods for manifold-valued responses that estimate tangent vector fields and reconstruct predictions through the exponential map? Which methodological or theoretical contribution cannot be obtained by combining those formulations with existing regularized-learning arguments? In particular, since Corollary 4 retains the full-model localization radius, what substantive sparse-learning advantage is established beyond a sparsity-dependent regularization term?
-
Given the Fourier non-closure example in Remark F.2, can the authors control the actual geodesic contraction hull used by their main implementation? How do the small-ball and curvature factors behave in that example?
-
Can the authors quantify the optimization error of the reported fits and explain how it enters the statistical guarantee? In light of the stronger tangent-LASSO results and nearly constant EEG predictions, what evidence establishes an additional benefit of intrinsic regularized regression over appropriately tuned kernel/tangent-space methods and constant predictors?
5 comments
Thank you again for your careful review and constructive feedback. We hope that our responses and revisions have addressed your concerns and questions. If you find that they resolve your main concerns, we would be grateful if you would reconsider your assessment and score in light of these changes. We would be happy to clarify any outstanding points before the discussion period ends on 18 November.
Thanks for the response. The authors made substantial improvements to the technical analysis. I will take those into consideration and raise my rates. Meanwhile, I still have some questions.
- Can you provide an illustrative example where their sparse bound is quantitatively informative at realistic sample sizes and regularization strengths, or a sharper result that covers the fitted estimators?
2.Can you identify a setting where intrinsic geodesic RERM materially outperforms tangent-space LASSO under matched representation, tuning and computational budgets? Your current experiments generally favor tangent LASSO.
Response to Reviewer xqyw
We thank the reviewer for his careful reading. Below, we address each concern and question point-by-point.
1. Originality and sparse learning (Q1)
We add a sparse intrinsic-risk guarantee for fixed tangent dictionaries on Hadamard manifolds. Theorem 5 (Section 3.6; full version: Theorem L.3) separates approximation risk, coefficient tails and global optimization error for a fixed feasible reference predictor and coordinate set. It allows misspecification without geodesic closure of the fitted dictionary image. It assumes a fixed base point and bounded population-orthonormal dictionary, i.i.d. data and the stated loss and tuning conditions.
For exactly sparse realizable targets, Corollary L.4 gives a leading term proportional to sλ2, without a maximum involving the full-model localization radius. The original Corollary 4 retains that maximum; the improvement uses a new coefficient-ℓ1 argument.
Appendix A compares Banerjee et al. (2015), who use kernel-weighted Fréchet means and exponential-map approximation, Schötz (2022), who jointly fits a base point and tangent series, and Matteo et al. (2026), who establish spherical intrinsic RKHS guarantees under cap restrictions. The proof combines established learning tools with the ambient margin, distance comparison and loss-increment control, allowing a nonconvex coefficient objective. Joint estimation of the base point remains outside our guarantee.
2. Fourier nonclosure and quantitative scope (Q2)
Under realizability, Proposition M.1 controls all geodesic contractions toward the ambient oracle, with one scalar θ shared across time, including curves outside the Fourier image. Distance and the first-order multiplier scale exactly by θ. A coefficient-shell argument gives
\le\max\big(r_0,2L\kappa_B\sqrt KC_q/(\zeta\sqrt n)\big),$$ where $$r_0=\frac{L}{\sqrt2\zeta\sqrt n},\quad J_0=1+\max\{0,\lceil\log_2(2B/r_0)\rceil\},\quad C_q=2\sqrt2+M\sqrt{2\log(J_0/q)}.$$ Here $\zeta>0$ and $q\in(0,1)$ is the failure-probability parameter. The dictionary, sampling and gradient assumptions remain; geodesic closure is unnecessary. Corollary M.2 separately controls design conditioning. For independent uniform times and a shared complete normalized Fourier basis, $$\Pr(\lambda_{\min}(\widehat G)<1/2) \le q_Fe^{-n/(8q_F)},\qquad K=dq_F.$$ Here $q_F$ is the scalar basis size per tangent coordinate. On the complementary event, every dictionary field's empirical squared norm is at least half its population value. The hull bound still depends on total $K$ and geometric distortion $\kappa_B$. For the original corollary retaining closure, the generic small-ball certificate can yield sufficient $K^5$ sample-size and $K^3/n$ squared tangent-radius terms, with other constants fixed (Appendix O.1). Its curvature factors are $\kappa_B^6$ for tangent error and $\kappa_B^8$ after geodesic conversion. A complete informative risk guarantee at the reported sample sizes remains unestablished. **3. Optimization error and empirical benefit (Q3)** Let $F_g$ be the half-squared intrinsic empirical objective and $F_t$ its convex tangent counterpart, with the same weighted $\ell_1$ penalty. Logarithm nonexpansion gives $F_t\le F_g$; boundedness and orthonormality give $C\subseteq\{\|\beta\|_2\le B\}$. For $z=(\log_pY_i)_i$, $D\beta=(v_\beta(T_i))_i$ and every dual vector $U$, Appendix N gives $$\mathcal D_B(U) = -\frac{n}{2}\||U\||_2^2-\langle U,z\rangle -B\||\operatorname{ST}_{\lambda w}(-D^\top U)\||_2,$$ where $\operatorname{ST}$ is coordinatewise soft thresholding and $w\ge0$ matches the fitted penalty. This lower-bounds the tangent objective on the coefficient ball. In exact arithmetic, every feasible fit therefore satisfies $$0\le F_g(\widehat\beta)-\inf_{\beta\in C}F_g(\beta) \le F_g(\widehat\beta)-\mathcal D_B(U).$$ No exact dual solution is required. Under the respective assumptions, a valid gap bound $\epsilon_{\rm opt}$ contributes $\epsilon_{\rm opt}/\varkappa$ to the original squared tangent bound and $4\epsilon_{opt}/\mu$ to Corollary L.4's squared-distance bound. Appendix O reports mean RERM upper bounds from $1.59\times10^{-4}$ to $2.29\times10^{-2}$, with continuous feasibility checked. They include relaxation error and need not vanish at an intrinsic optimum. Float64 evaluations have no interval validation. No EEG optimization-gap bound was computed. The sparse tuning threshold is at least 96 times each simulation grid's maximum, so the theorem does not certify the cross-validated fits. Mean squared prediction errors favor intrinsic RERM over ERM in all 22 settings, and tangent LASSO over RERM in all 22. In 306 of 308 EEG recordings, Fourier fits have no active nonconstant coefficients. These comparisons do not establish an intrinsic-loss advantage.