Guiding Time-Varying Generative Models with Natural Gradients on Exponential Family Manifold

Song Liu, Leyang Wang, Yakun Wang
2/11/2025
stat.MLcs.LG

Official code: anewgithubname/iNGD (1 star, MIT, last commit 2025-06-13).

Abstract

Optimising probabilistic models is a well-studied field in statistics. However, its connection with the training of generative models remains largely under-explored. In this paper, we show that the evolution of time-varying generative models can be projected onto an exponential family manifold, naturally creating a link between the parameters of a generative model and those of a probabilistic model. We then train the generative model by moving its projection on the manifold according to the natural gradient descent scheme. This approach also allows us to efficiently approximate the natural gradient of the KL divergence without relying on MCMC for intractable models. Furthermore, we propose particle versions of the algorithm, which feature closed-form update rules for any parametric model within the exponential family. Through toy and real-world experiments, we validate the effectiveness of the proposed algorithms. The code of the proposed algorithms can be found at https://github.com/anewgithubname/iNGD.

View on arXivView PDF

Code Implementations(1)

MIT

The code for reproducing experiments in https://arxiv.org/abs/2502.07650

10Python, Jupyter NotebookApr 16, 20251 years agoMIT

Similar Papers

Cite this paper

@article{liu2025guiding,
  title  = {Guiding Time-Varying Generative Models with Natural Gradients on Exponential Family Manifold},
  author = {Song Liu and Leyang Wang and Yakun Wang},
  year   = {2025},
  eprint = {2502.07650},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.07650v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.07650.svg)](https://codeofpaper.com/paper/2502.07650)

Discussion