11 citations · 70 across the 22 of their papers we have counts for
3 papers · 1 filter
Random clique covers for graphs with local density and global sparsity
Sinead A. Williamson, Mauricio Tec
Large real-world graphs tend to be sparse, but they often contain many densely connected subgraphs and exhibit high clustering coefficients. While recent random graph models can ca…
Scalable Bayesian Nonparametric Clustering and Classification
Yang Ni, Peter Müller, Maurice Diesendruck +3
We develop a scalable multi-step Monte Carlo algorithm for inference under a large class of nonparametric Bayesian models for clustering and classification. Each step is "embarrass…
Importance Weighted Generative Networks
Maurice Diesendruck, Ethan R. Elenberg, Rajat Sen +3
Deep generative networks can simulate from a complex target distribution, by minimizing a loss with respect to samples from that distribution. However, often we do not have direct…