mlsanityData to 14 Oct 2026

Neural Graphical Models

arXiv 2210.00453 ↗First posted 2 Oct 2022cs.LG cs.AIcited by 11

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

  1. 2018DAGs with NO TEARS: Continuous Optimization for Structure Learningcited by 752
  2. 2019DAG-GNN: DAG Structure Learning with Graph Neural Networkscited by 331
  3. 2019Gradient-Based Neural DAG Learningcited by 227
  4. 2019Learning Sparse Nonparametric DAGscited by 207
  5. 2013Learning Bayesian Networks: The Combination of Knowledge and Statistical Datacited by 187
  6. 2016Composing graphical models with neural networks for structured representations and fast inferencecited by 113
  7. 2020Einsum Networks: Fast and Scalable Learning of Tractable Probabilistic Circuitscited by 103
  8. 2016Combining Markov Random Fields and Convolutional Neural Networks for Image Synthesiscited by 102
  9. 2016Neural Autoregressive Distribution Estimationcited by 95
  10. 2013RNADE: The real-valued neural autoregressive density-estimatorcited by 66
  11. 2019GLAD: Learning Sparse Graph Recoverycited by 23
  12. 2016Learning to Discover Sparse Graphical Modelscited by 11
3 more
  1. 2019Cooperative neural networks (CoNN): Exploiting prior independence structure for improved classificationcited by 6
  2. 2022uGLAD: Sparse graph recovery by optimizing deep unrolled networkscited by 6
  3. 2019AntMan: Sparse Low-Rank Compression to Accelerate RNN inferencecited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 1; 2023: 5; 2024: 2; 2025: 2; 2026: 1.

11 papers.