A New Algorithm for Maximum Likelihood Estimation in Gaussian Graphical Models for Marginal Independence

10/19/2012
by   Mathias Drton, et al.
0

Graphical models with bi-directed edges (<->) represent marginal independence: the absence of an edge between two vertices indicates that the corresponding variables are marginally independent. In this paper, we consider maximum likelihood estimation in the case of continuous variables with a Gaussian joint distribution, sometimes termed a covariance graph model. We present a new fitting algorithm which exploits standard regression techniques and establish its convergence properties. Moreover, we contrast our procedure to existing estimation methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/23/2021

Symmetries in Directed Gaussian Graphical Models

We define Gaussian graphical models on directed acyclic graphs with colo...
research
01/09/2008

Parameterizations and fitting of bi-directed graph models to categorical data

We discuss two parameterizations of models for marginal independencies f...
research
09/28/2012

Partial Gaussian Graphical Model Estimation

This paper studies the partial estimation of Gaussian graphical models f...
research
12/19/2021

Marginal Independence Models

We impose rank one constraints on marginalizations of a tensor, given by...
research
04/21/2015

A local approach to estimation in discrete loglinear models

We consider two connected aspects of maximum likelihood estimation of th...
research
07/11/2012

Iterative Conditional Fitting for Gaussian Ancestral Graph Models

Ancestral graph models, introduced by Richardson and Spirtes (2002), gen...
research
03/30/2020

Invariant theory and scaling algorithms for maximum likelihood estimation

We show that maximum likelihood estimation in statistics is equivalent t...

Please sign up or login with your details

Forgot password? Click here to reset