REVIEW 2 cited by
Neural Graphical Models
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
Signed reviews
read the original abstract
Probabilistic Graphical Models are often used to understand dynamics of a system. They can model relationships between features (nodes) and the underlying distribution. Theoretically these models can represent very complex dependency functions, but in practice often simplifying assumptions are made due to computational limitations associated with graph operations. In this work we introduce Neural Graphical Models (NGMs) which attempt to represent complex feature dependencies with reasonable computational costs. Given a graph of feature relationships and corresponding samples, we capture the dependency structure between the features along with their complex function representations by using a neural network as a multi-task learning framework. We provide efficient learning, inference and sampling algorithms. NGMs can fit generic graph structures including directed, undirected and mixed-edge graphs as well as support mixed input data types. We present empirical studies that show NGMs' capability to represent Gaussian graphical models, perform inference analysis of a lung cancer data and extract insights from a real world infant mortality data provided by Centers for Disease Control and Prevention.
Forward citations
Cited by 2 Pith papers
-
Markov Missing Graph: A Graphical Approach for Missing Data Imputation
Markov missing graphs plus the Principle of Available Information identify the full-data distribution and lead to a flexible imputation risk-minimization framework.
-
Obstacle-aware Gaussian Process Regression
GP-ND adds a log-KL divergence penalty between a GP's predictive distribution and Gaussian blobs placed on negative data pairs, aiming to fit positive points while avoiding obstacles.
Discussion (0). Continue with ORCID to comment.