Goto

Collaborating Authors

 Uncertainty





Unsupervised Representation Learning from Pre-trained Diffusion Probabilistic Models Appendix A Algorithm

Neural Information Processing Systems

Algorithm 1 shows the training procedure of PDAE. Table 1 shows the network architecture of pre-trained DPMs we use. Table 2 shows the network architecture. The sampled z will be denormalized for use. We use EMA on all model parameters with a decay factor of 0.9999.




A Proofs from Section 2 448 Algorithm 4: Output ห† ฮฑ null G1 (1 ฮท

Neural Information Processing Systems

Return ห† ฮฑ We show the following generalization of Proposition 2.1. Moreover, Alg. 4 has sample complexity The sample complexity is clear so we focus on the first statement. Theorem 4.5 in [MU17]) on these events as i varies and noting that Hence recalling (A.2) above, we conclude that The other direction is similar. Using (A.2) in the same way as above, we find First we analyze the expected sample complexity. Finally Alg. 4 has sample complexity We do this using Bayes' rule.