arXiv (Cornell University) · 2018 · 43 citations · 13 references
ComputingComputer ScienceCategorical Data AnalysisFeature EngineeringMachine LearningDeep LearningGenerative ArchitectureGenerative ModelingRepresentation LearningData SparsityGenerative Adversarial NetworksSparsity ConstraintsSparsity Problem
We propose a method to train generative adversarial networks on mutivariate feature vectors representing multiple categorical values. In contrast to the continuous domain, where GAN-based methods have delivered considerable results, GANs struggle to perform equally well on discrete data. We propose and compare several architectures based on multiple (Gumbel) softmax output layers taking into account the structure of the data. We evaluate the performance of our architecture on datasets with different sparsity, number of features, ranges of categorical values, and dependencies among the features. Our proposed architecture and method outperforms existing models.
13
Adam: A Method for Stochastic Optimization
Diederik P. Kingma, Jimmy Ba · UvA-DARE (University of Amsterdam) · 2014 · 84.8K citations · Full text
UCI Machine Learning Repository
Arthur Asuncion · Medical Entomology and Zoology · 2007 · 24.4K citations
Improved Training of Wasserstein GANs
Ishaan Gulrajani, Faruk Ahmed, Martín Arjovsky et al. · arXiv (Cornell University) · 2017 · 1.5K citations · Full text
Jointly Embedding Multiple Single-Cell Omics Measurements
arXiv (Cornell University) · 2019 · 1.3K citations · Full text