Learning Quadratic Variance Function (QVF) DAG models via OverDispersion Scoring (ODS)

04/28/2017
by   Gunwoong Park, et al.
0

Learning DAG or Bayesian network models is an important problem in multi-variate causal inference. However, a number of challenges arises in learning large-scale DAG models including model identifiability and computational complexity since the space of directed graphs is huge. In this paper, we address these issues in a number of steps for a broad class of DAG models where the noise or variance is signal-dependent. Firstly we introduce a new class of identifiable DAG models, where each node has a distribution where the variance is a quadratic function of the mean (QVF DAG models). Our QVF DAG models include many interesting classes of distributions such as Poisson, Binomial, Geometric, Exponential, Gamma and many other distributions in which the noise variance depends on the mean. We prove that this class of QVF DAG models is identifiable, and introduce a new algorithm, the OverDispersion Scoring (ODS) algorithm, for learning large-scale QVF DAG models. Our algorithm is based on firstly learning the moralized or undirected graphical model representation of the DAG to reduce the DAG search-space, and then exploiting the quadratic variance property to learn the causal ordering. We show through theoretical results and simulations that our algorithm is statistically consistent in the high-dimensional p>n setting provided that the degree of the moralized graph is bounded and performs well compared to state-of-the-art DAG-learning algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/08/2018

Learning Generalized Hypergeometric Distribution (GHD) DAG models

We introduce a new class of identifiable DAG models, where each node has...
research
11/01/2021

Efficient Learning of Quadratic Variance Function Directed Acyclic Graphs via Topological Layers

Directed acyclic graph (DAG) models are widely used to represent causal ...
research
10/05/2018

High-Dimensional Poisson DAG Model Learning Using ℓ_1-Regularized Regression

In this paper we develop a new approach for learning high-dimensional Po...
research
03/27/2023

Identifiability of causal graphs under nonadditive conditionally parametric causal models

Causal discovery from observational data is a very challenging, often im...
research
02/26/2021

Beware of the Simulated DAG! Varsortability in Additive Noise Models

Additive noise models are a class of causal models in which each variabl...
research
02/06/2013

Algorithms for Learning Decomposable Models and Chordal Graphs

Decomposable dependency models and their graphical counterparts, i.e., c...

Please sign up or login with your details

Forgot password? Click here to reset