Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp0179408079v
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorLiu, Han-
dc.contributor.authorLiu, Lydia-
dc.date.accessioned2017-07-19T18:18:44Z-
dc.date.available2017-07-19T18:18:44Z-
dc.date.created2017-04-12-
dc.date.issued2017-4-12-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/dsp0179408079v-
dc.description.abstractWe investigate the deeper use of maximum mean discrepancy (MMD), a statistical measure of the distance between distributions, in training generative adversarial networks (GAN), a framework for generative modeling using deep neural networks. The algorithm that uses MMD as a criterion to train generative models parametrized by deep neural network is called generative moment matching networks (GMMN).One of the goals of this work is to understand when MMD is a more effective loss function for training neural samplers than the GAN objective. By performing experiments with simulated data, we found that the original GAN actually performs worse than GMMN when the data does not have low-dimensional structure.We explore using extensions of MMD as the loss criterion in GMMN. In particular, these extensions are adaptive to the data. Our results suggest we could achieve state-of-the-art results with GMMN by using more sophisticated variants of MMD. We also show that MMD can be used as a regularizer to improve the stability of GANs.en_US
dc.language.isoen_USen_US
dc.titleOn the Two-Sample Statistic Approach to Generative Adversarial Networksen_US
dc.typePrinceton University Senior Theses-
pu.date.classyear2017en_US
pu.departmentOperations Research and Financial Engineeringen_US
pu.pdf.coverpageSeniorThesisCoverPage-
pu.contributor.authorid960862248-
pu.contributor.advisorid960033799-
pu.certificateApplications of Computing Programen_US
Appears in Collections:Operations Research and Financial Engineering, 2000-2020

Files in This Item:
File SizeFormat 
thesis.pdf2.28 MBAdobe PDF    Request a copy


Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.