arXiv Machine Learning By Xingrun Li, Sho Kuno, Yusuke Mukuta, Xin Yang, Tatsuya Harada

The Implicit Bias of Hyperbolic Representation Learning for Multiclass Data: A Busemann Risk Perspective

Read the original on arXiv Machine Learning →

The paper investigates the implicit bias of Riemannian gradient flow in hyperbolic multiclass classification with fixed class prototypes. It introduces a decomposition of distances into radial and direction-dependent terms via the Busemann function, leading to two key results: a radial dichotomy that predicts whether trajectories move toward the boundary or return inward, and convergence of boundary directions to critical points of the Busemann risk. These findings offer a rigorous asymptotic explanation for boundary saturation and near-boundary clustering observed in hyperbolic representation learning.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jul 14

Exact Dynamics of Multi-class Stochastic Gradient Descent

arXiv:2510. 14074v2 Announce Type: replace-cross Abstract: We develop a framework for analyzing the learning dynamics of high-dimensional problems trained using one-pass stochastic gradient descent (SGD) with data from multiple anisotropic classes.

By Elizabeth Collins-Woodfin, Inbar Seroussi
arXiv Machine Learning
Oct 2

Dynamics to decision: A mathematical theory of Lyapunov spectra and decision boundaries in deep classifiers

The paper presents a mathematical framework that treats a deep classifier as a finite, nonautonomous discrete dynamical system, with each layer acting as a time step. It introduces the Finite-Time Maximum Lyapunov Exponent (FTMLE) to quantify how nearby data trajectories converge or diverge as they propagate through the network, and shows that at the probability level the FTMLE’s dominant direction aligns with the decision boundary normal for Gaussian classes. The authors further analyze how this relationship changes when moving backward to logits and hidden representations, identify conditions under which boundary-related FTMLE persists, and propose geometry-aware fine‑tuning to concentrate high hidden FTMLE near the decision boundary.

By Shirin Panahi, Amirhossein Nazerian, Ali Pezeshki
arXiv AI
3d ago

Learning Pseudo-Riemannian Manifolds for Heterophilic Graphs via Graph Signature

The paper introduces the Graph Signature Index to quantify the mismatch between positive-definite geometric priors in many Graph Neural Networks and the negative distances often needed for heterophilic graphs. Using this signature, the authors propose the Pseudo‑Riemannian Attention Network (PRAT), which learns a signed squared pseudo‑distance metric that can capture both attractive and repulsive relationships. Experiments on fifteen node‑classification benchmarks show that PRAT matches or surpasses state‑of‑the‑art heterophily‑adapted models, and ablation studies confirm that the sign structure provided by the signature is essential for its performance.

By Yun Young Choi, Asung Kil, Sun Woo Park, Minho Lee, Seokhwan Kim
arXiv AI
Jul 24

Riemannian Deep Learning: Modules, Networks, and Geometries

arXiv:2607. 19305v2 Announce Type: replace-cross Abstract: Deep neural networks on manifold-valued representations have attracted growing interest, but many basic components remain tied to specific manifolds, rely on Euclidean approximations, or require costly and numerically fragile geometric operations.

By Chen Ziheng