We develop two fundamental tools needed to apply SLC distributions to learning and inference: sampling and mode finding . For sampling we develop an MCMC sampler and give theoretical mixing time bounds.
Our methods also generalize naturally to let us prove new convergence bounds on low-precision training with other quantization schemes, such as low-precision floating-point computation and logarithmic quantization.
Therefore, in this paper, we study the occurring challenges for co-generation with GANs. To address those challenges we develop an annealed importance sampling based Hamiltonian Monte Carlo co-generation algorithm.