The Implicit Metropolis-Hastings Algorithm
원문 초록
Recent works propose using the discriminator of a GAN to filter out unrealistic samples of the generator. We generalize these ideas by introducing the implicit Metropolis-Hastings algorithm. For any implicit probabilistic model and a target distribution represented by a set of samples, implicit Metropolis-Hastings operates by learning a discriminator to estimate the density-ratio and then generating a chain of samples. Since the approximation of density ratio introduces an error on every step of the chain, it is crucial to analyze the stationary distribution of such chain. For that purpose, we present a theoretical result stating that the discriminator loss upper bounds the total variation distance between the target distribution and the stationary distribution. Finally, we validate the proposed algorithm both for independent and Markov proposals on CIFAR-10 and CelebA datasets.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
MFGDiffusion: Mask-Guided Smoke Synthesis for Enhanced Forest Fire Detection
Implementing Adaptations for Vision AutoRegressive Model
CharaConsist: Fine-Grained Consistent Character Generation
MGVQ: Could VQ-VAE Beat VAE? A Generalizable Tokenizer with Multi-group Quantization
NeoBabel: A Multilingual Open Tower for Visual Generation
Estimating Object Physical Properties from RGB-D Vision and Depth Robot Sensors Using Deep Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.