Pith. sign in

REVIEW 1 cited by

Graph Mixture Density Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2012.03085 v3 pith:WWP2EM5X submitted 2020-12-05 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords densitygraphmixturenetworksoutputconditionaldistributionsepidemic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We introduce the Graph Mixture Density Networks, a new family of machine learning models that can fit multimodal output distributions conditioned on graphs of arbitrary topology. By combining ideas from mixture models and graph representation learning, we address a broader class of challenging conditional density estimation problems that rely on structured data. In this respect, we evaluate our method on a new benchmark application that leverages random graphs for stochastic epidemic simulations. We show a significant improvement in the likelihood of epidemic outcomes when taking into account both multimodality and structure. The empirical analysis is complemented by two real-world regression tasks showing the effectiveness of our approach in modeling the output prediction uncertainty. Graph Mixture Density Networks open appealing research opportunities in the study of structure-dependent phenomena that exhibit non-trivial conditional output distributions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learnable Kernel Density Estimation for Graphs and Its Application to Graph-Level Anomaly Detection

    cs.LG 2025-05 reject novelty 6.0 of 10

    LGKDE learns a maximum mean discrepancy based graph metric and fits a multi-scale kernel density estimator, using perturbed graphs as contrastive targets for graph-level anomaly detection.

Pith tools