Sign inGet started
Paper · arXiv

Geometry of learning dynamics: Gradient descent versus natural gradient on the ridge of optimization

High-capacity associative memories based on Kernel Logistic Regression (KLR) exhibit a "Ridge of Optimization" characterized by extreme stability and a highly skewed weight spectrum. However, the dynamical process by which learning converges to this critical regime has remained unclear. This paper provides a geometric analysis of the learning trajectories on the statistical manifold of a KLR-trained Hopfield network. By comparing the paths of Gradient Descent (GD) and Natural Gradient Descent (NGD), we elucidate the mechanisms governing the optimization process. Our analysis reveals that learning on the Ridge proceeds in two distinct phases. We show that the extreme curvature of the Ridge...

AuthorsAkira Tamamori
Primary categorycs.LG
Published15 September 2026
Last updated at source16 September 2026
cs.LGcs.NE
Embed this entry
<iframe src="https://silytics.si/embed/item/fe335238-85ff-44ec-bbdd-b826ea142488" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.