Skip to content
Open access

Enhancing Robustness of Constant Curvature Graph Convolutional Network with Lipschitz Regularization

Jul 2026 · ACM Transactions on Knowledge Discovery from Data · Vol 20, pp. 1 - 30 · 0 citations · 58 references

TL;DR

A rigorous Lipschitz analysis for constant curvature graph convolutional networks ( \(\kappa\) -GCNs) and enhances their robustness through Lipschitz regularization and derives upper bounds for the Lipschitz constants across constant curvature spaces, thereby standardizing the Lipschitz limits of the \(\kappa\) -stereographic model.

Abstract

Non-Euclidean spaces inherently enable high-fidelity embeddings for hierarchical and cyclical data due to their geometric properties. Existing approaches unify hyperbolic and spherical embeddings within the framework of constant curvature spaces. However, current methods for Lipschitz regularization remain limited to non-positive curvature geometries, such as hyperbolic and Euclidean spaces, and cannot be naturally extended to the general constant curvature setting. In this article, we present a rigorous Lipschitz analysis for constant curvature graph convolutional networks ( \(\kappa\) -GCNs) and enhance their robustness through Lipschitz regularization. We derive upper bounds for the Lipschitz constants across constant curvature spaces, thereby standardizing the Lipschitz limits of the \(\kappa\) -stereographic model. Furthermore, we incorporate these bounds into a regularization framework for \(\kappa\) -GCNs to improve stability and robustness. Experimental results demonstrate that the proposed regularization method often strengthens the robustness of \(\kappa\) -GCNs across various curvature regimes, particularly under Gaussian feature noise.

Read PDF

Similar papers

Preprint Sep 2026

Minkowski Attractor Networks: Closed-Form Hyperbolic Flows for Visual Representations

By framing hyperbolic manifolds as quadric level sets, MAN resolves hyperbolic geometry by combining linear Lorentz group transport with non-linear cone lifting and closed-form radial rescaling, evaluating in a single forward pass without numerical ODE solvers or iterative retractions.

Zhong-Ping Ji · 1 citation
#machine learning Preprint Oct 2026

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

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 componen...

Shang-Lin Li, Wen-Jing Lu, Mu-Yang Li et al. · 0 citations
#machine learning Preprint Oct 2026

Hyperbolic Graph Representation Learning: Embed in One Metric, Optimize with Another

Hierarchical graphs embed in hyperbolic space with lower distortion than in Euclidean space owing to its negative curvature. However, their gradient-based learning is hampered at large radii, where the Poincar\'e ball and the Lorentz hyperboloid models fail numerically. Polar coordinates avoid this problem, but the hyp...

Federico Larroca, P. Bermolen, Marcelo Fiori et al. · 0 citations
Preprint Oct 2026

Curvature, Scaling, and Complexity in Riemannian Projection-Free Optimization

Projection-free methods replace projections by linear minimization oracles, making their convergence fundamentally sensitive to the geometry of the feasible region. We develop a geometric framework for this dependence in Riemannian Frank--Wolfe optimization. A power-type double-geodesic modulus quantifies the intrinsic...

B. T. Nguyen · 0 citations
#machine learning Preprint Sep 2026

Explaining f-Divergence-Based Regularization via Local Curvature and Sharpness-Aware Minimization

Divergence-based regularization and Sharpness-Aware Minimization (SAM) are two prominent approaches for improving generalization in deep learning, both motivated by robustness to perturbations. However, their relationship has remained largely unexplored. Building on classical second-order expansions of $f$-divergences,...

Nour Jamoussi, Marios Kountouris · 1 citation
Preprint Aug 2026

Centered Weak Discrete Riemannian Gradients: A Unified Framework for Riemannian Optimization

We introduce the centered weak discrete Riemannian gradient (c-wDRG) framework for the unified analysis of optimization methods on Riemannian manifolds. The framework uses a center point to represent the relevant logarithmic differences in a common tangent space and covers Riemannian steepest descent, proximal point, p...

De-Run Zhou, Mahito Sugiyama · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.