Neural Graphical Models
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 15 of its 48 references that are in the map. First posted on arXiv 2 Oct 2022.
Builds on
15 of 48 references.
References · 15
- 2018DAGs with NO TEARS: Continuous Optimization for Structure Learningcited by 752
- 2019DAG-GNN: DAG Structure Learning with Graph Neural Networkscited by 331
- 2019Gradient-Based Neural DAG Learningcited by 227
- 2019Learning Sparse Nonparametric DAGscited by 207
- 2013Learning Bayesian Networks: The Combination of Knowledge and Statistical Datacited by 187
- 2016Composing graphical models with neural networks for structured representations and fast inferencecited by 113
- 2020Einsum Networks: Fast and Scalable Learning of Tractable Probabilistic Circuitscited by 103
- 2016Combining Markov Random Fields and Convolutional Neural Networks for Image Synthesiscited by 102
- 2016Neural Autoregressive Distribution Estimationcited by 95
- 2013RNADE: The real-valued neural autoregressive density-estimatorcited by 66
- 2019GLAD: Learning Sparse Graph Recoverycited by 23
- 2016Learning to Discover Sparse Graphical Modelscited by 11
Built on by
Citing papers per year: 2022: 1; 2023: 5; 2024: 2; 2025: 2; 2026: 1.
11 papers.
- 2022Methods for Recovering Conditional Independence Graphs: A Surveycited by 7
- 2023Neural Graph Revealerscited by 3
- 2023Federated Learning with Neural Graphical Modelscited by 2
- 2025Deep Copula Classifier: Theory, Consistency, and Empirical Evaluationcited by 1
- 2023Are uGLAD? Time will tell!cited by 0
- 2023Knowledge Propagation over Conditional Independence Graphscited by 0
- 2023Ensemble Mask Networkscited by 0
- 2024Generative Kaleidoscopic Networkscited by 0
- 2024Obstacle-aware Gaussian Process Regressioncited by 0
- 2025Simulation-free Structure Learning for Stochastic Population Dynamicscited by 0
- 2026Out of Context: Reliability in Multimodal Anomaly Detection Requires Contextual Inferencecited by 0
- 2026Out of Context: Reliability in Multimodal Anomaly Detection Requires Contextual Inference14 Apr 2026
- 2025Simulation-free Structure Learning for Stochastic Population Dynamics18 Oct 2025
- 2025Deep Copula Classifier: Theory, Consistency, and Empirical Evaluation29 May 2025
- 2024Obstacle-aware Gaussian Process Regression9 Dec 2024
- 2024Generative Kaleidoscopic Networks19 Feb 2024
- 2023Federated Learning with Neural Graphical Models20 Sep 2023
- 2023Ensemble Mask Networks12 Sep 2023
- 2023Knowledge Propagation over Conditional Independence Graphs10 Aug 2023
- 2023Are uGLAD? Time will tell!21 Mar 2023
- 2023Neural Graph Revealers27 Feb 2023
- 2022Methods for Recovering Conditional Independence Graphs: A Survey13 Nov 2022