Posted in Web Perplexity calculation in variational neural topic models January 25, 2025 The authors say that: Since log p(X) log p (X) is intractable in the NVDM, we use the variational lower bound (which is an upper bound on perplexity) to compute the perplexity following Mnih & Gregor (2014). https://stats.stackexchange.com/questions/389017/perplexity-calculation-in-variational-neural-topic-models