Fast iterative proportional scaling for Gaussian graphical models

12/20/2021
by   Soren Hojsgaard, et al.
0

In Gaussian graphical models, the likelihood equations must typically be solved iteratively, for example by iterative proportional scaling. However, this method may not scale well to models with many variables because it involves repeated inversion of large matrices. We present a version of the algorithm which avoids these inversions, resulting in increased speed, in particular when graphs are sparse.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/08/2022

Robustly fitting Gaussian graphical models: the R-package robFitConGraph

The paper gives a tutorial-style introduction to the R-package robFitCon...
research
11/15/2017

Semiblind subgraph reconstruction in Gaussian graphical models

Consider a social network where only a few nodes (agents) have meaningfu...
research
10/08/2016

Iterative proportional scaling revisited: a modern optimization perspective

This paper revisits the classic iterative proportional scaling (IPS) fro...
research
12/04/2019

Gaussian graphical models with toric vanishing ideals

Gaussian graphical models are semi-algebraic subsets of the cone of posi...
research
12/12/2012

IPF for Discrete Chain Factor Graphs

Iterative Proportional Fitting (IPF), combined with EM, is commonly used...
research
08/10/2020

Wigner and Wishart Ensembles for graphical models

Vinberg cones and the ambient vector spaces are important in modern stat...
research
10/19/2018

AdaPtive Noisy Data Augmentation (PANDA) for Simultaneous Construction Multiple Graph Models

We extend the data augmentation technique (PANDA) by Li et al. (2018) fo...

Please sign up or login with your details

Forgot password? Click here to reset