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.
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
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...
Geometry-constrained KANs are introduced, a family of edge activations derived from Banach duality maps in which the geometry itself is learned through a scalar exponent $p>1$ per edge, which controls the qualitative response.
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.
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+...
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· Neural Processing Letters· 0 citations
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.