Margins of discrete Bayesian networks
From MaRDI portal
Publication:1991671
DOI10.1214/17-AOS1631zbMATH Open1408.62044arXiv1501.02103MaRDI QIDQ1991671FDOQ1991671
Authors: Yanyan Li 
Publication date: 30 October 2018
Published in: The Annals of Statistics (Search for Journal in Brave)
Abstract: Bayesian network models with latent variables are widely used in statistics and machine learning. In this paper we provide a complete algebraic characterization of Bayesian network models with latent variables when the observed variables are discrete and no assumption is made about the state-space of the latent variables. We show that it is algebraically equivalent to the so-called nested Markov model, meaning that the two are the same up to inequality constraints on the joint probabilities. In particular these two models have the same dimension. The nested Markov model is therefore the best possible description of the latent variable model that avoids consideration of inequalities, which are extremely complicated in general. A consequence of this is that the constraint finding algorithm of Tian and Pearl (UAI 2002, pp519-527) is complete for finding equality constraints. Latent variable models suffer from difficulties of unidentifiable parameters and non-regular asymptotics; in contrast the nested Markov model is fully identifiable, represents a curved exponential family of known dimension, and can easily be fitted using an explicit parameterization.
Full work available at URL: https://arxiv.org/abs/1501.02103
Recommendations
- Smooth, identifiable supermodels of discrete DAG models with latent variables
- Graphs for margins of Bayesian networks
- Identification of discrete concentration graph models with one hidden binary variable
- Algebraic geometry of Bayesian networks
- Geometry, moments and conditional independence trees with hidden variables.
Bayesian inference (62F15) Markov processes: hypothesis testing (62M02) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)
Cites Work
- Causation, prediction, and search
- Title not available (Why is that?)
- Pattern recognition and machine learning.
- Likelihood ratio tests and singularities
- A new approach to causal inference in mortality studies with a sustained exposure period—application to control of the healthy worker survivor effect
- Causality. Models, reasoning, and inference
- Influence Diagrams for Causal Modelling and Inference
- Identifiability of parameters in latent structure models with many observed variables
- Ancestral graph Markov models.
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Modeling and Reasoning with Bayesian Networks
- Statistics, causality and Bell's theorem
- Markov Properties for Acyclic Directed Mixed Graphs
- Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
- Algorithms in real algebraic geometry
- The hidden life of latent variables: Bayesian learning with mixed graph models
- Theory-independent limits on correlations from generalized Bayesian networks
- Markovian acyclic directed mixed graphs for discrete data
- Algebraic geometry of Bayesian networks
- On the causal interpretation of acyclic mixed graphs under multivariate normality
- Graphs for margins of Bayesian networks
Cited In (13)
- A study of recently discovered equalities about latent tree models using inverse edges
- Smooth, identifiable supermodels of discrete DAG models with latent variables
- Discretisation Does Affect the Performance of Bayesian Networks
- Graphs for margins of Bayesian networks
- Latent free equivalent mDAGs
- An Automated Approach to Causal Inference in Discrete Settings
- Marginal Markov subgraph of Bayesian network and its applications
- Foundations of structural causal models with cycles and latent variables
- Analysis of Markov boundary induction in Bayesian networks: a new view from matroid theory
- Causal structure learning: a combinatorial perspective
- Discrete max-linear Bayesian networks
- Nested Markov properties for acyclic directed mixed graphs
- Decision boundary for discrete Bayesian network classifiers
Uses Software
This page was built for publication: Margins of discrete Bayesian networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1991671)
