Skip to content

K\"ahler landscapes for complex neural network descents and guarantees including a search and destroy of the Calabi-Yau manifold

Aug 2026 · 0 citations
Computer Science Mathematics

TL;DR

It has been discovered that negative curvature subverts the loss landscape, specifically sectional curvature, so it has been discovered that negative curvature subverts the loss landscape, so this work expands on this and draw interconnections to negative-definite Ricci curvature.

Abstract

We study landscapes for complex-parameterized networks. Our approach is motivated with an information-theoretic manifold perspective of the parameter and via classical optimization guarantees although of complex geometric variety such as through Dolbeault asymptotics. The descent path admits a K\"ahler information metric under a cross-entropy via the Wirtinger Hessian on the log-likelihood potential. We restrict attention to a descent update rule with natural gradient descent via a differentiated loss scaled by the inverse metric, so the descent path remains in the holomorphic tangent bundle. We emphasize Calabi-Yau information manifolds which profane theoretical guarantees via an ill-curvature-conditioned landscape. Under a Calabi-Yau metric, specifically in a non-compact setting with a global potential so defined geometrically rather than invoking the topological requirements of the Calabi conjecture, a wedged nowhere-vanishing holomorphic form is the top exterior product of the K\"ahler form up to constants, yielding a constant determinant condition with respect to a background metric and ill-conditioned eigenvalues under nonuniform and almost low-rank assumptions. Moreover, it has been discovered that negative curvature subverts the loss landscape, specifically sectional curvature, so we expand on this and draw interconnections to negative-definite Ricci curvature. Our arguments primarily exist in a geometric analytic modality, although we establish roots in deep learning theory such as through asymptotics at initialization and connections through failure modes of neural network guarantees under vanishing and negative Ricci curvature.

View source

Similar papers

#machine learning Preprint Sep 2026

$\mathbb{SL}(n)$ Representation Learning: An Intrinsic Mixed-Curvature Space with Higher Curvature Capacities and Deeper Order-Aware Composition

The $\mathbb{SL}(n)$ space is introduced, a representation geometry defined by the simple $\det(A)=1$ constraint and a left invariant Schatten-$p$ Finsler structure that consistently outperforms a broad range of representation manifold baselines across graph benchmarks at different scales.

Xing-Run Li, Yusuke Mukuta, Xin Yang et al. · 0 citations
Preprint Aug 2026

Positive Tensor-Network K\"ahler Metrics on gCICY Threefolds

We develop and implement a positive tensor-network parameterization for computing Ricci-flat K\"ahler metrics on Calabi-Yau manifolds. It replaces the large Hermitian coefficient matrix of a high-degree algebraic metric by a matrix-product factorization. For the immersed source spaces used here, the resulting metric is...

Jun-Tao Wang · 0 citations
Preprint Aug 2026

Is Grokking a Loss of Normal Hyperbolicity of the Interpolation Manifold?

A simple, optimizer-agnostic diagnostic: the smallest nonzero singular value of the residual Jacobian of the residual Jacobian, which, for the squared loss, equals the slowest normal restoring rate of the manifold.

Suvinava Basak · 0 citations
Preprint Aug 2026

Open-Loop Riemannian Frank--Wolfe: Fast Rates under Error Bounds and Scaling Inequalities

We explore fast convergence of the Riemannian Frank--Wolfe method for smooth geodesically convex optimization over compact feasible sets. Hadamard manifolds are the main setting. On general complete manifolds, the analysis accounts for all feasible minimizing geodesics. We consider the open loop step-size $\eta_k=a/(k+...

Kang-Ming Chen · 1 citation · ⚡1
#graph neural networks Open access Sep 2026

Distance-Based Representation Learning with Nonlinear Feature Algebras

A framework grounded in coarse geometry, the branch of mathematics studying metric spaces up to quasi-isometry is proposed: features are nonlinear functions of the distances from each point to a set of anchor points, so they read global geometry directly rather than through local aggregation.

K. Enakoutsa · 0 citations

Related blog posts

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