Approximate Last Iterate Convergence in Overparameterized GANs

08/07/2021
by   Elbert Du, et al.
0

In this work, we showed that the Implicit Update and Predictive Methods dynamics introduced in prior work satisfy last iterate convergence to a neighborhood around the optimum in overparameterized GANs, where the size of the neighborhood shrinks with the width of the neural network. This is in contrast to prior results, which only guaranteed average iterate convergence.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/15/2021

On the Theory of Implicit Deep Learning: Global Convergence with Implicit Layers

A deep equilibrium model uses implicit layers, which are implicitly defi...
research
06/01/2022

Asymptotic Properties for Bayesian Neural Network in Besov Space

Neural networks have shown great predictive power when dealing with vari...
research
08/19/2020

The Neighborhood Polynomial of Chordal Graphs

The neighborhood polynomial of a graph G is the generating function of s...
research
09/29/2019

Understanding and Stabilizing GANs' Training Dynamics with Control Theory

Generative adversarial networks (GANs) have made significant progress on...
research
06/11/2021

Precise characterization of the prior predictive distribution of deep ReLU networks

Recent works on Bayesian neural networks (BNNs) have highlighted the nee...
research
06/19/2017

The E-Average Common Submatrix: Approximate Searching in a Restricted Neighborhood

This paper introduces a new (dis)similarity measure for 2D arrays, exten...
research
08/05/2014

It is hard to see a needle in a haystack: Modeling contrast masking effect in a numerical observer

Within the framework of a virtual clinical trial for breast imaging, we ...

Please sign up or login with your details

Forgot password? Click here to reset