An Iterative Closest Points Approach to Neural Generative Models

Abstract

We present a simple way to learn a transformation that maps samples of one distribution to the samples of another distribution. Our algorithm comprises an iteration of 1) drawing samples from some simple distribution and transforming them using a neural network, 2) determining pairwise correspondences between the transformed samples and training data (or a minibatch), and 3) optimizing the weights of the neural network being trained to minimize the distances between the corresponding vectors. This can be considered as a variant of the Iterative Closest Points (ICP) algorithm, common in geometric computer vision, although ICP typically operates on sensor point clouds and linear transforms instead of random sample sets and neural nonlinear transforms. We demonstrate the algorithm on simple synthetic data and MNIST data. We furthermore demonstrate that the algorithm is capable of handling distributions with both continuous and discrete variables.

Indexing errors have been corrected to this version

References in corpus (8)

• Improved Training of Wasserstein GANs
• The Concrete Distribution: A Continuous Relaxation of Discrete Random Variables
• Self-Normalizing Neural Networks
• Generative Moment Matching Networks
• Unsupervised Learning by Predicting Noise
• Optimizing the Latent Space of Generative Networks
• Variational Walkback: Learning a Transition Operator as a Stochastic Recurrent Net
• Shifting Mean Activation Towards Zero with Bipolar Activation Functions