AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
Dolly, Is It a Loss Function?
In the discrete bottom-coater setting, you usually assume that latents are uniform or the priors like a uniform distribution. So this KL divergence is like, I guess pretty simple to compute because you know, you make this sort of naive assumption about uniform latents. The thing that's not tractable is like in the case of Dolly directly computing the likelihood of images given text. Directly computing that is a bit unsh, a bit non-tractable because of various computation limits with like sequence links and transformers. We reduce it to this latent space, which sort of makes the problem a lot more computable.