mlsanityData to 7 Oct 2026

Minimization of Functions on Dually Flat Spaces Using Geodesic Descent Based on Dual Connections

arXiv 2512.09358 ↗First posted 10 Dec 2025stat.CO stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

We propose geodesic-based optimization methods on dually flat spaces, where the geometric structure of the parameter manifold is closely related to the form of the objective function. A primary application is maximum likelihood estimation in statistical models, especially exponential families, whose model manifolds are dually flat. We show that an m-geodesic update, which directly optimizes the log-likelihood, can theoretically reach the maximum likelihood estimator in a single step. In contrast, an e-geodesic update has a practical advantage in cases where the parameter space is geodesically complete, allowing optimization without explicitly handling parameter constraints. We establish the theoretical properties of the proposed methods and validate their effectiveness through numerical experiments.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 3 of its 15 references that are in the map. First posted on arXiv 10 Dec 2025.

Builds on

3 of 15 references.

References · 3

  1. 2015Weight Uncertainty in Neural Networkscited by 554
  2. 2013The Information Geometry of Mirror Descentcited by 53
  3. 2014Optimization Techniques on Riemannian Manifoldscited by 27

Built on by

Not cited yet.