Date | Aug 14, 2019 |
---|---|

Speaker | Ernest Ryu |

Dept. | UCLA |

Room | 129-104 |

Time | 16:00-17:00 |

Despite the remarkable empirical success, the training dynamics of generative adversarial networks (GAN), which involves solving a minimax game using stochastic gradients, is still poorly understood. In this work, we present variants of stochastic gradient descent and analyze their last-iterate convergence under the assumption of convex-concavity. The analyses of the discrete algorithms are inspired by continuous-time analyses with differential equations.

TEL 02-880-5857,6530,6531 / FAX 02-887-4694