zoukankan      html  css  js  c++  java
  • 李宏毅 2018最新GAN课程 class 3 Theory behind GAN

     

     

     

     Too much limitation of Gaussian model. The images are too blurry. So any general model?

    But if PG(x;θ) is a neural network, it's impossible to calculate the likelihood. ????

     

     We don't know the formulation of PG and Pdata, so how to calculate the divergence???? ---->>> discriminator!!!

     

     

    V(G,D) = maximum the output if data come from Pdata, and maximum the output of data from PG. --- >>> this process is identical to a binary classifier

     

     

     

    不是minima 和 saddle point

    而是maxima

     

     

     

     

     

    even if L(G) is not differentiable (a Max operation), the derivative is computable.

     

     

    Tip:

    Train D as much as possible

    Train G only to a moderate level

     

      

     

    the results are actually similar......

      

     

     

    green point is true data, blue point is from genrator

     https://www.youtube.com/watch?v=ebMei6bYeWw

     

    Some one would argue that discriminator shouldn't initialize with the last discriminator, but the operation also sounds reasonable on another perspective.

    Some one in a paper shows that the performance increases if the samples come from current and past generators, although it may not sound reasonable.

  • 相关阅读:
    持久化类的三种状态
    Hibernate持久化类规则
    JSP之Bean
    JSP动作标签
    JSP九大内置对象
    Jsp指令
    JSTL标签语言
    JSP之EL表达式
    Java 中的 Characters
    汇编基本语法
  • 原文地址:https://www.cnblogs.com/ecoflex/p/9040918.html
Copyright © 2011-2022 走看看