Sign inGet started
Paper · arXiv

Beyond IGO-Flow: Toward Convergence Analysis of IGO in Continuous Spaces

Information-Geometric Optimization (IGO) provides a unified framework for black-box optimization by interpreting the adaptation of a search distribution as a natural gradient update. Despite its conceptual importance, the convergence theory of IGO remains limited: most existing results concern continuous-time idealizations such as the IGO flow, rather than discrete-time updates with non-infinitesimal learning rates. In this paper, we study discrete-time IGO in continuous spaces, formulated as natural gradient updates in the expectation-parameter coordinates of an exponential family. In particular, we analyze IGO over the multivariate Gaussian family on strongly convex quadratic objective ...

AuthorsRyosuke Kimura, Youhei Akimoto
Primary categorymath.OC
Published16 June 2026
Last updated at source16 June 2026
math.OCcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/f056a9a2-f15d-4fce-9124-9da95b76fbf5" 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.