Title
Kernel Mean Matching for Content Addressability of GANs.
Abstract
We propose a novel procedure which adds "content-addressability" to any given unconditional implicit model e.g., a generative adversarial network (GAN). The procedure allows users to control the generative process by specifying a set (arbitrary size) of desired examples based on which similar samples are generated from the model. The proposed approach, based on kernel mean matching, is applicable to any generative models which transform latent vectors to samples, and does not require retraining of the model. Experiments on various high-dimensional image generation problems (CelebA-HQ, LSUN bedroom, bridge, tower) show that our approach is able to generate images which are consistent with the input set, while retaining the image quality of the original model. To our knowledge, this is the first work that attempts to construct, at test time, a content-addressable generative model from a trained marginal model.
Year
Venue
Field
2019
international conference on machine learning
Kernel (linear algebra),Image generation,Generative adversarial network,Image quality,Artificial intelligence,Addressability,Generative grammar,Mathematics,Machine learning,Generative model,Marginal model
DocType
Volume
Citations 
Journal
abs/1905.05882
0
PageRank 
References 
Authors
0.34
0
6
Name
Order
Citations
PageRank
Wittawat Jitkrittum1445.36
Patsorn Sangkloy21435.60
Muhammad Waleed Gondal302.03
amit raj4464.19
James Hays53942172.72
Bernhard Schölkopf6231203091.82