Minimization of Functions on Dually Flat Spaces Using Geodesic Descent Based on Dual Connections
By: Gaku Omiya, Fumiyasu Komaki
Potential Business Impact:
Finds best answers faster for statistics.
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.
Similar Papers
Dual Riemannian Newton Method on Statistical Manifolds
Computation
Speeds up computer learning by using geometry.
Geodesic Calculus on Latent Spaces
Machine Learning (CS)
Helps computers understand data shapes better.
Decentralized Online Riemannian Optimization Beyond Hadamard Manifolds
Optimization and Control
Makes smart machines learn better on curved paths.