Efficient Sampling for Generative Adversarial Networks with Coupling Markov Chains
Recently, sampling methods have been successfully applied to enhance the sample quality of Generative Adversarial Networks (GANs). However, in practice, they typically have poor sample efficiency because of the independent proposal sampling from the generator. In this work, we propose CMC-GAN, a novel sampling method with dependent proposals reparametrized through a Coupling Markov Chain (CMC) in the latent space of the generator. Theoretically, we prove that our CMC proposal can converge to the true data distribution, given a perfect discriminator. Empirically, extensive experiments on synthetic and real datasets demonstrate that our CMC-GAN largely improves the sample efficiency and obtains better sample quality simultaneously.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Reparameterized Sampling for Generative Adversarial Networks
Recently, sampling methods have been successfully applied to enhance the sample quality of Generative Adversarial Networks (GANs). However, in practice, they typically have poor sample efficiency because of the independe…
Improving Sampling from Generative Autoencoders with Markov Chains
We focus on generative autoencoders, such as variational or adversarial autoencoders, which jointly learn a generative model alongside an inference model. Generative autoencoders are those which are trained to softly enf…
Cross-fluctuation phase transitions reveal sampling dynamics in diffusion models
We analyse how the sampling dynamics of distributions evolve in score-based diffusion models using cross-fluctuations, a centered-moment statistic from statistical physics. Specifically, we show that starting from an unb…
Image ClassificationStyle TransferVirtual Quantum Markov Chains
Quantum Markov chains generalize classical Markov chains for random variables to the quantum realm and exhibit unique inherent properties, making them an important feature in quantum information theory. In this work, we …
Tail-Sensitive KL and Rényi Convergence of Unadjusted Hamiltonian Monte Carlo via One-Shot Couplings
Hamiltonian Monte Carlo (HMC) algorithms are among the most widely used sampling methods in high dimensional settings, yet their convergence properties are poorly understood in divergences that quantify relative density …