Understand loss function of GAN 理解GAN的损失函数

注: 本文是作者的自我总结,主要作为个人总结记录, 欢迎大家批评,交流. https://zhouxiaowei1120.github.io/#blogs

Loss Function of GAN

min ⁡ G max ⁡ D V ( D , G ) = E x ∼ p d a t a ( x ) [ log ⁡ D ( x ) ] + E z ∼ p z ( z ) [ log ⁡ ( 1 − D ( G ( z ) ) ) ] \min \limits_{G} \max \limits_D V(D, G) = \mathbb{E}_{x\sim p_{data}(x)}[\log D(x)] + \mathbb{E}_{z\sim p_{z}(z)}[\log (1 - D(G(z)))] GminDmaxV(D,G)=Expdata(x)[logD(x)]+Ezpz(z)[log(1D(G(z)))]

My Understanding

D D D try to maximize V ( D , G ) V(D, G) V(D,G), while G G G try to minimize V ( D , G ) V(D, G) V(D,G). Larger the V ( D , G ) V(D, G) V(D,G), larger the D D D, D D D is better to discriminate the input. When we use cross entropy as loss function, because there is a minus between cross entropy and V ( D , G ) V(D, G) V(D,G), we should try to minimize cross entropy, which is equal to maximize V ( D , G ) V(D, G) V(D,G).

When it comes to G G G, smaller the V ( D , G ) V(D, G) V(D,G), larger the D ( G ( z ) ) D(G(z)) D(G(z)). That means D D D try to classify G ( z ) G(z) G(z) as true, which is just the goal of G G G. When we use cross entropy as loss function, because there is a minus between cross entropy and E z ∼ p z ( z ) [ log ⁡ ( 1 − D ( G ( z ) ) ) ] \mathbb{E}_{z\sim p_{z}(z)}[\log (1 - D(G(z)))] Ezpz(z)[log(1D(G(z)))], we should try to minimize minus cross entropy.

  • 2
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值