SDE approximations of GANs training and its long-run behavior
Not on the map. Why?
Abstract (arXiv)
This paper analyzes the training process of GANs via stochastic differential equations (SDEs). It first establishes SDE approximations for the training of GANs under stochastic gradient algorithms, with precise error bound analysis. It then describes the long-run behavior of GANs training via the invariant measures of its SDE approximations under proper conditions. This work builds theoretical foundation for GANs training and provides analytical tools to study its evolution and stability.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 3 Jun 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1.
1 paper.