Answers.Body: <p>To put it simply GANs suffer from a problem of uneven learning rate. Imagine the learning rate of a pitcher and hitter if the pitcher gets to a point where they can throw much better than the hitter can hit then the hitter may fall into a 'training pit' as to be unable to ever learn how to hit from the pitcher. </p>
  
  <p>This follows a continues relationship in between the two learning rates where if the pitcher is becoming a much better pitcher at a faster rate they could become too good and make learning impossible for the hitter. So the rate must be 'slowed down' as to ensure the pitcher doesn't ruin the hitter.</p>
  
  <p>If the cone of the Lipschitz continuity function of either function is outrunning/outpacing the other than the learning for the one who is in front must be slowed down so the other catches up. </p>
  
  <p>Two runners trying to push each other athletically is another example. If one outpaces the other an injury may occur in the one lagging behind while trying to keep pace this happens, when the adversarial network becomes too good at generating training material that the behind network is not ready to learn with.</p>
  
  <p>The GAN will do best when the learning rates are adjusted to slow down the fast learner artificially. </p>
  
  <p>The statistics will not be bounded correctly if the learning rates are not kept in check similarly to how step size needs to be right to find local minimum and maximum. If the learning is not artificial augmented so both keep relatively same pace getting stuck at local minimum and maximum of the solution space will occur.</p>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2019-11-15T14:20:41.243Z
Answers.Text: What do you mean by saying that the cone of one function is outrunning the other? I know that for a Lipschitz function there should exist a cone which you can move along the x axis and have the whole graph outside the cone, but I do not understand what do you mean by this.
Answers.UserDisplayName: MattSt
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2019-11-15T16:06:49.313Z
Answers.Text: If the two functions representing the two problems learning space differ and the slope of one is steeper then the other then the learning rates will be unequal. If one of the models out runs the other than it wrecks the two runners keeping pace phenomenon. For learning problems a function exists that represents different phases of learning the problem. Like a discriminators may have a nearly flat line learning the difference between black boots and white boots but may have a very steep(difficult) time learning the difference  between black stilettos and black pumps.
Answers.UserDisplayName: Michael Hearn
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2019-11-12T21:16:45.607Z
Answers.LastActivityDate: 2019-11-12T21:16:45.607Z
Answers.UserDisplayName: Michael Hearn
Body: <p>I have been reading the paper which introduced <a href="https://arxiv.org/pdf/1802.05957.pdf" rel="nofollow noreferrer">spectral normalization</a> in GANs.</p>
  
  <p>At some point the paper mentions the following:</p>
  
  <blockquote>
    <p>The machine learning community has been pointing out recently that the
    function space from which the discriminators are selected crucially
    affects the performance of GANs. A number of works (Uehara et al.,
    2016; Qi, 2017; Gulrajani et al., 2017) advocate the importance of
    Lipschitz continuity in assuring the boundedness of statistics.</p>
  </blockquote>
  
  <p>What does it mean that the Lipschitz continuity assures the boundedness of statistics and why does that happen?</p>
  
Tags: <machine-learning><terminology><math><generative-adversarial-networks>
Title: Why does a Lipschitz continuous discriminator in GANs assure statistical boundedness?
UserDisplayName: MattSt
ThreadText: # Why does a Lipschitz continuous discriminator in GANs assure statistical boundedness?
  
  (Asked by: username_0 on 2019-11-12)
  
  I have been reading the paper which introduced [spectral normalization](https://arxiv.org/pdf/1802.05957.pdf) in GANs.
  
  At some point the paper mentions the following:
  
  > The machine learning community has been pointing out recently that the
  > function space from which the discriminators are selected crucially
  > affects the performance of GANs. A number of works (Uehara et al.,
  > 2016; Qi, 2017; Gulrajani et al., 2017) advocate the importance of
  > Lipschitz continuity in assuring the boundedness of statistics.
  
  What does it mean that the Lipschitz continuity assures the boundedness of statistics and why does that happen?
  
  **Tags:** machine-learning, terminology, math, generative-adversarial-networks
  
  
  ---
  
  ## 1 answers
  
  ### Answer by username_1 on 2019-11-12. Score: 2 | Accepted answer
  
  To put it simply GANs suffer from a problem of uneven learning rate. Imagine the learning rate of a pitcher and hitter if the pitcher gets to a point where they can throw much better than the hitter can hit then the hitter may fall into a 'training pit' as to be unable to ever learn how to hit from the pitcher.
  
  This follows a continues relationship in between the two learning rates where if the pitcher is becoming a much better pitcher at a faster rate they could become too good and make learning impossible for the hitter. So the rate must be 'slowed down' as to ensure the pitcher doesn't ruin the hitter.
  
  If the cone of the Lipschitz continuity function of either function is outrunning/outpacing the other than the learning for the one who is in front must be slowed down so the other catches up.
  
  Two runners trying to push each other athletically is another example. If one outpaces the other an injury may occur in the one lagging behind while trying to keep pace this happens, when the adversarial network becomes too good at generating training material that the behind network is not ready to learn with.
  
  The GAN will do best when the learning rates are adjusted to slow down the fast learner artificially.
  
  The statistics will not be bounded correctly if the learning rates are not kept in check similarly to how step size needs to be right to find local minimum and maximum. If the learning is not artificial augmented so both keep relatively same pace getting stuck at local minimum and maximum of the solution space will occur.
  
  > **Comments:**
  > **username_0**: What do you mean by saying that the cone of one function is outrunning the other? I know that for a Lipschitz function there should exist a cone which you can move along the x axis and have the whole graph outside the cone, but I do not understand what do you mean by this.  
  > **username_1**: If the two functions representing the two problems learning space differ and the slope of one is steeper then the other then the learning rates will be unequal. If one of the models out runs the other than it wrecks the two runners keeping pace phenomenon. For learning problems a function exists that represents different phases of learning the problem. Like a discriminators may have a nearly flat line learning the difference between black boots and white boots but may have a very steep(difficult) time learning the difference  between black stilettos and black pumps.  
  
  ---
  
  