English

Variational Autoencoders for Sparse and Overdispersed Discrete Data

Machine Learning 2019-05-27 v2 Machine Learning

Abstract

Many applications, such as text modelling, high-throughput sequencing, and recommender systems, require analysing sparse, high-dimensional, and overdispersed discrete (count-valued or binary) data. Although probabilistic matrix factorisation and linear/nonlinear latent factor models have enjoyed great success in modelling such data, many existing models may have inferior modelling performance due to the insufficient capability of modelling overdispersion in count-valued data and model misspecification in general. In this paper, we comprehensively study these issues and propose a variational autoencoder based framework that generates discrete data via negative-binomial distribution. We also examine the model's ability to capture properties, such as self- and cross-excitations in discrete data, which is critical for modelling overdispersion. We conduct extensive experiments on three important problems from discrete data analysis: text analysis, collaborative filtering, and multi-label learning. Compared with several state-of-the-art baselines, the proposed models achieve significantly better performance on the above problems.

Keywords

Cite

@article{arxiv.1905.00616,
  title  = {Variational Autoencoders for Sparse and Overdispersed Discrete Data},
  author = {He Zhao and Piyush Rai and Lan Du and Wray Buntine and Mingyuan Zhou},
  journal= {arXiv preprint arXiv:1905.00616},
  year   = {2019}
}
R2 v1 2026-06-23T08:54:56.097Z