目录
Another Approach: q(z)->p(z) Intuitively comprehend KL(p|q) Minimize KL Divergence How to compute KL between q(z) and p(z)Distribution of hidden code
Give more details after GAN
Another Approach: q(z)->p(z)
Explicitly enforce
Intuitively comprehend KL(p|q)
\(KL \in{[0,+\infty]}\)
KL = 0 --> \(p\approx{q}\)
Minimize KL Divergence
Evidence Lower BOund
\[KL(q_\theta(z|x_i)||p(z)) \]
How to compute KL between q(z) and p(z)
我们所希望的两点:
重建变量 隐藏变量逼近p的分布查看更多关于Adversarial Auto-Encoders的详细内容...
声明:本文来自网络,不代表【好得很程序员自学网】立场,转载请注明出处:http://haodehen.cn/did127395