acceptodds
Withdrawn from ICLR 2027

Constant-Curvature Sliced Gromov–Wasserstein for Heterogeneous Cross-Curvature Alignment

Withdrawn from ICLR 2027, so left out of the paper lists and the map.

Abstract

Recent advances in representation learning have highlighted the utility of constant-curvature models, such as hyperbolic and spherical spaces, for modeling complex data. Mixed-curvature models further enhance this by integrating multiple constant-curvature components. However, these models typically learn each component space independently because spaces with different curvatures are inherently heterogeneous and lack a unified metric. Consequently, they lack explicit mechanisms to enforce geometric consistency across various spaces. Moreover, the problem of comparing probability distributions across mixed-curvature spaces remains unexplored. To compare distributions on heterogeneous spaces, Gromov–Wasserstein (GW) distances provide a principled framework by aligning their intra-space geometries. Building on this, we propose constant-curvature sliced Gromov–Wasserstein (CCSGW), a novel divergence for aligning distributions supported on heterogeneous constant-curvature spaces. We first introduce the missing geodesic-based one-dimensional projections for spherical spaces, and then extend sliced GW to constant-curvature spaces, enabling efficient and principled comparison across manifolds with different curvatures. This formulation preserves intrinsic geometric relationships while avoiding the high computational cost. We provide theoretical analysis showing that CCSGW controls intrinsic geometric discrepancy across heterogeneous spaces, promoting distribution-level geometric consistency. By integrating CCSGW into existing mixed-curvature learning tasks, including graph anomaly detection, graph node classification, and multimodal learning, we observe consistent performance gains across diverse settings.

Primary area:
learning on graphs and other geometries & topologies
Keywords:
mixed-curvature space, sliced optimal transport, geometric deep learning, heterogeneous alignment

Reviews

Among:
Shape:
1234this paper, Bottom 27%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 2.00 over 3 reviews, above 27% of the others.
Reviewer_NadZOpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
1
Soundness
1
Read review
Paper summary

This paper proposes a divergence between two constant-curvature spaces with potentially different curvatures by extending Sliced Gromov Wasserstein to spherical spaces and combining it with its versions in Euclidean and hyperbolic spaces. The authors provide theoretical bounds relating the proposed divergence with intrinsic GW. The paper also provides experiment results to show this divergence is effective and could be beneficial as a regularizer when incorporated with learning methods on graph and multimodal models.

Critical strengths
  • The proposed method, when extended to constant-curvature space, has small overhead compared to SGW, which is the original method on Euclidean space.
Critical weaknesses
  • Equation 10 (the definition of CCSGW) seems to have substantive issues. In specific:

    • The direction measure is inconsistently denoted by λK1\lambda_{K_1} and λn1\lambda_{n_1}.
    • The formula itself doesn't resemble SGW [1] in Equation 5. SGW pads μ\mu before projection, while CCSGW pads the projection axis before projecting ν\nu onto it, causing the loss of n2−n1n_2-n_1 last dimensions when projecting. Thus, CCSGW wouldn't reduce to Euclidean SGW in [1] as claimed in Section 3.2. For example, with μ=δ(0,0),ν=12(δ(0,0,1)+δ(0,0,−1))\mu=\delta_{(0,0)}, \nu=\frac{1}{2}\left(\delta_{(0,0,1)}+\delta_{(0,0,-1)}\right), CCSGW(μ,ν)=0CCSGW(\mu,\nu)=0 as projecting ν\nu onto every padded direction cancels the last coordinate while SGW(μ,ν)>0SGW(\mu,\nu)>0
  • The mean gains in graph node classification and EEG-based multimodal learning are modest relative to the reported variability. Tables 2 and 3 alone do not establish the statistical reliability of these improvements.

  • Minor:

    • Typo "Wegrate" at line 372

Ref:

[1] Vayer et al. Sliced Gromov-Wasserstein. NeurIPS 2019

Questions for authors
  • What is the magnitude of HXH_X and HYH_Y related to GWGW and CCSGWCCSGW defined in Theorem 3.1, measured in experiments of Section 4? Since GWGW is bounded by 2HX+2HY+CCSGW2H_X + 2H_Y + \sqrt{CCSGW}, those terms may dominate the bound.

  • Please clarify the motivation of enforcing geometric consistency across components in the mentioned tasks in Section 4. In particular, why should components intended to capture different geometric structures benefit from having their within-component distance structures aligned?

Reviewer_hoHiOpenReview ↗
Rating
2
Confidence
4
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

The paper proposes CCSGW for distributional alignment across constant-curvature spaces. It maps embeddings to geodesic projection coordinates and uses a sorting-based GW surrogate to compare the slices. The analysis relates an unstandardized sliced discrepancy to the intrinsic GW discrepancy and pairwise distance preservation, subject to geodesic projection displacement and L2L^2 matching error. Experiments integrate the regularizer into three mixed-curvature backbones for graph anomaly detection, graph node classification, and EEG-based multimodal learning.

Critical strengths

A useful alignment mechanism with empirical support.

CCSGW improves the reported mean performance across three backbones, including gains of 2.79 and 5.11 AUROC percentage points on Reddit and Elliptic. Appendix D provides paired improvement intervals in the sensitivity study, a geodesic-versus-ambient projection ablation, and forward/backward timing. On CUSP, CCSGW outperforms the reported SGW baseline on all five datasets and gives performance comparable to the tested GW regularizer. Its timing is close to SGW and substantially below the dense GW implementation. Avoiding a full pairwise distance matrix is valuable for repeated regularization during training.

Critical weaknesses
  1. The theoretical guarantees are not established for the loss used in training.

Theorem 3.1 concerns unstandardized projections in the original distance units, whereas p. 8 and Appendices C.1-C.3 use standardized slices without specifying the transformation. Separate rescaling can erase scale differences measured by intrinsic GW, so the guarantee does not automatically apply to such a loss. Eq. (10) also uses shared directions, while Section 3.3 and the experiments use independent directions. These choices define different objectives and should be reconciled, including the claimed Euclidean-SGW reduction. Beyond the projection-error bound, the properties of the actual loss, such as whether self-comparison vanishes and what a zero value means, remain unclear. The downstream gains demonstrate utility, but Figure 2's loss decrease and qualitative shape change do not directly establish reduced intrinsic GW or distance distortion. The paper therefore needs to establish whether its bounds on intrinsic GW and pairwise distance distortion apply to the implemented loss.

  1. The scope and significance of the additional contribution need clearer positioning.

The abstract's statement that distribution comparison across mixed-curvature spaces remains unexplored needs qualification: sliced GW-type methods already accommodate general metric structures [1, Sections 2–4]. Their distance-quantile construction differs from direct geodesic slicing and incurs quadratic distance preprocessing, so it does not subsume CCSGW. This computational distinction should be made explicit. Proposition 1 likewise follows by expressing the known great-circle projection in signed geodesic distances [2, Lemma 1 and Algorithm 1]; its use for real-line GW under the support restriction is the relevant adaptation. The practical gains are encouraging, but direct alignment-loss comparisons are confined to CUSP, where the average advantage over SGW is about 0.42 percentage points in weighted F1-score. The larger anomaly-detection gains therefore do not isolate CCSGW's benefit over alternative alignment regularizers.

References

[1] Moritz Piening and Robert Beinert. A Novel Sliced Fused Gromov-Wasserstein Distance. AAAI, 40(29):24828–24836, 2026. https://doi.org/10.1609/aaai.v40i29.39669

[2] Clément Bonet, Paul Berg, Nicolas Courty, François Septier, Lucas Drumetz, and Minh-Tan Pham. Spherical Sliced-Wasserstein. ICLR, 2023. https://arxiv.org/abs/2206.08780

[3] Titouan Vayer, Rémi Flamary, Romain Tavenard, Laetitia Chapel, and Nicolas Courty. Sliced Gromov-Wasserstein. NeurIPS, 2019. See the correction notice dated October 20, 2022 in arXiv v4. https://arxiv.org/abs/1905.10124v4

Questions for authors
  1. Please specify the standardization and joint direction-sampling procedure, and state which geometric properties and guarantees apply to the resulting loss. Do direct measurements show that training reduces intrinsic GW or pairwise distance distortion?

  2. Can the exact-1D-GW claim in lines 179-183 be replaced by a precise restricted-coupling surrogate definition, with the ground-cost convention clarified? The general sorting-optimality claim was corrected in the 2022 correction notice in [3]. Since both sorted couplings are feasible, this correction need not invalidate the unstandardized upper bound.

  3. What is the specific advantage over existing general-metric sliced GW approaches, and does the benefit over alternative alignment losses extend to an anomaly-detection setting with a large reported gain? A representative comparison would help assess the significance of the proposed method.

Reviewer_rn6zOpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
2
Soundness
1
Read review
Paper summary

This paper proposes Constant-Curvature Sliced Gromov–Wasserstein (CCSGW), a regularizer designed to align embedding distributions across constant-curvature components (hyperbolic, Euclidean, spherical) within mixed-curvature product manifolds. They evaluate CCSGW as an auxiliary loss on top of three existing mixed-curvature backbones: CurvGAD for graph anomaly detection, CUSP for node classification, and EEG-MoCE for multimodal EEG classification.

Critical strengths
  • Computational efficiency of 1D geodesic slicing for cross-manifold regularization.
  • Plug-and-play integration across diverse mixed-curvature architectures.
Critical weaknesses
  • Theorems 3.1–3.2 are near-vacuous and do not cover the trained loss. For a Euclidean component, Evd(x,Pv(x))2=(1−1/n)∥x∥2\mathbb{E}_v d(x,P_v(x))^2=(1-1/n)\|x\|^2, so HX=1−1/n MXH_X=\sqrt{1-1/n}\,M_X with MXM_X the RMS radius. With n=16n=16, Theorem 3.1 is at most 3%3\% tighter than the trivial product-coupling bound GW2≤2MX+2MY\text{GW}_2\le 2M_X+2M_Y, even at S=0S=0. For Theorem 3.2 with N≥11N\ge 11 uniformly weighted points, three lie within radius N/(N−2) MX\sqrt{N/(N-2)}\,M_X and two of them subtend at most 120∘120^\circ, so r≤3N/(N−2) MX<2HX≤Br\le\sqrt{3N/(N-2)}\,M_X<2H_X\le B. Hence B/r>1B/r>1, and the regime B<rB<r cannot be reached. Moreover, Sec. C.1–C.3 standardize every slice, which cancels the 1/K1/\sqrt{K} in Eq. (9) and breaks the isometry of Lemma B.2 on which both theorems rest.
  • Gains are within noise and do not isolate geodesic slicing. In Table 2, gains on CiteSeer (+0.14+0.14) and PubMed (+0.06+0.06) are below the reported 95% CIs (±1.23\pm1.23, ±0.18\pm0.18); on Emotion (+0.69+0.69) the CI is ±9.72\pm9.72 (Table 3). In Table 4, CCSGW beats Euclidean SGW by only 0.070.07–0.620.62 points per dataset, all within overlapping CIs, which does not support the claim that "most of the benefit comes from slicing along geodesics." Fig. 3a shows that aligning all nodes gives the only negative gain (Cora). The formulation is also inconsistent: Eq. (10) uses one shared padded direction, whereas Sec. 3.3 and Eq. (21) draw v,w independently, Eq. (7) uses d(x,x0)d(x,x_0) instead of d(Pv(x),x0)d(P_v(x),x_0)
Questions for authors
  • For a Euclidean component, HX=1−1/n MXH_X=\sqrt{1-1/n}\,M_X, which already forces B>rB>r in Theorem 3.2 for N≥11N\ge 11 uniformly weighted points. Can you report HXH_X, HYH_Y, S\sqrt{S} and rr for the trained CUSP embeddings on Cora, and exhibit any trained configuration where B<rB<r?

  • Sec. C.1–C.3 standardize each slice, so the trained loss no longer depends on the 1/K1/\sqrt{K} factor in Eq. (9) and Lemma B.2's isometry fails. Which guarantee applies to the standardized objective, and how does the unstandardized CCSGW of Eq. (10) perform in Table 2?

  • The CCSGW–SGW gaps in Table 4 (0.070.07–0.620.62) lie inside the CIs. Can you report paired per-split differences with significance tests against CUSP and SGW, and explain why aligning all nodes (Fig. 3a) hurts on Cora?

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Discussion (0)

Sign in to comment.